# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
267717 | kkm0476 | Strange Device (APIO19_strange_device) | C++98 | 3453 ms | 263916 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int n, A, B;
vector<pair<int, int> > v;
int main() {
scanf("%d %d %d", &n, &A, &B);
for(int i = 0; i < n; i++) {
int l, r;
scanf("%d %d", &l, &r);
for(int t = l; t <= r; t++) {
int x = (t + (int)((double)t / B)) % A;
int y = t % B;
v.push_back({x, y});
}
}
int ret = 0;
sort(v.begin(), v.end());
for(int i = 0; i < v.size(); i++) {
if(i == 0)
ret++;
else if(v[i].first != v[i - 1].first || v[i].second != v[i - 1].second)
ret++;
}
printf("%d", ret);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |