oj.uz

Submission #81067

# Submission time Handle Problem Language Result Execution time Memory
81067 2018-10-23T16:14:34 Z faustaadp The Big Prize (IOI17_prize) C++17
20 / 100
 106 ms 6616 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)continue;
        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=v[j].fi;
                break;
            }
        nx=L;
        while(L<R)
        {
            if(L+2==R)break;
            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++)
                 ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 6 ms 5060 KB Output is correct
3 Correct 6 ms 5136 KB Output is correct
4 Correct 6 ms 5220 KB Output is correct
5 Correct 6 ms 5220 KB Output is correct
6 Correct 7 ms 5244 KB Output is correct
7 Correct 6 ms 5372 KB Output is correct
8 Correct 6 ms 5372 KB Output is correct
9 Correct 6 ms 5372 KB Output is correct
10 Correct 6 ms 5372 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5372 KB Output is correct
2 Correct 6 ms 5372 KB Output is correct
3 Correct 6 ms 5372 KB Output is correct
4 Correct 6 ms 5372 KB Output is correct
5 Correct 7 ms 5372 KB Output is correct
6 Correct 6 ms 5436 KB Output is correct
7 Correct 6 ms 5436 KB Output is correct
8 Correct 7 ms 5436 KB Output is correct
9 Correct 7 ms 5436 KB Output is correct
10 Correct 6 ms 5436 KB Output is correct
11 Correct 8 ms 5436 KB Output is correct
12 Correct 7 ms 5436 KB Output is correct
13 Correct 11 ms 5692 KB Output is correct
14 Correct 7 ms 5692 KB Output is correct
15 Correct 15 ms 5692 KB Output is correct
16 Correct 73 ms 6332 KB Output is correct
17 Correct 6 ms 6332 KB Output is correct
18 Correct 92 ms 6616 KB Output is correct
19 Correct 7 ms 6616 KB Output is correct
20 Correct 18 ms 6616 KB Output is correct
21 Correct 30 ms 6616 KB Output is correct
22 Correct 13 ms 6616 KB Output is correct
23 Correct 6 ms 6616 KB Output is correct
24 Correct 7 ms 6616 KB Output is correct
25 Correct 40 ms 6616 KB Output is correct
26 Correct 31 ms 6616 KB Output is correct
27 Correct 6 ms 6616 KB Output is correct
28 Correct 72 ms 6616 KB Output is correct
29 Correct 62 ms 6616 KB Output is correct
30 Correct 99 ms 6616 KB Output is correct
31 Correct 6 ms 6616 KB Output is correct
32 Correct 9 ms 6616 KB Output is correct
33 Correct 6 ms 6616 KB Output is correct
34 Correct 21 ms 6616 KB Output is correct
35 Correct 6 ms 6616 KB Output is correct
36 Correct 20 ms 6616 KB Output is correct
37 Correct 7 ms 6616 KB Output is correct
38 Correct 6 ms 6616 KB Output is correct
39 Correct 26 ms 6616 KB Output is correct
40 Correct 74 ms 6616 KB Output is correct
41 Correct 42 ms 6616 KB Output is correct
42 Correct 44 ms 6616 KB Output is correct
43 Correct 32 ms 6616 KB Output is correct
44 Correct 23 ms 6616 KB Output is correct
45 Correct 21 ms 6616 KB Output is correct
46 Correct 6 ms 6616 KB Output is correct
47 Correct 25 ms 6616 KB Output is correct
48 Correct 56 ms 6616 KB Output is correct
49 Correct 8 ms 6616 KB Output is correct
50 Correct 85 ms 6616 KB Output is correct
51 Correct 23 ms 6616 KB Output is correct
52 Correct 6 ms 6616 KB Output is correct
53 Correct 7 ms 6616 KB Output is correct
54 Correct 23 ms 6616 KB Output is correct
55 Correct 6 ms 6616 KB Output is correct
56 Correct 105 ms 6616 KB Output is correct
57 Correct 55 ms 6616 KB Output is correct
58 Correct 50 ms 6616 KB Output is correct
59 Correct 40 ms 6616 KB Output is correct
60 Correct 38 ms 6616 KB Output is correct
61 Correct 6 ms 6616 KB Output is correct
62 Correct 6 ms 6616 KB Output is correct
63 Correct 7 ms 6616 KB Output is correct
64 Correct 6 ms 6616 KB Output is correct
65 Correct 6 ms 6616 KB Output is correct
66 Correct 9 ms 6616 KB Output is correct
67 Correct 6 ms 6616 KB Output is correct
68 Correct 9 ms 6616 KB Output is correct
69 Correct 10 ms 6616 KB Output is correct
70 Correct 6 ms 6616 KB Output is correct
71 Incorrect 106 ms 6616 KB answer is not correct
72 Halted 0 ms 0 KB -