# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46602 | 2018-04-22T08:24:49 Z | Talant | Boat (APIO16_boat) | C++17 | 2000 ms | 544 KB |
#include <bits/stdc++.h> #define mk make_pair #define sc second #define fr first #define pb emplace_back #define all(s) s.begin(), s.end() #define sz(s) ( (int)s.size() ) using namespace std; const int inf = (int)1e9 + 7; const int N = (int)2e5 + 7; int n; long long ans; long long a[N],b[N]; main () { cin >> n; for (int i = 1; i <= n; i ++) { cin >> a[i] >> b[i]; } for (int i = n; i >= 1; i --) { ans = (ans + (b[i] - a[i] + 1)) % inf; if (i == n) continue; for (int j = a[i]; j <= b[i]; j ++) { for (int l = i + 1; l <= n; l ++) { ans = (ans + max(b[l] - max(j*1ll + 1,a[l]) + 1,0ll)) % inf; } } } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2086 ms | 544 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |