oj.uz

답안 #643320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
643320 2022-09-21T18:03:19 Z Vladth11 The Potion of Great Power (CEOI20_potion) C++17
56 / 100
 3000 ms 29256 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 = 30;
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;
};
 
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;
                }
            }
            vecini = nou.v; // asta e confirmed?
            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;
vector <int> parcurgere[2];
 
int question(int x, int y, int v) {
    int r = -1;
    parcurgere[0].clear();
    parcurgere[1].clear();
    intrebare++;
    int timpX = 0, timpY = 0;
    int pas = (1 << 9), r1 = -1;
    while(pas) {
        if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
            r += pas;
        if(r1 + pas < ds[y].blocks.size() && ds[y].blocks[r1 + pas].time <= v)
            r1 += pas;
        pas /= 2;
    }
    if(r != -1) {
        timpX = ds[x].blocks[r].time + 1;
        parcurgere[0] = ds[x].blocks[r].v;
    }
    if(r1 != -1) {
        timpY = ds[y].blocks[r1].time + 1;
        parcurgere[1] = ds[y].blocks[r1].v;
    }
    r = -1, pas = (1 << bits), r1 = -1;
    while(pas) {
        if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
            r += pas;
         if(r1 + pas < ds[y].changes.size() && ds[y].changes[r1 + pas].second < timpY)
            r1 += 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);
    }
    r1++;
    for(; r1 < ds[y].changes.size() && ds[y].changes[r1].second <= v; r1++) {
        pii change = ds[y].changes[r1];
        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);
    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:98:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:100:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |         if(r1 + pas < ds[y].blocks.size() && ds[y].blocks[r1 + pas].time <= v)
      |            ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:114: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]
  114 |         if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:116: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]
  116 |          if(r1 + pas < ds[y].changes.size() && ds[y].changes[r1 + pas].second < timpY)
      |             ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:121: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]
  121 |     for(; r < ds[x].changes.size() && ds[x].changes[r].second <= v; r++) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:126:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |     for(; r1 < ds[y].changes.size() && ds[y].changes[r1].second <= v; r1++) {
      |           ~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:147:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:147:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |     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 7 ms 7384 KB Output is correct
2 Correct 7 ms 7376 KB Output is correct
3 Correct 6 ms 7376 KB Output is correct
4 Correct 19 ms 8900 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 20732 KB Output is correct
2 Correct 230 ms 20792 KB Output is correct
3 Correct 254 ms 15684 KB Output is correct
4 Correct 1695 ms 21748 KB Output is correct
5 Correct 348 ms 18436 KB Output is correct
6 Execution timed out 3053 ms 29256 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 20688 KB Output is correct
2 Correct 2473 ms 28224 KB Output is correct
3 Correct 1380 ms 24572 KB Output is correct
4 Correct 2652 ms 29208 KB Output is correct
5 Correct 364 ms 21940 KB Output is correct
6 Correct 2771 ms 29252 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 8180 KB Output is correct
2 Correct 102 ms 8016 KB Output is correct
3 Correct 177 ms 8004 KB Output is correct
4 Correct 870 ms 8400 KB Output is correct
5 Correct 804 ms 8528 KB Output is correct
6 Correct 94 ms 7856 KB Output is correct
7 Correct 704 ms 8196 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7376 KB Output is correct
2 Correct 7 ms 7384 KB Output is correct
3 Correct 7 ms 7376 KB Output is correct
4 Correct 6 ms 7376 KB Output is correct
5 Correct 19 ms 8900 KB Output is correct
6 Correct 230 ms 20732 KB Output is correct
7 Correct 230 ms 20792 KB Output is correct
8 Correct 254 ms 15684 KB Output is correct
9 Correct 1695 ms 21748 KB Output is correct
10 Correct 348 ms 18436 KB Output is correct
11 Execution timed out 3053 ms 29256 KB Time limit exceeded
12 Halted 0 ms 0 KB -