Submission #1168123

#TimeUsernameProblemLanguageResultExecution timeMemory
1168123PlayVoltzCircle Passing (EGOI24_circlepassing)C++20
100 / 100
843 ms141528 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, q, a, b; cin>>n>>m>>q; set<int> s; while (m--)cin>>a, s.insert(a-n), s.insert(a-2*n), s.insert(a), s.insert(a+n), s.insert(a+2*n), s.insert(a+3*n); while (q--){ cin>>a>>b; if (a>b)b+=2*n; int ans=min(b-a, a-b+2*n); auto it=s.lower_bound(a); ans=min(ans, abs(*it+n-b)+abs(*it-a)+1); --it; ans=min(ans, abs(*it+n-b)+abs(*it-a)+1); cout<<ans<<"\n"; } }
#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...