oj.uz

Submission #981333

# Submission time Handle Problem Language Result Execution time Memory
981333 2024-05-13T04:40:13 Z SiliconSquared The Big Prize (IOI17_prize) C++14
20 / 100
 25 ms 1660 KB 
#include "prize.h"
using namespace std;
#include <vector>

int z,r,y;
bool e;
vector<int> g;

bool f(int a,int b){
    if (e){return false;}
    if (g[a]==g[b]){
        return false;
    }
    vector<int> p={-1,-1};
    if (a+1==b){
        p=ask(a);
        if (p==(vector<int>){0,0}){
            r=a;
            return true;
        }
        if (p[0]+p[1]>z){
            e=true;
            z=p[0]+p[1];
            return false;
        }
        return false;
    }
    int m=(a+b)/2;
    while ((p[0]+p[1])!=z){
        if (m==b){
            p[0]=g[b];
            g[m-1]=g[b]-1;
            m++;
            break;
        }
        p=ask(m);
        if (p[0]==0&&p[1]==0){
            r=m;
            return true;
        }
        if (p[0]+p[1]>z){
            e=true;
            z=p[0]+p[1];
            return false;
        }
        m++;
    }
    m--;
    if (m!=b){
        g[m]=p[0];
    }
    g[(a+b)/2]=p[0]-m+(a+b)/2;
    if (f(a,(a+b)/2)){
        return true;
    }
    if (f(m,b)){
        return true;
    }
    return false;
}

int find_best(int n) {
    g.resize(n+1);
    g[0]=0;
    z=ask(n-1)[0];
    if (z==0){
        return n-1;
    }
    g[n-1]=z;
    y=n-1;
    e=false;
    f(0,n-1);
    vector<int> p;
    while (e){
        y--;
        p=ask(y);
        if (p[0]+p[1]==0){
            return y;
        }
        if (p[0]+p[1]>z){
            z=p[0]+p[1];
        }
        if (p[0]+p[1]==z){
            e=false;
            f(0,y);
        }
    }
    return r;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1480 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1228 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1196 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1228 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 5 ms 1368 KB Output is correct
16 Correct 25 ms 1112 KB Output is correct
17 Correct 1 ms 1112 KB Output is correct
18 Correct 20 ms 1112 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 4 ms 600 KB Output is correct
21 Correct 8 ms 1268 KB Output is correct
22 Correct 2 ms 1112 KB Output is correct
23 Correct 1 ms 1112 KB Output is correct
24 Correct 1 ms 1196 KB Output is correct
25 Correct 9 ms 1112 KB Output is correct
26 Correct 11 ms 1112 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 17 ms 1112 KB Output is correct
29 Correct 10 ms 1368 KB Output is correct
30 Correct 24 ms 1232 KB Output is correct
31 Correct 1 ms 1112 KB Output is correct
32 Correct 2 ms 1112 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 5 ms 1408 KB Output is correct
35 Correct 1 ms 1112 KB Output is correct
36 Correct 4 ms 1112 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 1 ms 1112 KB Output is correct
39 Correct 7 ms 1112 KB Output is correct
40 Correct 16 ms 1112 KB Output is correct
41 Correct 11 ms 1228 KB Output is correct
42 Correct 16 ms 1112 KB Output is correct
43 Correct 10 ms 1412 KB Output is correct
44 Correct 7 ms 1112 KB Output is correct
45 Correct 5 ms 1236 KB Output is correct
46 Correct 1 ms 1112 KB Output is correct
47 Correct 11 ms 1232 KB Output is correct
48 Correct 14 ms 1236 KB Output is correct
49 Correct 2 ms 1112 KB Output is correct
50 Correct 24 ms 1112 KB Output is correct
51 Correct 9 ms 1232 KB Output is correct
52 Correct 1 ms 1228 KB Output is correct
53 Correct 1 ms 1112 KB Output is correct
54 Correct 8 ms 1112 KB Output is correct
55 Correct 1 ms 1232 KB Output is correct
56 Correct 18 ms 1232 KB Output is correct
57 Correct 17 ms 1112 KB Output is correct
58 Correct 13 ms 1112 KB Output is correct
59 Correct 18 ms 1112 KB Output is correct
60 Correct 9 ms 1232 KB Output is correct
61 Correct 1 ms 1660 KB Output is correct
62 Correct 1 ms 1112 KB Output is correct
63 Correct 1 ms 1112 KB Output is correct
64 Correct 1 ms 1112 KB Output is correct
65 Correct 1 ms 1112 KB Output is correct
66 Correct 1 ms 1112 KB Output is correct
67 Correct 2 ms 1112 KB Output is correct
68 Correct 1 ms 1112 KB Output is correct
69 Correct 1 ms 1368 KB Output is correct
70 Correct 2 ms 1112 KB Output is correct
71 Correct 25 ms 1112 KB Output is correct
72 Correct 3 ms 1112 KB Output is correct
73 Correct 24 ms 1112 KB Output is correct
74 Correct 18 ms 1388 KB Output is correct
75 Correct 1 ms 1112 KB Output is correct
76 Correct 22 ms 1232 KB Output is correct
77 Correct 19 ms 1232 KB Output is correct
78 Correct 2 ms 1112 KB Output is correct
79 Correct 10 ms 1112 KB Output is correct
80 Correct 21 ms 1112 KB Output is correct
81 Correct 22 ms 1364 KB Output is correct
82 Correct 20 ms 1232 KB Output is correct
83 Correct 1 ms 1112 KB Output is correct
84 Correct 21 ms 1112 KB Output is correct
85 Correct 20 ms 1112 KB Output is correct
86 Incorrect 2 ms 1112 KB answer is not correct
87 Halted 0 ms 0 KB -