Submission #1147285

#TimeUsernameProblemLanguageResultExecution timeMemory
1147285FZ_LaabidiCircle Passing (EGOI24_circlepassing)C++20
0 / 100
101 ms3320 KiB
#include <bits/stdc++.h> #define int long long using namespace std; int n, m, q; signed main() { cin >> n >> m >> q; vector<int> k(m); for (int i=0; i<m; i++)cin >> k[i]; for (int i=0; i<q; i++) { int x, y; cin >> x >> y; int d = min(abs(x-y), abs(x+2*n-y)); int de=1; if (x>n)de += abs(x-n-y); else de += abs(x+n-y); cout << min(de, d)<< endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...