oj.uz

Submission #36590

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

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) return -1;
   if(lo == hi) {
      if(sum(lo) == 0) return lo;
      else 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:51: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 9 ms 6704 KB Output is correct
2 Correct 3 ms 6704 KB Output is correct
3 Correct 3 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 0 ms 6704 KB Output is correct
10 Correct 0 ms 6704 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 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 6 ms 6704 KB Output is correct
5 Correct 0 ms 6704 KB Output is correct
6 Correct 6 ms 6704 KB Output is correct
7 Correct 0 ms 6704 KB Output is correct
8 Correct 0 ms 6704 KB Output is correct
9 Correct 0 ms 6704 KB Output is correct
10 Correct 0 ms 6704 KB Output is correct
11 Correct 0 ms 6704 KB Output is correct
12 Correct 3 ms 6704 KB Output is correct
13 Correct 3 ms 6704 KB Output is correct
14 Correct 0 ms 6704 KB Output is correct
15 Correct 6 ms 6704 KB Output is correct
16 Correct 23 ms 6836 KB Output is correct
17 Correct 0 ms 6704 KB Output is correct
18 Correct 19 ms 6836 KB Output is correct
19 Correct 6 ms 6704 KB Output is correct
20 Correct 9 ms 6704 KB Output is correct
21 Correct 6 ms 6836 KB Output is correct
22 Correct 6 ms 6704 KB Output is correct
23 Correct 3 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 Execution timed out 1000 ms 6704 KB Execution timed out
27 Halted 0 ms 0 KB -