oj.uz

Submission #1075791

# Submission time Handle Problem Language Result Execution time Memory
1075791 2024-08-26T09:12:12 Z mdn2002 The Big Prize (IOI17_prize) C++14
0 / 100
 65 ms 344 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;

int find_best(int n) {
	int mx = 0, lim = 500;
	for (int i = 0; i < min(n, lim); i ++) {
        vector<int> a = ask(i);
        mx = max(mx, a[0] + a[1]);
        if (a[0] + a[1] == 0) return i;
	}

	for (int i = 0; i < n; i ++) {
        vector<int> a = ask(i);
        int logg = log2(a[1] + 1) + 2;
        if (a[0] + a[1] == mx) {
            for (int j = (1 << logg); j >= 1; j /= 2) {
                if (i + j >= n) continue;
                vector<int> b = ask(i + j);
                if (a[1] == b[1]) i += j;
            }
        }
        else if (a[0] + a[1] == 0) return i;
	}
}

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 Correct 65 ms 344 KB Output is correct
2 Incorrect 48 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 41 ms 344 KB Partially correct - number of queries: 9921
2 Incorrect 61 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -