Submission #1147294

#TimeUsernameProblemLanguageResultExecution timeMemory
1147294FZ_LaabidiCircle Passing (EGOI24_circlepassing)C++20
14 / 100
101 ms3300 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; // cout << abs(x-y)<< " "<< 2*n-abs(x-y)<< endl; int d = min(abs(x-y), 2*n-abs(x-y)); int mo; if (x>n)mo =x-n; else mo = x+n; int de = 1+min(abs(mo-y), abs(mo-2*n-y)); // cout << de <<" "<<d<< endl; 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...