oj.uz

Submission #768980

# Submission time Handle Problem Language Result Execution time Memory
768980 2023-06-29T03:57:06 Z boyliguanhan The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 3000 ms 262144 KB 
#include<bits/stdc++.h>
#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];
}
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];
    }
    for(int i = 1; i <= U/1000*1000; 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/1000+1)*1000] = x, adj[b][(i/1000+1)*1000] = 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/1000*1000;
    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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5240 KB Output is correct
2 Correct 5 ms 5288 KB Output is correct
3 Correct 4 ms 5200 KB Output is correct
4 Correct 19 ms 15412 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 111232 KB Output is correct
2 Correct 490 ms 111288 KB Output is correct
3 Correct 353 ms 29128 KB Output is correct
4 Runtime error 726 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 111416 KB Output is correct
2 Execution timed out 3082 ms 56968 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 9552 KB Output is correct
2 Correct 180 ms 6712 KB Output is correct
3 Correct 1264 ms 6420 KB Output is correct
4 Correct 1324 ms 8996 KB Output is correct
5 Correct 1319 ms 9692 KB Output is correct
6 Correct 198 ms 10520 KB Output is correct
7 Correct 1921 ms 7392 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 4 ms 5240 KB Output is correct
3 Correct 5 ms 5288 KB Output is correct
4 Correct 4 ms 5200 KB Output is correct
5 Correct 19 ms 15412 KB Output is correct
6 Correct 469 ms 111232 KB Output is correct
7 Correct 490 ms 111288 KB Output is correct
8 Correct 353 ms 29128 KB Output is correct
9 Runtime error 726 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -