oj.uz

Submission #1017375

# Submission time Handle Problem Language Result Execution time Memory
1017375 2024-07-09T07:39:07 Z overwatch9 The Big Prize (IOI17_prize) C++17
20 / 100
 74 ms 1188 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
// int N;
// vector <int> nums;
// vector <int> ask(int i) {
//     vector <int> ans(2, 0);
//     for (int j = 0; j < i; j++) {
//         if (nums[j] > nums[i])
//             ans[0]++;
//     }
//     for (int j = i+1; j < N; j++) {
//         if (nums[j] > nums[i])
//             ans[1]++;
//     }
//     return ans;
// }

int rng(int i) {
    return rand() % i;
}
int find_best(int n) {
    srand(time(0));
	vector <int> guesses(n);
    for (int i = 0; i < n; i++)
        guesses[i] = i;
    random_shuffle(guesses.begin(), guesses.end(), rng);
    int cnt = 0;
    int lo = 0, hi = n-1;
    for (int i = 0; i < n && cnt < 10000; i++) {
        if (guesses[i] < lo || guesses[i] > hi)
            continue;
        cnt++;
        auto res = ask(guesses[i]);
        if (res[0] + res[1] == 0)
            return guesses[i];
        if (res[0] + res[1] == 1) {
            if (res[0] == 1)
                hi = guesses[i] - 1;
            else
                lo = guesses[i] + 1;
            if (lo == hi)
                return lo;
        }
        if (cnt == 10000)
            return guesses[i+1];
    }
    return 0;
}

// int main() {
//     cin >> N;
//     nums.resize(N+1);
//     for (int i = 0; i < N; i++)
//         cin >> nums[i];
//     find_best(N);
// }

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 3 ms 1112 KB Output is correct
3 Correct 3 ms 1112 KB Output is correct
4 Correct 4 ms 1112 KB Output is correct
5 Correct 3 ms 1112 KB Output is correct
6 Correct 3 ms 1188 KB Output is correct
7 Correct 3 ms 1112 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1112 KB Output is correct
10 Correct 4 ms 1112 KB Output is correct
11 Incorrect 74 ms 1112 KB answer is not correct
12 Halted 0 ms 0 KB -