#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));
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(one.size()+two.size());
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
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:64: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]
64 | for(int i=0;i+1<vec.size();i++) {
| ~~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
620 KB |
Output is correct |
2 |
Correct |
11 ms |
620 KB |
Output is correct |
3 |
Correct |
11 ms |
620 KB |
Output is correct |
4 |
Correct |
277 ms |
2284 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
175 ms |
4460 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
170 ms |
4476 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1911 ms |
1004 KB |
Output is correct |
2 |
Correct |
1969 ms |
876 KB |
Output is correct |
3 |
Correct |
2226 ms |
1004 KB |
Output is correct |
4 |
Correct |
2550 ms |
876 KB |
Output is correct |
5 |
Correct |
2472 ms |
876 KB |
Output is correct |
6 |
Correct |
1193 ms |
768 KB |
Output is correct |
7 |
Execution timed out |
3096 ms |
956 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
11 ms |
620 KB |
Output is correct |
3 |
Correct |
11 ms |
620 KB |
Output is correct |
4 |
Correct |
11 ms |
620 KB |
Output is correct |
5 |
Correct |
277 ms |
2284 KB |
Output is correct |
6 |
Incorrect |
175 ms |
4460 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |