제출 #643250

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
643250		Vladth11	The Potion of Great Power (CEOI20_potion)	C++14	56 / 100	3030 ms	29900 KiB

potion

#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <algorithm>
 
//#define debug(x) cerr << #x << " " << x << "\n"
  
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
 
const int bSize = 30;
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;
}

컴파일 시 표준 에러 (stderr) 메시지

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:92:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         if(r + pas < ds[x].blocks.size() && ds[x].blocks[r + pas].time <= v)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:105:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<BLOCK>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |         if(r + pas < ds[y].blocks.size() && ds[y].blocks[r + pas].time <= v)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
potion.cpp:115: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]
  115 |         if(r + pas < ds[x].changes.size() && ds[x].changes[r + pas].second < timpX)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:120: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]
  120 |     for(; r < ds[x].changes.size() && ds[x].changes[r].second <= v; r++) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:126: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]
  126 |         if(r + pas < ds[y].changes.size() && ds[y].changes[r + pas].second < timpY)
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:131: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]
  131 |     for(; r < ds[y].changes.size() && ds[y].changes[r].second <= v; r++) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:139:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |     for(i = 0; i < parcurgere[0].size(); i++) {
      |                ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:152:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for(i = 0; i < parcurgere[1].size(); i++) {
      |                ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:168:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~~
potion.cpp:168:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |     while(i < parcurgere[0].size() && j < parcurgere[1].size()) {
      |                                       ~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 17 / 17
• Subtask 3: 0 / 14
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 0 / 30