#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5;
const int MAX_M = 2e5;
int n, m, d;
int h[MAX_N], a[MAX_M], b[MAX_M];
unordered_map<int, int> pos[MAX_N];
vector<int> trust[MAX_N];
set<int> hy;
void init( int N, int D, int H[] ) {
n = N;
d = D;
for ( int i = 0; i < n; i++ )
h[i] = H[i];
for ( int i = 0; i < n; i++ )
trust[i].push_back( i );
}
void curseChanges( int M, int A[], int B[] ) {
m = M;
for ( int i = 0; i < M; i++ ) {
a[i] = A[i];
b[i] = B[i];
}
for ( int i = 0; i < m; i++ ) {
if ( pos[a[i]][b[i]] == 0 ) {
pos[a[i]][b[i]] = trust[a[i]].size();
trust[a[i]].push_back( b[i] );
pos[b[i]][a[i]] = trust[b[i]].size();
trust[b[i]].push_back( a[i] );
} else {
int p, l;
p = pos[a[i]][b[i]], l = trust[a[i]].size() - 1;
swap( pos[a[i]][b[i]], pos[a[i]][trust[a[i]][l]] );
swap( trust[a[i]][p], trust[a[i]][l] );
pos[a[i]][trust[a[i]][l]] = 0;
trust[a[i]].pop_back();
p = pos[b[i]][a[i]], l = trust[b[i]].size() - 1;
swap( pos[b[i]][a[i]], pos[b[i]][trust[b[i]][l]] );
swap( trust[b[i]][p], trust[b[i]][l] );
pos[b[i]][trust[b[i]][l]] = 0;
trust[b[i]].pop_back();
}
}
}
int question( int x, int y, int t ) {
hy.clear();
for ( int i = 1; i < trust[y].size(); i++ )
hy.insert( h[trust[y][i]] );
int minDist = 1e9;
for ( int i = 1; i < trust[x].size(); i++ ) {
int hx = h[trust[x][i]];
auto p = hy.upper_bound( hx );
if ( p != hy.end() )
minDist = min( minDist, *p - hx );
if ( p != hy.begin() ) {
p--;
minDist = min( minDist, hx - *p );
}
}
return minDist;
}
Compilation message
potion.cpp: In function 'int question(int, int, int)':
potion.cpp:56:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | for ( int i = 1; i < trust[y].size(); i++ )
| ~~^~~~~~~~~~~~~~~~~
potion.cpp:60:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | for ( int i = 1; i < trust[x].size(); i++ ) {
| ~~^~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
8792 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
9064 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
246 ms |
39408 KB |
Output is correct |
2 |
Correct |
226 ms |
39708 KB |
Output is correct |
3 |
Correct |
107 ms |
15632 KB |
Output is correct |
4 |
Correct |
1300 ms |
25808 KB |
Output is correct |
5 |
Correct |
386 ms |
31744 KB |
Output is correct |
6 |
Correct |
2867 ms |
31864 KB |
Output is correct |
7 |
Correct |
434 ms |
31884 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
219 ms |
39896 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
10956 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
8792 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |