oj.uz

Submission #710881

# Submission time Handle Problem Language Result Execution time Memory
710881 2023-03-16T03:46:37 Z tanprodium The Big Prize (IOI17_prize) C++14
20 / 100
 1 ms 308 KB 
#include "prize.h"
#include<bits/stdc++.h>
 
using namespace std;
 
const int N = 2e5;
 
int a[N + 5];
//int n;
 
/*vector<int> ask(int id) {
    vector<int> ans(2, 0);
 
    for (int i = 0; i < id; i++)
        if (a[i] < a[id]) ++ans[0];
 
    for (int i = id + 1; i < n; i++)
        if (a[i] < a[id]) ++ans[1];
 
    return (ans);
}*/
 
int find_best(int n) {
    int l = 0, r = n - 1;
 
    while (l <= r) {
        int mid = (l + r) >> 1;
 
        vector<int> take = ask(mid);
 
        if (take[0])
            r = mid - 1;
        else l = mid + 1;
    }
 
    return (l - 1);
}
 
/*void solve() {
    int n;
    cin >> n;
 
    for (int i = 0; i < n; i++)
        cin >> a[i];
 
    find_best(n);
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}*/

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 284 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Incorrect 1 ms 208 KB answer is not correct
12 Halted 0 ms 0 KB -