oj.uz

답안 #768991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768991 2023-06-29T04:21:41 Z vjudge1 The Potion of Great Power (CEOI20_potion) C++17
17 / 100
 3000 ms 46340 KB 
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define NN 100100
using namespace std;
int h[NN], n;
map<int, set<int>> adj[NN];
int upd[2*NN][2];
void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < N; i++)
        h[i] = H[i];
}
int limit;
void curseChanges(int U, int A[], int B[]) {
    for(int i = 0; i < n; i++) adj[i][0];
    for(int i = 1; i <= U; i++) {
        upd[i][0] = A[i-1], upd[i][1] = B[i-1];
    }
    limit = U;
    for(int i = 1; i <= U/limit*limit; i++) {
        int a= upd[i][0], b = upd[i][1];
        set<int> x = (--adj[a].end())->second, y = (--adj[b].end())->second;
        if(x.count(b)) x.erase(b), y.erase(a);
        else x.insert(b), y.insert(a);
        adj[a][(i/limit+1)*limit] = x, adj[b][(i/limit+1)*limit] = y;
    }
}
int calc(vector<int> a, vector<int> b){
    int ans = 1e9;
    for(int i = 0, j = 0; i < (int)a.size()&&j < (int)b.size();i++) {
        if(a[i]>b[j]) swap(a, b), swap(i, j);
        if(j) ans=min(ans,(int)abs(a[i]-b[j-1]));
        ans = min(ans, abs(a[i] - b[j]));
    }
    return ans;
}
int question(int x, int y, int v) {
    set<int> a = (--adj[x].upper_bound(v))->second, b = (--adj[y].upper_bound(v))->second;
    int t = v/limit*limit;
    t = max(t, 1);
    while(t <= v) {
        int c = upd[t][0], d = upd[t][1];
        if(d==x) swap(c, d);
        if(c==x) {
            if(a.count(d)) a.erase(d);
            else a.insert(d);
        }
        if(d==y) swap(c, d);
        if(c==y) {
            if(b.count(d)) b.erase(d);
            else b.insert(d);
        }
        t++;
    }
    vector<int> c, d;
    for(auto i: a) c.push_back(h[i]);
    for(auto i: b) d.push_back(h[i]);
    sort(c.begin(), c.end());
    sort(d.begin(), d.end());
    return calc(c,d);
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5328 KB Output is correct
2 Correct 4 ms 5328 KB Output is correct
3 Correct 4 ms 5200 KB Output is correct
4 Correct 24 ms 15400 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 46272 KB Output is correct
2 Correct 359 ms 46308 KB Output is correct
3 Correct 290 ms 18388 KB Output is correct
4 Execution timed out 3091 ms 17752 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3075 ms 46340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 460 ms 7960 KB Output is correct
2 Correct 654 ms 6224 KB Output is correct
3 Correct 2816 ms 6272 KB Output is correct
4 Execution timed out 3078 ms 7244 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 4 ms 5328 KB Output is correct
3 Correct 4 ms 5328 KB Output is correct
4 Correct 4 ms 5200 KB Output is correct
5 Correct 24 ms 15400 KB Output is correct
6 Correct 356 ms 46272 KB Output is correct
7 Correct 359 ms 46308 KB Output is correct
8 Correct 290 ms 18388 KB Output is correct
9 Execution timed out 3091 ms 17752 KB Time limit exceeded
10 Halted 0 ms 0 KB -