oj.uz

답안 #643252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
643252 2022-09-21T15:04:41 Z Vladth11 The Potion of Great Power (CEOI20_potion) C++14
56 / 100
 3000 ms 27444 KB 
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <algorithm>
 
//#define debug(x) cerr << #x << " " << x << "\n"
 
#pragma GCC optimize("Ofast")
 
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
 
const int bSize = 40;
const int bits = 17;
const int NMAX = 100000;
const int VMAX = NMAX * 89;
 
int a[NMAX], n;
int u;
int f[NMAX];
int changer = 0;
int par[NMAX];
 
struct BLOCK {
    int time;
    vector <int> v;
};
 
class DS {
public:
    vector <BLOCK> blocks;
    vector <pii> changes;
    vector <int> vecini;
    void baga(int x, int cand) {
        vecini.push_back(x);
        changes.push_back({x, cand});
        if(changes.size() % bSize == 0) {
            BLOCK nou;
            changer++;
            nou.v.clear();
            nou.time = cand;
            for(auto x : vecini) {
                par[x] = 0;
            }
            for(auto x : vecini) {
                par[x]++;
            }
            for(auto x : vecini) {
                if(par[x] % 2 == 1 && f[x] != changer) {
                    nou.v.push_back(x);
                    f[x] = changer;
                }
            }
            blocks.push_back(nou);
        }
    }
 
} ds[NMAX];
 
void init(int N, int D, int H[]) {
    n = N;
    for(int i = 0; i < N; i++) {
        a[i] = H[i];
    }
}
 
void curseChanges(int U, int A[], int B[]) {
    u = U;
    for(int i = 0; i < U; i++) {
        int timp = i + 1;
        ds[A[i]].baga(B[i], timp);
        ds[B[i]].baga(A[i], timp);
    }
}
 
bool cmp(int A, int B) {
    if(a[A] != a[B])
        return a[A] < a[B];
    return A < B;
}
 
int impX[NMAX];
int impY[NMAX];
int intrebare;
 
int question(int x, int y, int v) {
    int r = -1;
    intrebare++;
    int timpX = 0, timpY = 0;
    int pas = (1 << bits);
    while(pas) {
        if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
            r += pas;
        pas /= 2;
    }
    vector <int> parcurgere[2];
    unordered_set <int> stX;
    if(r != -1) {
        timpX = ds[x].blocks[r].time + 1;
        parcurgere[0] = ds[x].blocks[r].v;
    }
    r = -1;
    pas = (1 << bits);
    while(pas) {
        if(r + pas < ds[y].blocks.size() && ds[y].blocks[r + pas].time <= v)
            r += pas;
        pas /= 2;
    }
    if(r != -1) {
        timpY = ds[y].blocks[r].time + 1;
        parcurgere[1] = ds[y].blocks[r].v;
    }
    r = -1, pas = (1 << bits);
    while(pas) {
        if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
            r += pas;
        pas /= 2;
    }
    r++;
    for(; r < ds[x].changes.size() && ds[x].changes[r].second <= v; r++) {
        pii change = ds[x].changes[r];
        parcurgere[0].push_back(change.first);
    }
    r = -1, pas = (1 << bits);
    while(pas) {
        if(r + pas < ds[y].changes.size() && ds[y].changes[r + pas].second < timpY)
            r += pas;
        pas /= 2;
    }
    r++;
    for(; r < ds[y].changes.size() && ds[y].changes[r].second <= v; r++) {
        pii change = ds[y].changes[r];
        parcurgere[1].push_back(change.first);
    }
    if(!parcurgere[0].size() || !parcurgere[1].size()) return 1e9;
    sort(parcurgere[0].begin(), parcurgere[0].end(), cmp);
    sort(parcurgere[1].begin(), parcurgere[1].end(), cmp);
    int cnt = 0, i;
    for(i = 0; i < parcurgere[0].size(); i++) {
        if(i != 0 && parcurgere[0][i - 1] != parcurgere[0][i]) {
            if(cnt % 2 == 0) {
                impX[parcurgere[0][i - 1]] = intrebare;
            }
            cnt = 0;
        }
        cnt++;
    }
    if(cnt % 2 == 0) {
        impX[parcurgere[0][i - 1]] = intrebare;
    }
    cnt = 0;
    for(i = 0; i < parcurgere[1].size(); i++) {
        if(i != 0 && parcurgere[1][i - 1] != parcurgere[1][i]) {
            if(cnt % 2 == 0) {
                impY[parcurgere[1][i - 1]] = intrebare;
            }
            cnt = 0;
        }
        cnt++;
    }
    if(cnt % 2 == 0) {
        impY[parcurgere[1][i - 1]] = intrebare;
    }
    cnt = 0;
    int minim = 1e9;
    i = 0;
    int j = 0;
    while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
        if(impX[parcurgere[0][i]] == intrebare) {
            i++;
            continue;
        }
        if(impY[parcurgere[1][j]] == intrebare) {
            j++;
            continue;
        }
        minim = min(minim, abs(a[parcurgere[0][i]] - a[parcurgere[1][j]]));
        if(a[parcurgere[0][i]] < a[parcurgere[1][j]])
            i++;
        else
            j++;
    }
    return minim;
}

Compilation message

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:94:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:107:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |         if(r + pas < ds[y].blocks.size() && ds[y].blocks[r + pas].time <= v)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:117:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:122:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(; r < ds[x].changes.size() && ds[x].changes[r].second <= v; r++) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:128:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         if(r + pas < ds[y].changes.size() && ds[y].changes[r + pas].second < timpY)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:133:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |     for(; r < ds[y].changes.size() && ds[y].changes[r].second <= v; r++) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:141:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |     for(i = 0; i < parcurgere[0].size(); i++) {
      |                ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:154:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |     for(i = 0; i < parcurgere[1].size(); i++) {
      |                ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:170:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:170:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
      |                                       ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7376 KB Output is correct
2 Correct 5 ms 7376 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 16 ms 8212 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 213 ms 20112 KB Output is correct
2 Correct 197 ms 19992 KB Output is correct
3 Correct 488 ms 16624 KB Output is correct
4 Correct 1536 ms 21068 KB Output is correct
5 Correct 377 ms 17892 KB Output is correct
6 Execution timed out 3025 ms 27416 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 19960 KB Output is correct
2 Correct 2573 ms 26540 KB Output is correct
3 Correct 1367 ms 23908 KB Output is correct
4 Correct 2526 ms 27340 KB Output is correct
5 Correct 383 ms 21952 KB Output is correct
6 Correct 2984 ms 27444 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 8148 KB Output is correct
2 Correct 125 ms 8044 KB Output is correct
3 Correct 238 ms 8048 KB Output is correct
4 Correct 984 ms 8440 KB Output is correct
5 Correct 885 ms 8400 KB Output is correct
6 Correct 115 ms 7832 KB Output is correct
7 Correct 832 ms 8240 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7376 KB Output is correct
2 Correct 5 ms 7376 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 5 ms 7376 KB Output is correct
5 Correct 16 ms 8212 KB Output is correct
6 Correct 213 ms 20112 KB Output is correct
7 Correct 197 ms 19992 KB Output is correct
8 Correct 488 ms 16624 KB Output is correct
9 Correct 1536 ms 21068 KB Output is correct
10 Correct 377 ms 17892 KB Output is correct
11 Execution timed out 3025 ms 27416 KB Time limit exceeded
12 Halted 0 ms 0 KB -