Submission #267647

#TimeUsernameProblemLanguageResultExecution timeMemory
267647blueStrange Device (APIO19_strange_device)C++11
10 / 100
5091 ms524292 KiB
#include <iostream> #include <set> using namespace std; struct duo { long long x; long long y; }; bool operator < (duo A, duo B) { if(A.x == B.x) return A.y < B.y; return A.x < B.x; } int main() { long long n, A, B; cin >> n >> A >> B; long long l[n+1], r[n+1]; for(int i = 1; i <= n; i++) cin >> l[i] >> r[i]; set<duo> S; for(int i = 1; i <= n; i++) for(long long t = l[i]; t <= r[i]; t++) S.insert(duo{(t + (t/B)) % A, t % B}); cout << S.size() << '\n'; return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...