Submission #1249756

#TimeUsernameProblemLanguageResultExecution timeMemory
1249756khanghoStrange Device (APIO19_strange_device)C++17
0 / 100
5094 ms5540 KiB
#include <iostream> #include <cmath> #include <vector> #include <algorithm> using namespace std; int main() { int n; long long A, B; cin >> n >> A >> B; int ans = 0; vector<vector<long>> arr_ans; for (int i = 0; i < n; i++) { long long l, r; cin >> l >> r; for (long long j = l; j <= r; j++) { long y = j % B; long x = (j + j/B) % A; vector<long> tmp = {x, y}; if (find(arr_ans.begin(), arr_ans.end(), tmp) == arr_ans.end()) { ans++; arr_ans.push_back(tmp); } } } cout << ans; 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...