Submission #1249750

#TimeUsernameProblemLanguageResultExecution timeMemory
1249750khanghoStrange Device (APIO19_strange_device)C++17
0 / 100
5094 ms5536 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<int>> arr_ans;
  for (int i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    for (long long j = l; j <= r; j++) {
      int y = j % B;
      int x = ( j + (j - y)/B ) % A;
      vector<int> 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...