Submission #758729

#	Time	Username	Problem	Language	Result	Execution time	Memory
758729		gagik_2007	The Potion of Great Power (CEOI20_potion)	C++17	Compilation error	0 ms	0 KiB

potion

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MAXN = 1e5 + 7;
int n;
int a[MAXN];
vector<pair<int, int>>q[MAXN];
vector<int>vi[MAXN];
vector<set<int>>v[MAXN];
set<int>curv[MAXN];
int T;

void init(int N, int D, vector<int>H) {
    n = N;
    set<int>empty;
    empty.clear();
    for (int i = 0; i < n; i++) {
        a[i] = H[i];
        v[i].push_back(empty);
        vi[i].push_back(-1);
    }
    T = D;
}

void curseChanges(int U, vector<int>A, vector<int>B) {
    for(int i=0;i<U;i++){
        if(curv[A[i]].find(B[i])!=curv[A[i]].end()){
            // A[i]
            q[A[i]].push_back({i, -(B[i]+1)});
            curv[A[i]].erase(B[i]);

            // B[i]
            q[B[i]].push_back({i, -(A[i]+1)});
            curv[B[i]].erase(A[i]);
        }
        else{
            // A[i]
            q[A[i]].push_back({i, (B[i]+1)});
            curv[A[i]].insert(B[i]);

            // B[i]
            q[B[i]].push_back({i, (A[i]+1)});
            curv[B[i]].insert(A[i]);
        }

        if(q[A[i]].size()%T==0){
            v[A[i]].push_back(curv[A[i]]);
            vi[A[i]].push_back(i);
        }

        if(q[B[i]].size()%T==0){
            v[B[i]].push_back(curv[B[i]]);
            vi[B[i]].push_back(i);
        }
    }
}

set<int>cx,cy;
vector<int>vx,vy;

int question(int x, int y, int u) {
    cx.clear(), cy.clear(), vx.clear(), vy.clear();

    // x
    auto it=lower_bound(vi[x].begin(),vi[x].end(),u);
    it--;
    int ind=it-vi[x].begin();
    int day=*it;
    cx=v[x][ind];
    auto it2=upper_bound(q[x].begin(),q[x].end(),make_pair(day, int(1e9)));
    while(it2!=q[x].end()&&(*it2).ff<u){
        if((*it2).ss>0){
            cx.insert((*it2).ss-1);
        }
        else{
            cx.erase(-(*it2).ss-1);
        }
        it2++;
    }
    for(int i:cx){
        vx.push_back(a[i]);
    }
    
    // y
    it=lower_bound(vi[y].begin(),vi[y].end(),u);
    it--;
    ind=it-vi[y].begin();
    day=*it;
    cy=v[y][ind];
    it2=upper_bound(q[y].begin(),q[y].end(),make_pair(day, int(1e9)));
    while(it2!=q[y].end()&&(*it2).ff<u){
        if((*it2).ss>0){
            cy.insert((*it2).ss-1);
        }
        else{
            cy.erase(-(*it2).ss-1);
        }
        it2++;
    }
    for(int i:cy){
        vy.push_back(a[i]);
    }

    // finding the closest
    sort(vx.begin(),vx.end());
    sort(vy.begin(),vy.end());
    int ix=0,iy=0;
    int ans=1e9;
    while(ix<vx.size()&&iy<vy.size()){
        ans=min(ans,abs(vx[ix]-vy[iy]));
        if(vx[ix]<=vy[iy])ix++;
        else iy++;
    }
    return ans;
}

Compilation message (stderr)

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:120:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     while(ix<vx.size()&&iy<vy.size()){
      |           ~~^~~~~~~~~~
potion.cpp:120:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     while(ix<vx.size()&&iy<vy.size()){
      |                         ~~^~~~~~~~~~
/usr/bin/ld: /tmp/ccvslRRu.o: in function `main':
grader.cpp:(.text.startup+0xec): undefined reference to `init(int, int, int*)'
/usr/bin/ld: grader.cpp:(.text.startup+0x184): undefined reference to `curseChanges(int, int*, int*)'
collect2: error: ld returned 1 exit status