oj.uz

답안 #972112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972112 2024-04-30T05:56:56 Z RaresFelix The Potion of Great Power (CEOI20_potion) C++17
38 / 100
 1996 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;
using vi = vector<int>;

namespace AINTpers {
    vi Cnt, L, R;

    int nod_nou() {
        Cnt.push_back(0);
        L.push_back(-1);
        R.push_back(-1);
        return int(Cnt.size()) - 1;
    }

    int join(int u, int v) {
        int re = L.size();
        Cnt.push_back(Cnt[u] + Cnt[v]);
        L.push_back(u);
        R.push_back(v);
        return re;
    }

    int enable(int u, int p, int st, int dr) {
        if(u == -1) return -1;
        if(p < st || dr < p) return u;
        if(st == dr) {
            int v = L.size();
            Cnt.push_back(1);
            L.push_back(-1); R.push_back(-1);
            return v;
        }
        if(L[u] == -1) {
            L[u] = nod_nou();
            R[u] = nod_nou();
        }
        return join(enable(L[u], p, st, (st + dr) >> 1),
            enable(R[u], p, ((st + dr) >> 1) + 1, dr));
    }

    int disable(int u, int p, int st, int dr) {
        if(u == -1) return -1;
        if(p < st || dr < p) return u;
        if(st == dr) {
            int v = L.size();
            Cnt.push_back(0);
            L.push_back(-1); R.push_back(-1);
            return v;
        }
        return join(disable(L[u], p, st, (st + dr) >> 1), 
            disable(R[u], p, ((st + dr) >> 1) + 1, dr));
    }

    int stare(int u, int p, int st, int dr) {
        if(u == -1) return 0;
        if(st == dr) return Cnt[u];
        int mij = (st + dr) / 2;
        if(L[u] == -1) return 0;
        if(p <= mij) return stare(L[u], p, st, mij);
        return stare(R[u], p, mij + 1, dr);
    }

    void enumerate(int u, int st, int dr, vi &Re) {
        if(u == -1 || !Cnt[u]) return;
        if(st == dr) {
            Re.push_back(st);
            return;
        }
        enumerate(L[u], st, (st + dr) >> 1, Re);
        enumerate(R[u], ((st + dr) >> 1) + 1, dr, Re);
    }
}

struct SetPers {
    int n;
    vector<ii> Rad;

    SetPers(int N) : n(N) {
        Rad.emplace_back(0, AINTpers::nod_nou());
    }

    void update(int t, int p) {
        int r = Rad.back().second;
        int a = AINTpers::stare(r, p, 0, n - 1);
        if(!a) {
            Rad.push_back({t, AINTpers::enable(r, p, 0, n - 1)});
        } else {
            Rad.push_back({t, AINTpers::disable(r, p, 0, n - 1)});
        }
    }

    vi list(int t) {
        auto it = upper_bound(Rad.begin(), Rad.end(), ii{t, 1e9});
        --it;
        int r = it->second;
        vi Re;
        AINTpers::enumerate(r, 0, n - 1, Re);
        return Re;
    }
};

int n;
vi H0;

vector<SetPers> S;

void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < n; ++i) H0.push_back(H[i]); 
    for(int i = 0; i < n; ++i)
        S.push_back(SetPers(N));
}

void curseChanges(int U, int A[], int B[]) {
    for(int i = 1; i <= U; ++i) {
        int a = A[i - 1], b = B[i - 1];
        S[a].update(i, b);
        S[b].update(i, a);
    }
}

const int INF = 1e9;

int question(int x, int y, int v) {
    vi A = S[x].list(v), B = S[y].list(v);
    vector<ii> V;
    for(auto it : A)
        V.push_back(ii{H0[it], -1});
    for(auto it : B)
        V.push_back(ii{H0[it], 1});
    sort(V.begin(), V.end());
    int re = INF;
    for(int i = 1; i < V.size(); ++i) {
        if(V[i].second != V[i - 1].second) 
            re = min(re, V[i].first - V[i - 1].first);
    }
    return re;
}

Compilation message

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:135:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |     for(int i = 1; i < V.size(); ++i) {
      |                    ~~^~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1360 KB Output is correct
2 Correct 2 ms 1360 KB Output is correct
3 Correct 3 ms 1360 KB Output is correct
4 Correct 19 ms 11400 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 532 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 482 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 14552 KB Output is correct
2 Correct 177 ms 7224 KB Output is correct
3 Correct 310 ms 5820 KB Output is correct
4 Correct 1996 ms 11060 KB Output is correct
5 Correct 1915 ms 11064 KB Output is correct
6 Correct 237 ms 6044 KB Output is correct
7 Correct 1667 ms 6128 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 3 ms 1360 KB Output is correct
3 Correct 2 ms 1360 KB Output is correct
4 Correct 3 ms 1360 KB Output is correct
5 Correct 19 ms 11400 KB Output is correct
6 Runtime error 532 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -