oj.uz

Submission #963615

# Submission time Handle Problem Language Result Execution time Memory
963615 2024-04-15T11:44:32 Z Ghetto The Potion of Great Power (CEOI20_potion) C++17
56 / 100
 3000 ms 46888 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int MAX_N = 1e5 + 5, K = 50, MAX_T = 2e5 + 5;
 
int n;
int h[MAX_N]; // Not id
int t;
int e1[MAX_T], e2[MAX_T]; // Not id
 
int id[MAX_N], rev_id[MAX_N]; 
vector<pii> upds[MAX_N]; // {time, node} and {0, -1}
set<int> adj[MAX_N]; // reused
vector<vector<int>> crit_adjs[MAX_N];
void update1(int u, int v, set<int>& s) { // one-way
    if (s.count(v)) s.erase(v);
    else s.insert(v);
}
void save(int u) {
    vector<int> cur_adj(adj[u].begin(), adj[u].end());
    crit_adjs[u].push_back(cur_adj);
}
void precomp() {
    vector<pii> order;
    for (int i = 0; i < n; i++) order.push_back({h[i], i});
    sort(order.begin(), order.end());
    for (int i = 0; i < n; i++) {
        id[order[i].second] = i;
        rev_id[i] = order[i].second;
    }
 
    for (int upd = 0; upd <= t; upd++) {
        if (upd == 0) {
            for (int u = 0; u < n; u++) {
                upds[u].push_back({0, -1});
                save(u);
            }
            continue;
        }
 
        int u = id[e1[upd]], v = id[e2[upd]];
        update1(u, v, adj[u]);
        update1(v, u, adj[v]);
        upds[u].push_back({upd, v});
        upds[v].push_back({upd, u});
 
        if (((int) upds[u].size() - 1) % K == 0) save(u);
        if (((int) upds[v].size() - 1) % K == 0) save(v);
    }
}
 
void init(int tmp_n, int tmp_d, int tmp_h[]) {
    n = tmp_n;
    for (int i = 0; i < n; i++) h[i] = tmp_h[i];
}
void curseChanges(int tmp_t, int tmp_e1[], int tmp_e2[]) {
    t = tmp_t;
    for (int i = 1; i <= t; i++) {
        e1[i] = tmp_e1[i - 1];
        e2[i] = tmp_e2[i - 1];
    }
    precomp();
}
 
set<int> update2(int u, int upd) {
    // First update with time <= upd
    int hi = upper_bound(upds[u].begin(), upds[u].end(), make_pair(upd, (int) 1e9)) - upds[u].begin() - 1; 
    int lo = K * (hi / K);
    set<int> cur_adj(crit_adjs[u][hi / K].begin(), crit_adjs[u][hi / K].end());
 
    for (int i = lo + 1; i <= hi; i++) 
        update1(u, upds[u][i].second, cur_adj);
    return cur_adj;
}
int question(int u, int v, int upd) {
    u = id[u]; 
    v = id[v];
 
    set<int> u_adj(update2(u, upd));
    set<int> v_adj(update2(v, upd));   

    int ans = 1e9;
    auto l_it = v_adj.begin(), r_it = v_adj.begin();
    for (auto it = u_adj.begin(); it != u_adj.end(); it++) {
        while (l_it != v_adj.end() && next(l_it, 1) != v_adj.end() && h[rev_id[*next(l_it, 1)]] <= h[rev_id[*it]]) l_it++;
        while (r_it != v_adj.end() && h[rev_id[*r_it]] <= h[rev_id[*it]]) r_it++;
 
        if (l_it != v_adj.end()) ans = min(ans, abs(h[rev_id[*it]] - h[rev_id[*l_it]]));
        if (r_it != v_adj.end()) ans = min(ans, abs(h[rev_id[*it]] - h[rev_id[*r_it]]));
    }    
    return ans;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11096 KB Output is correct
2 Correct 5 ms 10912 KB Output is correct
3 Correct 5 ms 11096 KB Output is correct
4 Correct 31 ms 19316 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 46888 KB Output is correct
2 Correct 363 ms 46672 KB Output is correct
3 Correct 321 ms 25824 KB Output is correct
4 Correct 1763 ms 31600 KB Output is correct
5 Correct 694 ms 38640 KB Output is correct
6 Execution timed out 3040 ms 37684 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 46632 KB Output is correct
2 Correct 2179 ms 33396 KB Output is correct
3 Correct 1413 ms 34904 KB Output is correct
4 Correct 2307 ms 37528 KB Output is correct
5 Correct 501 ms 46344 KB Output is correct
6 Correct 2640 ms 37588 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 12888 KB Output is correct
2 Correct 175 ms 12296 KB Output is correct
3 Correct 290 ms 12200 KB Output is correct
4 Correct 1080 ms 12804 KB Output is correct
5 Correct 931 ms 13144 KB Output is correct
6 Correct 166 ms 12120 KB Output is correct
7 Correct 899 ms 12172 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 4 ms 11096 KB Output is correct
3 Correct 5 ms 10912 KB Output is correct
4 Correct 5 ms 11096 KB Output is correct
5 Correct 31 ms 19316 KB Output is correct
6 Correct 368 ms 46888 KB Output is correct
7 Correct 363 ms 46672 KB Output is correct
8 Correct 321 ms 25824 KB Output is correct
9 Correct 1763 ms 31600 KB Output is correct
10 Correct 694 ms 38640 KB Output is correct
11 Execution timed out 3040 ms 37684 KB Time limit exceeded
12 Halted 0 ms 0 KB -