oj.uz

답안 #646947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
646947 2022-10-01T08:15:28 Z Vladth11 The Potion of Great Power (CEOI20_potion) C++14
52 / 100
 3000 ms 216096 KB 
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
 
#pragma pack(1)
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
 
const int NMAX = 100000;
const int VMAX = NMAX * 89;
 
int total = 0;
int nxt[NMAX * 100];
int val[NMAX * 100];
 
class lista{
public:
    int cnt = 0;
    int primul = 0;
    int ultimul = 0;
    void init(){
        cnt = primul = ultimul = 0;
    }
    void clear(){
        cnt = 0;
        primul = 0;
        ultimul = 0;
    }
    void push_back(int x){
        if(cnt == 0){
            primul = ultimul = ++total;
        }else{
            nxt[ultimul] = ++total;
            ultimul = total;
        }
        cnt++;
        val[total] = x;
    }
};
 
 
 
int a[NMAX], n;
int u;
int cc = 0;
int l[VMAX];
int r[VMAX];
lista v[VMAX];
bool ok;
int root[NMAX];
vector <int> parcurgere[2];
 
inline void update(int node, int st, int dr, int a, int b, int val){
    if(a <= st && dr <= b){
        v[node].push_back(val);
        return;
    }
    int mid = (st + dr) / 2;
    if(a <= mid){
        if(l[node] == 0){
            l[node] = ++cc;
        }
        update(l[node], st, mid, a, b, val);
    }
    if(b > mid){
        if(r[node] == 0){
            r[node] = ++cc;
        }
        update(r[node], mid + 1, dr, a, b, val);
    }
}
 
inline void query(int node, int st, int dr, int aa){
    if(node == 0)
        return;
    //parcurgere[ok].clear();
    int t = v[node].primul;
    while(t != 0){
        parcurgere[ok].push_back(a[val[t]]);
        t = nxt[t];
    }
    int mid = (st + dr) / 2;
    if(aa <= mid)
        query(l[node], st, mid, aa);
    else
        query(r[node], mid + 1, dr, aa);
}
 
void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < N; i++) {
        a[i] = H[i];
        root[i] = ++cc;
    }
}
 
map <pii, int> mp;
 
void curseChanges(int U, int A[], int B[]) {
    u = U;
    for(int i = 0; i < U; i++){
        if(A[i] > B[i])
            swap(A[i], B[i]);
        pii x = {A[i], B[i]};
        if(mp[x] == 0)
            mp[x] = i + 1;
        else{
            update(root[x.first], 0, U, mp[x], i, x.second);
            update(root[x.second], 0, U, mp[x], i, x.first);
            mp[x] = 0;
        }
    }
    for(auto y : mp){
        pii x = y.first;
        if(mp[x] != 0){
            update(root[x.first], 0, U, mp[x], U, x.second);
            update(root[x.second], 0, U, mp[x], U, x.first);
        }
    }
    mp.clear();
}
 
int question(int x, int y, int v) {
    int minim = 1e9;
    ok = 0;
    parcurgere[ok].clear();
    query(root[x], 0, u, v);
    if(!parcurgere[ok].size()) return minim;
    ok = 1;
    parcurgere[ok].clear();
    query(root[y], 0, u, v);
    if(!parcurgere[ok].size()) return minim;
    sort(parcurgere[0].begin(), parcurgere[0].end());
    sort(parcurgere[1].begin(), parcurgere[1].end());
    //assert(cc <= NMAX * 36);
    int i = 0, j = 0;
    while(i < parcurgere[0].size() && j < parcurgere[1].size()){
        minim = min(minim, abs(parcurgere[0][i] - parcurgere[1][j]));
        if(parcurgere[0][i] < parcurgere[1][j])
            i++;
        else
            j++;
    }
    return minim;
}

Compilation message

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:141:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()){
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:141:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()){
      |                                       ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 976 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 2 ms 976 KB Output is correct
4 Correct 14 ms 2848 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 599 ms 216000 KB Output is correct
2 Correct 562 ms 216096 KB Output is correct
3 Correct 272 ms 77324 KB Output is correct
4 Correct 2259 ms 134332 KB Output is correct
5 Correct 987 ms 178716 KB Output is correct
6 Correct 2952 ms 161004 KB Output is correct
7 Correct 881 ms 179236 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 527 ms 216008 KB Output is correct
2 Correct 2147 ms 108240 KB Output is correct
3 Correct 1760 ms 166468 KB Output is correct
4 Correct 2960 ms 161096 KB Output is correct
5 Correct 697 ms 212368 KB Output is correct
6 Execution timed out 3092 ms 160932 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 8784 KB Output is correct
2 Correct 74 ms 4680 KB Output is correct
3 Correct 101 ms 3580 KB Output is correct
4 Correct 643 ms 6584 KB Output is correct
5 Correct 599 ms 7644 KB Output is correct
6 Correct 90 ms 6856 KB Output is correct
7 Correct 492 ms 4816 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 2 ms 976 KB Output is correct
3 Correct 2 ms 976 KB Output is correct
4 Correct 2 ms 976 KB Output is correct
5 Correct 14 ms 2848 KB Output is correct
6 Correct 599 ms 216000 KB Output is correct
7 Correct 562 ms 216096 KB Output is correct
8 Correct 272 ms 77324 KB Output is correct
9 Correct 2259 ms 134332 KB Output is correct
10 Correct 987 ms 178716 KB Output is correct
11 Correct 2952 ms 161004 KB Output is correct
12 Correct 881 ms 179236 KB Output is correct
13 Correct 527 ms 216008 KB Output is correct
14 Correct 2147 ms 108240 KB Output is correct
15 Correct 1760 ms 166468 KB Output is correct
16 Correct 2960 ms 161096 KB Output is correct
17 Correct 697 ms 212368 KB Output is correct
18 Execution timed out 3092 ms 160932 KB Time limit exceeded
19 Halted 0 ms 0 KB -