Submission #81069

# Submission time Handle Problem Language Result Execution time Memory
81069 2018-10-23T16:16:17 Z faustaadp The Big Prize (IOI17_prize) C++17
20 / 100
134 ms 6564 KB
#include "prize.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
int L,R,j,b[202020],C,nx,ma;
vector<int> d[202020];
int find_best(int n) {
    vector<pair<int,vector<int> > > v;
	for(int i = 0; i < n; i++)
    {
        L=i+1;
        R=n-1;
        vector<int> res;
        if(b[i]==1)res=d[i];
        else res=ask(i);
        b[i]=1;
        d[i]=res;
        ma=max(ma,res[0]+res[1]);
        if(res[0] + res[1] == 0)return i;
        if(res[0]+res[1]<ma)R=min(n-1,i+4);
        for(j=0;j<v.size();j++)
            if(v[j].se==res)
                L=max(v[j].fi+1,L);
        for(j=0;j<v.size();j++)
            if(v[j].se!=res&&v[j].fi>i)
            {
                R=min(R,v[j].fi);
                break;
            }
        nx=L;
        while(L<R)
        {
            C=(L+R)/2;
            vector<int> temp;
            if(b[C])temp=d[C];
            else    temp=ask(C);
            if(!b[C])
            v.pb(mp(C,temp));
            if(temp[0]+temp[1]==0)return C;
            b[C]=1;
            d[C]=temp;
            ma=max(ma,temp[0]+temp[1]);
            if(res[0]+res[1]<ma)break;
            if(temp==res)
            {
                nx=C;
                L=C+1;
            }
            else
                R=C-1;
        }
        sort(v.begin(),v.end());
        i=nx;
	}
	return 0;
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:25:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0;j<v.size();j++)
                 ~^~~~~~~~~
prize.cpp:28:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0;j<v.size();j++)
                 ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 6 ms 5188 KB Output is correct
3 Correct 7 ms 5228 KB Output is correct
4 Correct 6 ms 5228 KB Output is correct
5 Correct 6 ms 5344 KB Output is correct
6 Correct 7 ms 5344 KB Output is correct
7 Correct 6 ms 5412 KB Output is correct
8 Correct 6 ms 5412 KB Output is correct
9 Correct 6 ms 5412 KB Output is correct
10 Correct 7 ms 5412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 5412 KB Output is correct
2 Correct 7 ms 5412 KB Output is correct
3 Correct 6 ms 5412 KB Output is correct
4 Correct 6 ms 5412 KB Output is correct
5 Correct 6 ms 5412 KB Output is correct
6 Correct 6 ms 5412 KB Output is correct
7 Correct 6 ms 5412 KB Output is correct
8 Correct 6 ms 5412 KB Output is correct
9 Correct 6 ms 5412 KB Output is correct
10 Correct 6 ms 5412 KB Output is correct
11 Correct 7 ms 5464 KB Output is correct
12 Correct 6 ms 5464 KB Output is correct
13 Correct 11 ms 5688 KB Output is correct
14 Correct 9 ms 5688 KB Output is correct
15 Correct 14 ms 5688 KB Output is correct
16 Correct 93 ms 6328 KB Output is correct
17 Correct 6 ms 6328 KB Output is correct
18 Partially correct 128 ms 6548 KB Partially correct - number of queries: 5069
19 Correct 7 ms 6548 KB Output is correct
20 Correct 20 ms 6548 KB Output is correct
21 Correct 29 ms 6548 KB Output is correct
22 Correct 10 ms 6548 KB Output is correct
23 Correct 7 ms 6548 KB Output is correct
24 Correct 6 ms 6548 KB Output is correct
25 Correct 40 ms 6548 KB Output is correct
26 Correct 46 ms 6548 KB Output is correct
27 Correct 8 ms 6548 KB Output is correct
28 Correct 102 ms 6548 KB Output is correct
29 Correct 83 ms 6548 KB Output is correct
30 Partially correct 134 ms 6548 KB Partially correct - number of queries: 5033
31 Correct 7 ms 6548 KB Output is correct
32 Correct 10 ms 6548 KB Output is correct
33 Correct 6 ms 6548 KB Output is correct
34 Correct 24 ms 6548 KB Output is correct
35 Correct 8 ms 6548 KB Output is correct
36 Correct 21 ms 6548 KB Output is correct
37 Correct 7 ms 6548 KB Output is correct
38 Correct 7 ms 6548 KB Output is correct
39 Correct 41 ms 6548 KB Output is correct
40 Correct 94 ms 6548 KB Output is correct
41 Correct 50 ms 6548 KB Output is correct
42 Correct 67 ms 6548 KB Output is correct
43 Correct 39 ms 6548 KB Output is correct
44 Correct 33 ms 6548 KB Output is correct
45 Correct 21 ms 6548 KB Output is correct
46 Correct 7 ms 6548 KB Output is correct
47 Correct 34 ms 6548 KB Output is correct
48 Correct 76 ms 6548 KB Output is correct
49 Correct 9 ms 6548 KB Output is correct
50 Partially correct 124 ms 6548 KB Partially correct - number of queries: 5075
51 Correct 35 ms 6548 KB Output is correct
52 Correct 7 ms 6548 KB Output is correct
53 Correct 8 ms 6548 KB Output is correct
54 Correct 36 ms 6548 KB Output is correct
55 Correct 7 ms 6548 KB Output is correct
56 Partially correct 117 ms 6564 KB Partially correct - number of queries: 5089
57 Correct 68 ms 6564 KB Output is correct
58 Correct 76 ms 6564 KB Output is correct
59 Correct 91 ms 6564 KB Output is correct
60 Correct 46 ms 6564 KB Output is correct
61 Correct 8 ms 6564 KB Output is correct
62 Correct 6 ms 6564 KB Output is correct
63 Correct 7 ms 6564 KB Output is correct
64 Correct 7 ms 6564 KB Output is correct
65 Correct 6 ms 6564 KB Output is correct
66 Correct 9 ms 6564 KB Output is correct
67 Correct 6 ms 6564 KB Output is correct
68 Correct 11 ms 6564 KB Output is correct
69 Incorrect 9 ms 6564 KB answer is not correct
70 Halted 0 ms 0 KB -