oj.uz

답안 #781923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781923 2023-07-13T13:36:03 Z TheSahib 커다란 상품 (IOI17_prize) C++14
20 / 100
 1000 ms 6532 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(r < l) return 0;
    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 j = 0; j < min(1000, (int)order.size()); ++j)
    {
        int i = order[j];
        a = query(i);
        if(a[0] + a[1] == 0) return i - 1;
        if(a[0] + a[1] < cnt){
            update(i, 1);
        }
        else{
            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;
            }
            if(a[0] + a[1] < cnt && !ask(mid, mid)){
                update(mid, 1);
                break;
            }

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


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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 5712 KB Output is correct
2 Correct 9 ms 5812 KB Output is correct
3 Correct 17 ms 5808 KB Output is correct
4 Correct 13 ms 5800 KB Output is correct
5 Correct 13 ms 5796 KB Output is correct
6 Correct 12 ms 5820 KB Output is correct
7 Correct 9 ms 5764 KB Output is correct
8 Correct 17 ms 5812 KB Output is correct
9 Correct 12 ms 5712 KB Output is correct
10 Correct 11 ms 5828 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 5804 KB Output is correct
2 Correct 13 ms 5712 KB Output is correct
3 Correct 15 ms 5812 KB Output is correct
4 Correct 13 ms 5764 KB Output is correct
5 Correct 9 ms 5820 KB Output is correct
6 Correct 10 ms 5760 KB Output is correct
7 Correct 10 ms 5804 KB Output is correct
8 Correct 9 ms 5816 KB Output is correct
9 Correct 9 ms 5764 KB Output is correct
10 Correct 10 ms 5712 KB Output is correct
11 Correct 20 ms 5960 KB Output is correct
12 Correct 18 ms 6188 KB Output is correct
13 Correct 13 ms 5792 KB Output is correct
14 Correct 9 ms 5084 KB Output is correct
15 Correct 44 ms 6472 KB Output is correct
16 Correct 13 ms 5960 KB Output is correct
17 Execution timed out 3096 ms 6532 KB Time limit exceeded
18 Halted 0 ms 0 KB -