oj.uz

Submission #781921

# Submission time Handle Problem Language Result Execution time Memory
781921 2023-07-13T13:26:31 Z TheSahib The Big Prize (IOI17_prize) C++14
20 / 100
 1000 ms 6140 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 2e5 + 5;

int tree[MAX];

void update(int pos, int val){
    while(pos < MAX){
        tree[pos] += val;
        pos += pos & -pos;
    }
}

int ask(int l, int r){
    if(l != 1) return ask(1, r) - ask(1, l - 1);
    int ans = 0;
    while(r > 0){
        ans += tree[r];
        r -= r & -r;
    }
    return ans;
}

int intRand(){
    return (rand() << 15) + rand();
}

vector<int> mp[MAX];

vector<int> query(int i){
    if(!mp[i].empty()) return mp[i];
    return mp[i] = ask(i - 1);
}


int find_best(int n) {
    srand(time(0));
    vector<int> order(n);
    iota(order.begin(), order.end(), 1);
    random_shuffle(order.begin(), order.end());
    if(n <= 5000){
        for (int i:order)
        {
            vector<int> a = query(i);
            if(a[0] + a[1] == 0){
                return i - 1;
            }
        }
    }
    vector<int> a;
    int cnt = 0;
    for (int i = 1; i <= 1000; i++)
    {
        a = query(i);
        if(a[0] + a[1] == 0) return i - 1;
        if(a[0] + a[1] < cnt){
            update(i, 1);
        }
        cnt = max(cnt, a[0] + a[1]);
    }
    
    
    while(true){
        int l = 1, r = n;
        while(l <= r){
            int mid = (l + r) / 2;
            a = query(mid);

            if(a[0] + a[1] == 0){
                return mid - 1;
            }

            a[0] -= ask(1, mid - 1);
            a[1] -= ask(mid + 1, n);

            if(a[0] + a[1] < cnt){
                update(mid, 1);
                cnt--;
                break;
            }

            if(a[1] > 0){
                l = mid + 1;
            }
            else{
                r = mid - 1;
            }
        }
    }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5712 KB Output is correct
2 Correct 14 ms 5800 KB Output is correct
3 Correct 11 ms 5812 KB Output is correct
4 Correct 9 ms 5816 KB Output is correct
5 Correct 13 ms 5812 KB Output is correct
6 Correct 5 ms 5840 KB Output is correct
7 Correct 14 ms 5800 KB Output is correct
8 Correct 9 ms 5820 KB Output is correct
9 Correct 12 ms 5800 KB Output is correct
10 Correct 14 ms 5824 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5812 KB Output is correct
2 Correct 13 ms 5808 KB Output is correct
3 Correct 13 ms 5712 KB Output is correct
4 Correct 13 ms 5712 KB Output is correct
5 Correct 14 ms 5712 KB Output is correct
6 Correct 5 ms 5764 KB Output is correct
7 Correct 12 ms 5712 KB Output is correct
8 Correct 10 ms 5780 KB Output is correct
9 Correct 9 ms 5820 KB Output is correct
10 Correct 13 ms 5836 KB Output is correct
11 Correct 16 ms 5928 KB Output is correct
12 Correct 15 ms 6140 KB Output is correct
13 Correct 13 ms 5808 KB Output is correct
14 Execution timed out 3017 ms 5200 KB Time limit exceeded
15 Halted 0 ms 0 KB -