oj.uz

Submission #1060897

# Submission time Handle Problem Language Result Execution time Memory
1060897 2024-08-16T04:13:40 Z onbert The Big Prize (IOI17_prize) C++17
0 / 100
 1000 ms 11352 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
vector<int> vals[maxn];
vector<int> qry(int i) {
    if (vals[i][0]!=-1) return vals[i];
    else return vals[i] = ask(i);
}
int find_best(int n) {
    for (int i=0;i<n;i++) vals[i] = {-1, -1};
    for (int i=0;i<n;i++) {
        vector<int> x = qry(i);
        if (x[0] + x[1] == 0) return i;
        int l = i, r = n-1;
        while (l<r) {
            int mid = (l+r)/2;
            vector<int> y = qry(mid);
            if (y[0]+y[1]==0) return mid;
            if (y[0]!=x[0] || y[1]!=x[1]) r = mid-1;
            else l = mid;
        }
        i = l;
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 11220 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3012 ms 11352 KB Time limit exceeded
2 Halted 0 ms 0 KB -