oj.uz

Submission #73987

# Submission time Handle Problem Language Result Execution time Memory
73987 2018-08-29T13:44:41 Z renatsj The Big Prize (IOI17_prize) C++14
90 / 100
 120 ms 572 KB 
#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
int i,j,n,m,l,r,c,xl,xr,maz,rez,h[5][2];
vector<int> xx;
int find_best(int n)
{
    h[0][0]=-1;
    h[1][0]=-1;
    h[2][0]=-1;
    h[3][0]=-1;
    h[4][0]=-1;
    l=0;
    r=n-1;
    rez=0;
    maz=0;
    while (true)
    {
        //cout << l << " " << r << "\n";
        while (l<r)
        {
            c=l+(r-l)/2;
            xx=ask(c);
            xl=xx[0];
            xr=xx[1];
            //cout << l << " " << c << " " << r << " " << maz << " " << xl << " " << xr << "\n" << h[0][0] << " " << h[1][0] << " " << h[2][0] << " " << h[3][0] << " " << h[4][0] << "\n" << h[0][1] << " " << h[1][1] << " " << h[2][1] << " " << h[3][1] << " " << h[4][1] << "\n";
            if (xl+xr==0)
            {
                return c;
            }
            if (xl+xr>maz)
            {
                l=0;
                r=n-1;
                rez=0;
                maz=xl+xr;
                h[0][1]=0;
                h[1][1]=0;
                h[2][1]=0;
                h[3][1]=0;
                h[4][1]=0;
            }
            else if (xl+xr<maz)
            {
                r=c;
            }
            else if (xl>rez)
            //else if ((h[0][0]==xl+xr&&xl>h[0][1])||(h[1][0]==xl+xr&&xl>h[1][1])||(h[2][0]==xl+xr&&xl>h[2][1])||(h[3][0]==xl+xr&&xl>h[3][1])||(h[4][0]==xl+xr&&xl>h[4][1]))
            {
                r=c-1;
            }
            else
            {
                l=c+1;
            }
        }
        if (l<=n-1)
        {
            xx=ask(l);
            xl=xx[0];
            xr=xx[1];
        }
        if (xl+xr==0)
        {
            return l;
        }
        rez++;
        l++;
        //cout << l << " " << r << "\n";
        if (l<=n-1)
        {
            xx=(ask(l));
            xl=xx[0];
            xr=xx[1];
            if (xl+xr==0)
            {
                return l;
            }
        }
        while (xl+xr<maz&&l<n-1)
        {
            l++;
            rez++;
            //cout << l << " " << r << "\n";
            xx=(ask(l));
            xl=xx[0];
            xr=xx[1];
            if (xl+xr==0)
            {
                return l;
            }
        }
        if (xl+xr>maz)
        {
            maz=xl+xr;
            l=0;
            r=n-1;
            rez=0;
            h[0][1]=0;
            h[1][1]=0;
            h[2][1]=0;
            h[3][1]=0;
            h[4][1]=0;
        }
        r=n-1;
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 308 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 3 ms 540 KB Output is correct
7 Correct 3 ms 540 KB Output is correct
8 Correct 3 ms 540 KB Output is correct
9 Correct 3 ms 540 KB Output is correct
10 Correct 2 ms 540 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 540 KB Output is correct
2 Correct 4 ms 540 KB Output is correct
3 Correct 3 ms 540 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 3 ms 540 KB Output is correct
6 Correct 3 ms 572 KB Output is correct
7 Correct 3 ms 572 KB Output is correct
8 Correct 4 ms 572 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 7 ms 572 KB Output is correct
12 Correct 3 ms 572 KB Output is correct
13 Correct 12 ms 572 KB Output is correct
14 Correct 5 ms 572 KB Output is correct
15 Correct 16 ms 572 KB Output is correct
16 Partially correct 80 ms 572 KB Partially correct - number of queries: 7088
17 Correct 2 ms 572 KB Output is correct
18 Partially correct 73 ms 572 KB Partially correct - number of queries: 8320
19 Correct 2 ms 572 KB Output is correct
20 Correct 25 ms 572 KB Output is correct
21 Correct 49 ms 572 KB Output is correct
22 Correct 5 ms 572 KB Output is correct
23 Correct 3 ms 572 KB Output is correct
24 Correct 3 ms 572 KB Output is correct
25 Correct 76 ms 572 KB Output is correct
26 Correct 63 ms 572 KB Output is correct
27 Correct 2 ms 572 KB Output is correct
28 Partially correct 91 ms 572 KB Partially correct - number of queries: 7898
29 Partially correct 57 ms 572 KB Partially correct - number of queries: 6003
30 Partially correct 54 ms 572 KB Partially correct - number of queries: 8247
31 Correct 2 ms 572 KB Output is correct
32 Correct 8 ms 572 KB Output is correct
33 Correct 2 ms 572 KB Output is correct
34 Correct 45 ms 572 KB Output is correct
35 Correct 4 ms 572 KB Output is correct
36 Correct 28 ms 572 KB Output is correct
37 Correct 3 ms 572 KB Output is correct
38 Correct 3 ms 572 KB Output is correct
39 Correct 40 ms 572 KB Output is correct
40 Partially correct 98 ms 572 KB Partially correct - number of queries: 7044
41 Correct 28 ms 572 KB Output is correct
42 Correct 77 ms 572 KB Output is correct
43 Correct 65 ms 572 KB Output is correct
44 Correct 49 ms 572 KB Output is correct
45 Correct 28 ms 572 KB Output is correct
46 Correct 3 ms 572 KB Output is correct
47 Correct 45 ms 572 KB Output is correct
48 Partially correct 25 ms 572 KB Partially correct - number of queries: 6159
49 Correct 5 ms 572 KB Output is correct
50 Partially correct 88 ms 572 KB Partially correct - number of queries: 8317
51 Correct 30 ms 572 KB Output is correct
52 Correct 3 ms 572 KB Output is correct
53 Correct 5 ms 572 KB Output is correct
54 Correct 45 ms 572 KB Output is correct
55 Correct 5 ms 572 KB Output is correct
56 Partially correct 120 ms 572 KB Partially correct - number of queries: 8315
57 Partially correct 45 ms 572 KB Partially correct - number of queries: 6067
58 Partially correct 77 ms 572 KB Partially correct - number of queries: 6185
59 Correct 47 ms 572 KB Output is correct
60 Correct 89 ms 572 KB Output is correct
61 Correct 7 ms 572 KB Output is correct
62 Correct 3 ms 572 KB Output is correct
63 Correct 5 ms 572 KB Output is correct
64 Correct 11 ms 572 KB Output is correct
65 Correct 6 ms 572 KB Output is correct
66 Correct 9 ms 572 KB Output is correct
67 Correct 4 ms 572 KB Output is correct
68 Correct 10 ms 572 KB Output is correct
69 Correct 8 ms 572 KB Output is correct
70 Correct 3 ms 572 KB Output is correct
71 Partially correct 61 ms 572 KB Partially correct - number of queries: 8264
72 Correct 8 ms 572 KB Output is correct
73 Partially correct 81 ms 572 KB Partially correct - number of queries: 8166
74 Partially correct 101 ms 572 KB Partially correct - number of queries: 8210
75 Correct 5 ms 572 KB Output is correct
76 Partially correct 78 ms 572 KB Partially correct - number of queries: 7047
77 Partially correct 62 ms 572 KB Partially correct - number of queries: 8334
78 Correct 4 ms 572 KB Output is correct
79 Correct 30 ms 572 KB Output is correct
80 Partially correct 64 ms 572 KB Partially correct - number of queries: 8353
81 Partially correct 98 ms 572 KB Partially correct - number of queries: 8340
82 Partially correct 57 ms 572 KB Partially correct - number of queries: 8275
83 Correct 3 ms 572 KB Output is correct
84 Partially correct 30 ms 572 KB Partially correct - number of queries: 6803
85 Partially correct 41 ms 572 KB Partially correct - number of queries: 8337
86 Partially correct 83 ms 572 KB Partially correct - number of queries: 8552
87 Correct 7 ms 572 KB Output is correct
88 Partially correct 63 ms 572 KB Partially correct - number of queries: 8040
89 Partially correct 92 ms 572 KB Partially correct - number of queries: 8481
90 Correct 3 ms 572 KB Output is correct
91 Correct 50 ms 572 KB Output is correct
92 Partially correct 95 ms 572 KB Partially correct - number of queries: 7888
93 Correct 6 ms 572 KB Output is correct
94 Correct 10 ms 572 KB Output is correct
95 Correct 5 ms 572 KB Output is correct
96 Correct 7 ms 572 KB Output is correct
97 Correct 3 ms 572 KB Output is correct