oj.uz

Submission #36592

# Submission time Handle Problem Language Result Execution time Memory
36592 2017-12-11T15:59:18 Z ruhanhabib39 The Big Prize (IOI17_prize) C++14
20 / 100
 73 ms 6968 KB 
#include "prize.h"
#include <bits/stdc++.h>

// 123
const int MAXN = 2e5;

std::vector<int> res[MAXN + 10];

std::pair<int,int> get(int i) {
   if(!res[i].size()) res[i] = ask(i);
   return {res[i][0], res[i][1]};
}

int sum(int i) {
   return get(i).first + get(i).second;
}

int ls = 0;

int lowest(int n) {
   int mx = 0;
   for(int i = 0; i*i <= n; i++) {
      mx = std::max(mx, sum(i));
   }
   return mx;
}

int solve(int lo, int hi, int lc, int cc) {
   if(cc == 0) return -1;
   assert(lo <= hi && cc > 0);
   if(cc == hi-lo+1) {
      for(int i = lo; i <= hi; i++) {
         if(sum(i) == 0) return i;
      }
      return -1;
   }
   int ml = (lo + hi) / 2 + 1, mr = (lo + hi) / 2;
   int lf;
   for(int i = 0; i < hi-lo+1; i++) {
      int q;
      if(i % 2 == 0) q = --ml;
      else q = ++mr;
      if(sum(q) == ls) {
         if(i % 2 == 0) lf = get(q).first - lc;
         else lf = get(q).first - lc - (mr - ml);
         break;
      } else if(sum(q) == 0) {
         return q;
      }
   }
   
   int rr = solve(lo, ml-1, lc, lf);
   if(rr != -1) return rr;

   rr = solve(mr+1, hi, lc + (mr - ml) + lf, cc - lf - (mr - ml));
   if(rr != -1) return rr;

   return -1;
}

int find_best(int n) {
   ls = lowest(n); 
   return solve(0, n-1, 0, ls);
}

Compilation message

prize.cpp: In function 'int solve(int, int, int, int)':
prize.cpp:55:14: warning: 'lf' may be used uninitialized in this function [-Wmaybe-uninitialized]
    rr = solve(mr+1, hi, lc + (mr - ml) + lf, cc - lf - (mr - ml));
              ^

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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