oj.uz

답안 #612117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
612117 2022-07-29T10:54:30 Z 1bin The Potion of Great Power (CEOI20_potion) C++14
17 / 100
 544 ms 262144 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define all(v) v.begin(), v.end()
const int NMAX = 1e5 + 5;
const int sqt = 50;
int n, d, u, q, h[NMAX], a, b, A[2 * NMAX], B[2 * NMAX];
vector<int> ix[NMAX];
vector<vector<pair<int, int>>> v[NMAX];
set<pair<int, int>> l, r;

void init(int N, int D, int H[]){
    n = N; d = D;
    for(int i = 0; i < n; i++) h[i] = H[i];
    return;
}

void chk(int x){
    int sz = ix[x].size();
    if(sz % sqt) return;
    set<pair<int, int>> s;
    sz /= sqt;
    if(sz) for(auto& t : v[x].back()) s.emplace(t);
    for(int i = sz * sqt; i < sz * sqt + sqt; i++){
        int y = (A[ix[x][i]] == x) ? B[ix[x][i]] : A[ix[x][i]];
        if(s.find({h[y], y}) == s.end()) s.insert({h[y], y});
        else s.erase({h[y], y});
    }
    vector<pair<int, int>> tmp;
    for(auto t : s) tmp.emplace_back(t);
    v[x].emplace_back(tmp);
    return;
}

void curseChanges(int U, int A_[], int B_[]){
    u = U;
    for(int i = 0; i < u; i++) A[i] = A_[i], B[i] = B_[i];
    for(int i = 0; i < u; i++){
        a = A[i]; b = B[i];
        ix[a].emplace_back(i);
        ix[b].emplace_back(i);
    }
    for(int i = 0; i < n; i++){
        set<pair<int, int>> s;
        for(int j = 0; j < ix[i].size(); j++){
            int t = A[ix[i][j]] == i ? B[ix[i][j]] : A[ix[i][j]];
            if(s.find({h[t], t}) == s.end()) s.insert({h[t], t});
            else s.erase({h[t], t});
            
            if(j % sqt == sqt - 1) continue;
            vector<pair<int, int>> tmp;
            for(auto t : s) tmp.emplace_back(t);
            v[i].emplace_back(tmp);
        }
        
    }
    return;
}

int question(int x, int y, int V){
    int ans = 1e9, xb, yb, lsz, rsz;
    int xsz = lower_bound(all(ix[x]), V) - ix[x].begin();
    int ysz = lower_bound(all(ix[y]), V) - ix[y].begin();
    xb = xsz / sqt; yb = ysz / sqt;
    if(xb >= 1) for(auto& t : v[x][xb - 1]) l.emplace(t);
    if(yb >= 1) for(auto& t : v[y][yb - 1]) r.emplace(t);
    for(int i = xb * sqt; i < xsz; i++) {
        int t = (A[ix[x][i]] == x) ? B[ix[x][i]] : A[ix[x][i]];
        if(l.find({h[t], t}) == l.end()) l.insert({h[t], t});
        else l.erase({h[t], t});
    }
    for(int i = yb * sqt; i < ysz; i++) {
        int t = (A[ix[y][i]] == y) ? B[ix[y][i]] : A[ix[y][i]];
        if(r.find({h[t], t}) == r.end()) r.insert({h[t], t});
        else r.erase({h[t], t});
    }
    auto xi = l.begin();
    auto yi = r.begin();
    lsz = l.size(); rsz = r.size();
    while(xi != l.end() && yi != r.end()){
        ans = min(ans, abs(xi->fi - yi->fi));
        xi->fi < yi->fi ? xi++ : yi++;
    }
   l.clear(); r.clear();
    return ans;
}

Compilation message

potion.cpp: In function 'void curseChanges(int, int*, int*)':
potion.cpp:47:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int j = 0; j < ix[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:63:28: warning: variable 'lsz' set but not used [-Wunused-but-set-variable]
   63 |     int ans = 1e9, xb, yb, lsz, rsz;
      |                            ^~~
potion.cpp:63:33: warning: variable 'rsz' set but not used [-Wunused-but-set-variable]
   63 |     int ans = 1e9, xb, yb, lsz, rsz;
      |                                 ^~~

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5200 KB Output is correct
2 Correct 5 ms 5200 KB Output is correct
3 Correct 4 ms 5200 KB Output is correct
4 Correct 17 ms 5940 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 368 ms 41400 KB Output is correct
2 Correct 298 ms 41448 KB Output is correct
3 Incorrect 282 ms 53800 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 398 ms 41576 KB Output is correct
2 Runtime error 544 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 6848 KB Output is correct
2 Incorrect 20 ms 7676 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 5 ms 5200 KB Output is correct
3 Correct 5 ms 5200 KB Output is correct
4 Correct 4 ms 5200 KB Output is correct
5 Correct 17 ms 5940 KB Output is correct
6 Correct 368 ms 41400 KB Output is correct
7 Correct 298 ms 41448 KB Output is correct
8 Incorrect 282 ms 53800 KB Incorrect
9 Halted 0 ms 0 KB -