oj.uz

Submission #986128

# Submission time Handle Problem Language Result Execution time Memory
986128 2024-05-19T19:13:16 Z AlphaMale06 The Big Prize (IOI17_prize) C++14
20 / 100
 55 ms 11608 KB 
#include <bits/stdc++.h>

#include "prize.h"

using namespace std;
using ll = long long;

vector<int> ask(int i);

vector<int> a[200006];
int summ = 0;

int indices[30] = {1001, 1112, 1232, 1341, 1423, 1540, 1612, 1740, 1812, 1931, 2035, 2113, 2242, 2334, 2456, 2554, 2656, 2954, 3067, 3187, 3256, 3376, 3434, 3565, 3634, 3787, 3865, 3923};

int solve(int l, int r){
    if(l+1>=r)return 0;
    int cnt = a[l][1]-a[r][1];
    if(cnt==0)return 0;
    int s = l+r>>1;
    if(a[s][0]==-1)a[s]=ask(s);
    if(a[s][0]+a[s][1]==summ)return max(solve(l, s), solve(s, r));
    if(a[s][0]+a[s][1]==0)return s;
    int R = s-1, L = s+1;
    for(int i=s-1; i>=l; i--){
        if(a[i][0]==-1)a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            R=i;
            break;
        }
    }
    for(int i=s+1; i<=r; i++){
        if(a[i][0]==-1)a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            L=i;
            break;
        }
    }
    return max(solve(l, R), solve(L, r));
}

int find_best(int n){
	if(n<=5000){
        for(int i=0; i<n; i++){
            vector<int> ans = ask(i);
            if(ans[0]==0 && ans[1]==0)return i;
        }
	}
	for(int i=0; i< n; i++){
        a[i].push_back(-1);
	}
	int L = -1, R = -1;
	for(int i=0; i<30; i++){
        int ind = indices[i];
        a[ind] = ask(ind);
        summ=max(summ, a[ind][0]+a[ind][1]);
        if(a[ind][0]+a[ind][1]==0)return ind;
	}
    for(int i=0; i<n; i++){
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            L=i;
            break;
        }
    }
    for(int i=n-1; i>=0; i--){
        a[i]=ask(i);
        if(a[i][0]+a[i][1]==0)return i;
        if(a[i][0]+a[i][1]==summ){
            R=i;
            break;
        }
    }
    return solve(L, R);
}

Compilation message

prize.cpp: In function 'int solve(int, int)':
prize.cpp:19:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |     int s = l+r>>1;
      |             ~^~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11352 KB Output is correct
2 Correct 9 ms 11352 KB Output is correct
3 Correct 9 ms 11352 KB Output is correct
4 Correct 9 ms 11352 KB Output is correct
5 Correct 9 ms 11352 KB Output is correct
6 Correct 9 ms 11352 KB Output is correct
7 Correct 8 ms 11352 KB Output is correct
8 Correct 9 ms 11352 KB Output is correct
9 Correct 10 ms 11260 KB Output is correct
10 Correct 9 ms 11352 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11348 KB Output is correct
2 Correct 9 ms 11352 KB Output is correct
3 Correct 8 ms 11352 KB Output is correct
4 Correct 9 ms 11352 KB Output is correct
5 Correct 9 ms 11272 KB Output is correct
6 Correct 8 ms 11348 KB Output is correct
7 Correct 9 ms 11352 KB Output is correct
8 Correct 9 ms 11352 KB Output is correct
9 Correct 8 ms 11352 KB Output is correct
10 Correct 10 ms 11184 KB Output is correct
11 Correct 13 ms 11352 KB Output is correct
12 Correct 12 ms 11352 KB Output is correct
13 Correct 12 ms 11352 KB Output is correct
14 Correct 8 ms 5720 KB Output is correct
15 Correct 29 ms 11348 KB Output is correct
16 Correct 29 ms 11352 KB Output is correct
17 Correct 32 ms 11352 KB Output is correct
18 Correct 29 ms 11352 KB Output is correct
19 Correct 29 ms 11352 KB Output is correct
20 Correct 19 ms 8024 KB Output is correct
21 Correct 31 ms 11352 KB Output is correct
22 Correct 23 ms 11352 KB Output is correct
23 Correct 9 ms 11352 KB Output is correct
24 Correct 12 ms 11352 KB Output is correct
25 Correct 31 ms 11352 KB Output is correct
26 Correct 28 ms 11352 KB Output is correct
27 Correct 9 ms 11352 KB Output is correct
28 Correct 30 ms 11352 KB Output is correct
29 Correct 24 ms 11352 KB Output is correct
30 Correct 31 ms 11352 KB Output is correct
31 Correct 36 ms 11352 KB Output is correct
32 Correct 11 ms 11352 KB Output is correct
33 Correct 1 ms 4952 KB Output is correct
34 Correct 30 ms 11352 KB Output is correct
35 Correct 10 ms 11292 KB Output is correct
36 Correct 33 ms 11352 KB Output is correct
37 Correct 10 ms 11352 KB Output is correct
38 Correct 9 ms 11352 KB Output is correct
39 Correct 36 ms 11352 KB Output is correct
40 Correct 26 ms 11352 KB Output is correct
41 Correct 28 ms 11352 KB Output is correct
42 Correct 31 ms 11352 KB Output is correct
43 Correct 28 ms 11352 KB Output is correct
44 Correct 29 ms 11352 KB Output is correct
45 Correct 32 ms 11352 KB Output is correct
46 Correct 29 ms 11352 KB Output is correct
47 Correct 28 ms 11352 KB Output is correct
48 Correct 39 ms 11352 KB Output is correct
49 Correct 32 ms 11352 KB Output is correct
50 Correct 30 ms 11352 KB Output is correct
51 Correct 28 ms 11352 KB Output is correct
52 Correct 32 ms 11352 KB Output is correct
53 Correct 9 ms 11352 KB Output is correct
54 Correct 36 ms 11352 KB Output is correct
55 Correct 33 ms 11352 KB Output is correct
56 Correct 34 ms 11332 KB Output is correct
57 Correct 27 ms 11352 KB Output is correct
58 Correct 28 ms 11352 KB Output is correct
59 Correct 31 ms 11352 KB Output is correct
60 Correct 26 ms 11352 KB Output is correct
61 Correct 12 ms 11256 KB Output is correct
62 Correct 9 ms 11352 KB Output is correct
63 Correct 9 ms 11352 KB Output is correct
64 Correct 9 ms 11352 KB Output is correct
65 Correct 9 ms 11604 KB Output is correct
66 Correct 9 ms 11352 KB Output is correct
67 Correct 10 ms 11348 KB Output is correct
68 Correct 10 ms 11352 KB Output is correct
69 Correct 9 ms 11352 KB Output is correct
70 Correct 10 ms 11608 KB Output is correct
71 Correct 34 ms 11352 KB Output is correct
72 Correct 10 ms 11352 KB Output is correct
73 Correct 27 ms 11352 KB Output is correct
74 Correct 29 ms 11352 KB Output is correct
75 Correct 9 ms 11352 KB Output is correct
76 Correct 35 ms 11352 KB Output is correct
77 Correct 29 ms 11352 KB Output is correct
78 Correct 12 ms 11352 KB Output is correct
79 Correct 19 ms 11352 KB Output is correct
80 Correct 31 ms 11352 KB Output is correct
81 Correct 35 ms 11352 KB Output is correct
82 Correct 27 ms 11352 KB Output is correct
83 Correct 10 ms 11352 KB Output is correct
84 Correct 25 ms 11352 KB Output is correct
85 Correct 28 ms 11352 KB Output is correct
86 Incorrect 55 ms 11352 KB Incorrect
87 Halted 0 ms 0 KB -