Submission #1680287
Source Code Expand
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <time.h> #include <math.h> #include <vector> #include <map> #include <set> #include <stack> #include <queue> #include <string> #include <iostream> #include <algorithm> using namespace std; #define getmid(l,r) ((l) + ((r) - (l)) / 2) #define MEM(a,b) memset(a,b,sizeof(a)) #define MP(a,b) make_pair(a,b) #define PB push_back typedef long long ll; typedef pair<int,int> pii; const double eps = 1e-8; const int INF = (1 << 30) - 1; ll N,A; ll Q_pow(ll x,int y){ ll res = 1; while(y){ if(y & 1) res = res * x; x = x * x; y >>= 1; } return res; } ll Cal(int num,ll v){ ll t = v / num; ll qp = Q_pow(t,num - 1); ll mul = num == 1 ? v : qp * (v - qp); return A * num + v + N / mul + (N % mul ? 1 : 0); } int main(){ //for(int i = 2; i <= 8; ++i){ // int j = i / 2; // int mul = j * (i - j); // int t = i + 40 / mul + (40 % mul ? 1 : 0); // printf("%d - %d\n",i,t); //} scanf("%lld%lld",&N,&A); ll ans = N; for(int i = 1; i <= 1000000; ++i){ ll l = i,r = N; while(l + 1 < r){ ll mid1 = (l + r) / 2,mid2 = (mid1 + r) / 2; ll r1 = Cal(i,mid1); ll r2 = Cal(i,mid2); //printf("%lld -> %lld ,,, %lld -> %lld\n",mid1,r1,mid2,r2); if(r1 < r2){ r = mid2; } else{ l = mid1; } } ll res = Cal(i,l); //printf("%d %lld %lld -- %lld\n",i,l,r,res); for(ll j = l + 1; j <= r; ++j) res = min(res,Cal(i,j)); if(res > ans) break; ans = res; } printf("%lld\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | Natureal |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1574 Byte |
Status | RE |
Exec Time | 127 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:52:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld",&N,&A); ^
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | 0 / 500 | ||||||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | WA | 1 ms | 256 KB |
01-02.txt | WA | 1 ms | 256 KB |
01-03.txt | WA | 1 ms | 256 KB |
01-04.txt | WA | 1 ms | 256 KB |
01-05.txt | WA | 1 ms | 256 KB |
01-06.txt | WA | 1 ms | 256 KB |
01-07.txt | WA | 1 ms | 256 KB |
01-08.txt | WA | 1 ms | 256 KB |
01-09.txt | WA | 1 ms | 256 KB |
01-10.txt | WA | 1 ms | 256 KB |
01-11.txt | WA | 1 ms | 256 KB |
01-12.txt | WA | 1 ms | 256 KB |
01-13.txt | AC | 1 ms | 256 KB |
01-14.txt | WA | 1 ms | 256 KB |
01-15.txt | WA | 1 ms | 256 KB |
01-16.txt | WA | 1 ms | 256 KB |
01-17.txt | WA | 1 ms | 256 KB |
01-18.txt | WA | 1 ms | 256 KB |
01-19.txt | RE | 127 ms | 256 KB |
01-20.txt | AC | 1 ms | 256 KB |
01-21.txt | AC | 1 ms | 256 KB |
01-22.txt | AC | 1 ms | 256 KB |
01-23.txt | AC | 1 ms | 256 KB |
01-24.txt | AC | 1 ms | 256 KB |
01-25.txt | AC | 1 ms | 256 KB |
01-26.txt | AC | 1 ms | 256 KB |
02-01.txt | AC | 1 ms | 256 KB |
02-02.txt | WA | 1 ms | 256 KB |
02-03.txt | WA | 1 ms | 256 KB |
02-04.txt | WA | 1 ms | 256 KB |
02-05.txt | WA | 1 ms | 256 KB |
02-06.txt | WA | 1 ms | 256 KB |
02-07.txt | WA | 1 ms | 256 KB |
02-08.txt | WA | 1 ms | 256 KB |
02-09.txt | WA | 1 ms | 256 KB |
02-10.txt | WA | 1 ms | 256 KB |
02-11.txt | WA | 1 ms | 256 KB |
02-12.txt | WA | 1 ms | 256 KB |
02-13.txt | WA | 1 ms | 256 KB |
02-14.txt | WA | 1 ms | 256 KB |
02-15.txt | WA | 1 ms | 256 KB |
02-16.txt | WA | 1 ms | 256 KB |
02-17.txt | WA | 1 ms | 256 KB |
02-18.txt | WA | 1 ms | 256 KB |
02-19.txt | WA | 1 ms | 256 KB |
02-20.txt | WA | 1 ms | 256 KB |
02-21.txt | WA | 1 ms | 256 KB |
02-22.txt | WA | 1 ms | 256 KB |
02-23.txt | WA | 1 ms | 256 KB |
02-24.txt | AC | 1 ms | 256 KB |
02-25.txt | WA | 1 ms | 256 KB |
02-26.txt | RE | 99 ms | 256 KB |
02-27.txt | RE | 99 ms | 256 KB |
02-28.txt | RE | 98 ms | 256 KB |
02-29.txt | WA | 1 ms | 256 KB |
02-30.txt | WA | 1 ms | 256 KB |
02-31.txt | RE | 98 ms | 256 KB |
02-32.txt | WA | 1 ms | 256 KB |
02-33.txt | WA | 1 ms | 256 KB |
02-34.txt | WA | 1 ms | 256 KB |
02-35.txt | WA | 1 ms | 256 KB |
02-36.txt | RE | 98 ms | 256 KB |
02-37.txt | WA | 1 ms | 256 KB |
02-38.txt | WA | 1 ms | 256 KB |
02-39.txt | WA | 1 ms | 256 KB |
02-40.txt | WA | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | WA | 1 ms | 256 KB |