#include "prize.h"
#include <fstream>
#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
const int nmax=200005;
const int prdf=500;//modifici dupa asta
int lg[nmax];
int spec[nmax],norm[nmax],us[nmax];
int mx,nr,i,gasit;
vector<int> v[nmax];
int cate_st(int poz)
{
if(v[poz].empty()) v[poz]=ask(poz);
return v[poz][0];
}
int cate(int poz)
{
if(v[poz].empty()) v[poz]=ask(poz);
if(!(v[poz][0]+v[poz][1])) gasit=1;
return (v[poz][0]+v[poz][1]);
}
int cate_dr(int poz)
{
return (cate(poz)-cate_st(poz));
}
int n;
void solve(int st,int dr)
{
if(st>dr) return;
if(gasit) return;
if(cate(st)!=cate(dr))
{
if(cate(st)<cate(dr))
{
if(!us[st])spec[++nr]=st,us[st]=1;
solve(st+1,dr);
return;
}
if(!us[dr])spec[++nr]=dr,us[dr]=1;
solve(st,dr-1);
return;
}
if(st==dr&&cate(st)<mx)
{
if(!us[st]) spec[++nr]=st,us[st]=1;
}
if(st+1>=dr) return;
if(cate_st(st)+cate_dr(dr)==cate(st)) return;
int m=(st+dr)/2;
solve(st,m);
solve(m,dr);
}
int find_best(int N) {
n=N;
for(i=0;i<min(prdf,n);i++)
{
v[i]=ask(i);
if(v[i][0]+v[i][1]>mx)
mx=v[i][0]+v[i][1];
}
spec[0]=-1;
for(i=0;i<min(prdf,n);i++)
{
if(v[i][0]+v[i][1]!=mx)
{
++nr;norm[i]=nr;spec[nr]=i;
if(!cate(i)) return i;
}
}
solve(prdf,n-1);
for(i=1;i<=mx;i++)
if(cate(spec[i])==0)
return spec[i];
return 0;
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:74:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(i=1;i<=mx;i++)
^~~
prize.cpp:77:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
return 0;
^~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
5148 KB |
Output is correct |
| 2 |
Correct |
10 ms |
5032 KB |
Output is correct |
| 3 |
Correct |
10 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
11 ms |
5032 KB |
Output is correct |
| 5 |
Correct |
10 ms |
4992 KB |
Output is correct |
| 6 |
Correct |
8 ms |
5136 KB |
Output is correct |
| 7 |
Correct |
8 ms |
5172 KB |
Output is correct |
| 8 |
Correct |
8 ms |
5164 KB |
Output is correct |
| 9 |
Correct |
8 ms |
5048 KB |
Output is correct |
| 10 |
Correct |
9 ms |
5120 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
5140 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5140 KB |
Output is correct |
| 3 |
Correct |
10 ms |
4992 KB |
Output is correct |
| 4 |
Correct |
9 ms |
5128 KB |
Output is correct |
| 5 |
Correct |
9 ms |
5044 KB |
Output is correct |
| 6 |
Correct |
8 ms |
5128 KB |
Output is correct |
| 7 |
Correct |
12 ms |
5112 KB |
Output is correct |
| 8 |
Correct |
10 ms |
5148 KB |
Output is correct |
| 9 |
Correct |
8 ms |
5124 KB |
Output is correct |
| 10 |
Correct |
15 ms |
4992 KB |
Output is correct |
| 11 |
Correct |
9 ms |
5140 KB |
Output is correct |
| 12 |
Correct |
11 ms |
4992 KB |
Output is correct |
| 13 |
Correct |
14 ms |
5112 KB |
Output is correct |
| 14 |
Correct |
16 ms |
5112 KB |
Output is correct |
| 15 |
Correct |
12 ms |
5272 KB |
Output is correct |
| 16 |
Correct |
38 ms |
5756 KB |
Output is correct |
| 17 |
Correct |
13 ms |
4992 KB |
Output is correct |
| 18 |
Partially correct |
47 ms |
5948 KB |
Partially correct - number of queries: 5105 |
| 19 |
Correct |
11 ms |
4992 KB |
Output is correct |
| 20 |
Correct |
18 ms |
5160 KB |
Output is correct |
| 21 |
Correct |
22 ms |
5368 KB |
Output is correct |
| 22 |
Correct |
9 ms |
5148 KB |
Output is correct |
| 23 |
Correct |
8 ms |
5148 KB |
Output is correct |
| 24 |
Correct |
8 ms |
5140 KB |
Output is correct |
| 25 |
Correct |
29 ms |
5496 KB |
Output is correct |
| 26 |
Correct |
35 ms |
5496 KB |
Output is correct |
| 27 |
Correct |
8 ms |
5036 KB |
Output is correct |
| 28 |
Correct |
43 ms |
5752 KB |
Output is correct |
| 29 |
Correct |
34 ms |
5752 KB |
Output is correct |
| 30 |
Partially correct |
38 ms |
5880 KB |
Partially correct - number of queries: 5063 |
| 31 |
Correct |
8 ms |
5048 KB |
Output is correct |
| 32 |
Correct |
9 ms |
5128 KB |
Output is correct |
| 33 |
Correct |
8 ms |
5040 KB |
Output is correct |
| 34 |
Correct |
21 ms |
5240 KB |
Output is correct |
| 35 |
Correct |
8 ms |
5140 KB |
Output is correct |
| 36 |
Correct |
13 ms |
5252 KB |
Output is correct |
| 37 |
Correct |
13 ms |
5032 KB |
Output is correct |
| 38 |
Correct |
11 ms |
5012 KB |
Output is correct |
| 39 |
Correct |
17 ms |
5540 KB |
Output is correct |
| 40 |
Correct |
37 ms |
5884 KB |
Output is correct |
| 41 |
Correct |
20 ms |
5592 KB |
Output is correct |
| 42 |
Correct |
31 ms |
5624 KB |
Output is correct |
| 43 |
Correct |
18 ms |
5620 KB |
Output is correct |
| 44 |
Correct |
23 ms |
5368 KB |
Output is correct |
| 45 |
Correct |
13 ms |
5324 KB |
Output is correct |
| 46 |
Correct |
11 ms |
4992 KB |
Output is correct |
| 47 |
Correct |
22 ms |
5368 KB |
Output is correct |
| 48 |
Correct |
24 ms |
5640 KB |
Output is correct |
| 49 |
Correct |
14 ms |
5112 KB |
Output is correct |
| 50 |
Partially correct |
24 ms |
5936 KB |
Partially correct - number of queries: 5105 |
| 51 |
Correct |
25 ms |
5368 KB |
Output is correct |
| 52 |
Correct |
8 ms |
5144 KB |
Output is correct |
| 53 |
Correct |
8 ms |
5140 KB |
Output is correct |
| 54 |
Correct |
22 ms |
5368 KB |
Output is correct |
| 55 |
Correct |
8 ms |
5128 KB |
Output is correct |
| 56 |
Partially correct |
45 ms |
5928 KB |
Partially correct - number of queries: 5089 |
| 57 |
Correct |
21 ms |
5640 KB |
Output is correct |
| 58 |
Correct |
21 ms |
5576 KB |
Output is correct |
| 59 |
Correct |
25 ms |
5496 KB |
Output is correct |
| 60 |
Correct |
31 ms |
5432 KB |
Output is correct |
| 61 |
Correct |
11 ms |
4992 KB |
Output is correct |
| 62 |
Correct |
12 ms |
4992 KB |
Output is correct |
| 63 |
Correct |
14 ms |
5112 KB |
Output is correct |
| 64 |
Correct |
11 ms |
4992 KB |
Output is correct |
| 65 |
Correct |
10 ms |
4992 KB |
Output is correct |
| 66 |
Correct |
12 ms |
5112 KB |
Output is correct |
| 67 |
Correct |
10 ms |
5064 KB |
Output is correct |
| 68 |
Correct |
13 ms |
4992 KB |
Output is correct |
| 69 |
Correct |
11 ms |
5156 KB |
Output is correct |
| 70 |
Correct |
12 ms |
5112 KB |
Output is correct |
| 71 |
Partially correct |
47 ms |
5928 KB |
Partially correct - number of queries: 5261 |
| 72 |
Correct |
17 ms |
5112 KB |
Output is correct |
| 73 |
Partially correct |
50 ms |
5912 KB |
Partially correct - number of queries: 5198 |
| 74 |
Partially correct |
54 ms |
5928 KB |
Partially correct - number of queries: 5225 |
| 75 |
Correct |
13 ms |
5036 KB |
Output is correct |
| 76 |
Correct |
44 ms |
5944 KB |
Output is correct |
| 77 |
Partially correct |
55 ms |
5976 KB |
Partially correct - number of queries: 5276 |
| 78 |
Correct |
17 ms |
5272 KB |
Output is correct |
| 79 |
Correct |
34 ms |
5780 KB |
Output is correct |
| 80 |
Partially correct |
55 ms |
5928 KB |
Partially correct - number of queries: 5234 |
| 81 |
Partially correct |
56 ms |
5880 KB |
Partially correct - number of queries: 5233 |
| 82 |
Partially correct |
41 ms |
5924 KB |
Partially correct - number of queries: 5204 |
| 83 |
Correct |
16 ms |
5112 KB |
Output is correct |
| 84 |
Correct |
38 ms |
5880 KB |
Output is correct |
| 85 |
Partially correct |
51 ms |
5928 KB |
Partially correct - number of queries: 5221 |
| 86 |
Correct |
10 ms |
5128 KB |
Output is correct |
| 87 |
Correct |
10 ms |
4992 KB |
Output is correct |
| 88 |
Correct |
11 ms |
5120 KB |
Output is correct |
| 89 |
Correct |
8 ms |
5128 KB |
Output is correct |
| 90 |
Correct |
9 ms |
5128 KB |
Output is correct |
| 91 |
Correct |
10 ms |
4992 KB |
Output is correct |
| 92 |
Correct |
11 ms |
5120 KB |
Output is correct |
| 93 |
Correct |
10 ms |
5120 KB |
Output is correct |
| 94 |
Correct |
15 ms |
5112 KB |
Output is correct |
| 95 |
Correct |
15 ms |
5160 KB |
Output is correct |
| 96 |
Correct |
16 ms |
5112 KB |
Output is correct |
| 97 |
Correct |
14 ms |
5120 KB |
Output is correct |
