oj.uz

답안 #643334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
643334 2022-09-21T18:20:12 Z Vladth11 The Potion of Great Power (CEOI20_potion) C++17
56 / 100
 3000 ms 46784 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 = 11;
const int bits = 13;
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;
};
 
vector <BLOCK> blocks[NMAX];
vector <pii> changes[NMAX];
vector <int> vecini[NMAX];
void baga(int pt, int x, int cand) {
    vecini[pt].push_back(x);
    changes[pt].push_back({x, cand});
    if(changes[pt].size() % bSize == 0) {
        BLOCK nou;
        changer++;
        nou.v.clear();
        nou.time = cand;
        for(auto x : vecini[pt]) {
            par[x] = 0;
        }
        for(auto x : vecini[pt]) {
            par[x]++;
        }
        for(auto x : vecini[pt]) {
            if(par[x] % 2 == 1 && f[x] != changer) {
                nou.v.push_back(x);
                f[x] = changer;
            }
        }
        vecini[pt] = nou.v; // asta e confirmed?
        blocks[pt].push_back(nou);
    }
}
 
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;
        baga(A[i], B[i], timp);
        baga(B[i], 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;
vector <int> parcurgere[2];
 
int question(int x, int y, int v) {
    int r = -1;
    parcurgere[0].clear();
    parcurgere[1].clear();
    intrebare++;
    if(u != v) {
        int timpX = 0, timpY = 0;
        int pas = (1 << 8), r1 = -1;
        while(pas) {
            if(r + pas < blocks[x].size() &&blocks[x][r + pas].time <= v)
                r += pas;
            if(r1 + pas < blocks[y].size() && blocks[y][r1 + pas].time <= v)
                r1 += pas;
            pas /= 2;
        }
        if(r != -1) {
            timpX =blocks[x][r].time + 1;
            parcurgere[0] = blocks[x][r].v;
        }
        if(r1 != -1) {
            timpY = blocks[y][r1].time + 1;
            parcurgere[1] = blocks[y][r1].v;
        }
        r = -1, pas = (1 << bits), r1 = -1;
        while(pas) {
            if(r + pas < changes[x].size() && changes[x][r + pas].second < timpX)
                r += pas;
            if(r1 + pas < changes[y].size() && changes[y][r1 + pas].second < timpY)
                r1 += pas;
            pas /= 2;
        }
        r++;
        for(; r < changes[x].size() && changes[x][r].second <= v; r++) {
            pii change = changes[x][r];
            parcurgere[0].push_back(change.first);
        }
        r1++;
        for(; r1 < changes[y].size() && changes[y][r1].second <= v; r1++) {
            pii change = changes[y][r1];
            parcurgere[1].push_back(change.first);
        }
    } else {
        parcurgere[0] = vecini[x];
        parcurgere[1] = vecini[y];
    }
    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);
    for(auto x : parcurgere[0]) {
        impX[x] = 0;
    }
    for(auto x : parcurgere[0]) {
        impX[x]++;
    }
    for(auto x : parcurgere[1]) {
        impY[x] = 0;
    }
    for(auto x : parcurgere[1]) {
        impY[x]++;
    }
 
    int minim = 1e9;
    int j = 0, i = 0;
    while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
        if(impX[parcurgere[0][i]] % 2 == 0) {
            i++;
            continue;
        }
        if(impY[parcurgere[1][j]] % 2 == 0) {
            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:95:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |             if(r + pas < blocks[x].size() &&blocks[x][r + pas].time <= v)
      |                ~~~~~~~~^~~~~~~~~~~~~~~~~~
potion.cpp:97:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |             if(r1 + pas < blocks[y].size() && blocks[y][r1 + pas].time <= v)
      |                ~~~~~~~~~^~~~~~~~~~~~~~~~~~
potion.cpp:111:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |             if(r + pas < changes[x].size() && changes[x][r + pas].second < timpX)
      |                ~~~~~~~~^~~~~~~~~~~~~~~~~~~
potion.cpp:113:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |             if(r1 + pas < changes[y].size() && changes[y][r1 + pas].second < timpY)
      |                ~~~~~~~~~^~~~~~~~~~~~~~~~~~~
potion.cpp:118:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |         for(; r < changes[x].size() && changes[x][r].second <= v; r++) {
      |               ~~^~~~~~~~~~~~~~~~~~~
potion.cpp:123:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |         for(; r1 < changes[y].size() && changes[y][r1].second <= v; r1++) {
      |               ~~~^~~~~~~~~~~~~~~~~~~
potion.cpp:149:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:149:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  149 |     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 4 ms 7376 KB Output is correct
4 Correct 22 ms 8884 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 21520 KB Output is correct
2 Correct 201 ms 21516 KB Output is correct
3 Correct 150 ms 17584 KB Output is correct
4 Correct 1463 ms 35164 KB Output is correct
5 Correct 310 ms 21700 KB Output is correct
6 Execution timed out 3097 ms 45884 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 21620 KB Output is correct
2 Correct 2653 ms 46784 KB Output is correct
3 Correct 1305 ms 33224 KB Output is correct
4 Correct 2435 ms 45756 KB Output is correct
5 Correct 372 ms 23164 KB Output is correct
6 Correct 2820 ms 45824 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 8168 KB Output is correct
2 Correct 78 ms 8040 KB Output is correct
3 Correct 137 ms 8048 KB Output is correct
4 Correct 855 ms 8784 KB Output is correct
5 Correct 813 ms 8664 KB Output is correct
6 Correct 81 ms 8016 KB Output is correct
7 Correct 674 ms 8400 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 4 ms 7376 KB Output is correct
5 Correct 22 ms 8884 KB Output is correct
6 Correct 209 ms 21520 KB Output is correct
7 Correct 201 ms 21516 KB Output is correct
8 Correct 150 ms 17584 KB Output is correct
9 Correct 1463 ms 35164 KB Output is correct
10 Correct 310 ms 21700 KB Output is correct
11 Execution timed out 3097 ms 45884 KB Time limit exceeded
12 Halted 0 ms 0 KB -