Submission #342410

#	Time	Username	Problem	Language	Result	Execution time	Memory
342410		urd05	The Potion of Great Power (CEOI20_potion)	C++14	0 / 100	73 ms	8812 KiB

potion

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

int n,d;
int h[100000];
int a[100000];
int b[100000];
int u;
bool iscon0[100000];
bool iscon1[100000];
typedef pair<int,int> P;
P ind[100000];

void init(int N, int D, int H[]) {
    n=N;
    d=D;
    for(int i=0;i<n;i++) {
        ind[i]=P(H[i],i);
        h[i]=H[i];
    }
    sort(ind,ind+n);
}

void curseChanges(int U, int A[], int B[]) {
    u=U;
    for(int i=0;i<u;i++) {
        a[i]=A[i];
        b[i]=B[i];
    }
}

int question(int x, int y, int v) {
    memset(iscon0,0,sizeof(iscon0));
    memset(iscon1,0,sizeof(iscon1));
    iscon0[x]=true;
    iscon1[y]=true;
    for(int i=0;i<v;i++) {
        if (a[i]==x) {
            iscon0[b[i]]^=1;
        }
        else if (b[i]==x) {
            iscon0[a[i]]^=1;
        }
        if (a[i]==y) {
            iscon1[b[i]]^=1;
        }
        else if (b[i]==y) {
            iscon1[a[i]]^=1;
        }
    }
    int ret=1e9;
    vector<P> one;
    vector<P> two;
    for(int i=0;i<n;i++) {
        if (iscon0[ind[i].second]) {
            one.push_back(P(ind[i].first,0));
        }
    }
    for(int i=0;i<n;i++) {
        if (iscon1[ind[i].second]) {
            two.push_back(P(ind[i].first,1));
        }
    }
    vector<P> vec;
    merge(one.begin(),one.end(),two.begin(),two.end(),vec.begin());
    for(int i=0;i+1<vec.size();i++) {
        if (vec[i].second!=vec[i+1].second) {
            ret=min(ret,vec[i+1].first-vec[i].first);
        }
    }
    return ret;
}

Compilation message (stderr)

potion.cpp: In function 'int question(int, int, int)':
potion.cpp:66: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]
   66 |     for(int i=0;i+1<vec.size();i++) {
      |                 ~~~^~~~~~~~~~~

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