# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317791 | 2020-10-30T11:37:41 Z | tjdgus4384 | Strange Device (APIO19_strange_device) | C++14 | 57 ms | 4108 KB |
#include<bits/stdc++.h> using namespace std; long long A, B, l[100001], r[100001]; vector<pair<long long, long long> > v; int n; int main(){ scanf("%d %lld %lld", &n, &A, &B); for(int i = 0;i < n;i++){ scanf("%lld %lld", &l[i], &r[i]); } long long g = __gcd((B+1)%A, A), t; bool chk = false; if(log10(A/g) + log10(B) > 18.7) chk = true; else t = (A/g) * B; for(int i = 0;i < n;i++){ if(chk){ v.push_back({l[i], r[i]}); continue; } if((r[i] - l[i] + 1) >= t){ printf("%lld", t); return 0; } l[i] %= t; r[i] %= t; if(r[i] < l[i]){ v.push_back({l[i], t-1}); v.push_back({0, r[i]}); } else v.push_back({l[i], r[i]}); } sort(v.begin(), v.end()); long long s = v[0].first, e = v[0].second, ans = 0; for(int i = 1;i < v.size();i++){ if(v[i].first <= e) e = max(e, v[i].second); else{ ans += (e-s+1); s = v[i].first; e = v[i].second; } } ans += e-s+1; printf("%lld", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 6 ms | 896 KB | Output is correct |
3 | Correct | 6 ms | 896 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 0 ms | 256 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 512 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 0 ms | 256 KB | Output is correct |
11 | Correct | 0 ms | 256 KB | Output is correct |
12 | Correct | 0 ms | 256 KB | Output is correct |
13 | Correct | 1 ms | 384 KB | Output is correct |
14 | Correct | 0 ms | 256 KB | Output is correct |
15 | Correct | 1 ms | 384 KB | Output is correct |
16 | Correct | 6 ms | 896 KB | Output is correct |
17 | Correct | 57 ms | 4076 KB | Output is correct |
18 | Correct | 0 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Execution timed out | 39 ms | 1912 KB | Time limit exceeded (wall clock) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Execution timed out | 44 ms | 1912 KB | Time limit exceeded (wall clock) |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Execution timed out | 44 ms | 1912 KB | Time limit exceeded (wall clock) |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Execution timed out | 44 ms | 1912 KB | Time limit exceeded (wall clock) |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 57 ms | 4076 KB | Output is correct |
3 | Correct | 54 ms | 4108 KB | Output is correct |
4 | Execution timed out | 46 ms | 1912 KB | Time limit exceeded (wall clock) |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 6 ms | 896 KB | Output is correct |
3 | Correct | 6 ms | 896 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 0 ms | 256 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 512 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 0 ms | 256 KB | Output is correct |
11 | Correct | 0 ms | 256 KB | Output is correct |
12 | Correct | 0 ms | 256 KB | Output is correct |
13 | Correct | 1 ms | 384 KB | Output is correct |
14 | Correct | 0 ms | 256 KB | Output is correct |
15 | Correct | 1 ms | 384 KB | Output is correct |
16 | Correct | 6 ms | 896 KB | Output is correct |
17 | Correct | 57 ms | 4076 KB | Output is correct |
18 | Correct | 0 ms | 384 KB | Output is correct |
19 | Correct | 0 ms | 256 KB | Output is correct |
20 | Correct | 0 ms | 256 KB | Output is correct |
21 | Correct | 0 ms | 256 KB | Output is correct |
22 | Correct | 1 ms | 384 KB | Output is correct |
23 | Correct | 0 ms | 256 KB | Output is correct |
24 | Correct | 1 ms | 256 KB | Output is correct |
25 | Correct | 1 ms | 384 KB | Output is correct |
26 | Correct | 1 ms | 384 KB | Output is correct |
27 | Correct | 1 ms | 384 KB | Output is correct |
28 | Execution timed out | 39 ms | 1912 KB | Time limit exceeded (wall clock) |