# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728479 | 2023-04-22T13:34:06 Z | nguyentunglam | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 3000 ms | 1852 KB |
#include<bits/stdc++.h> #define fi first #define se second #define endl "\n" #define ii pair<int, int> using namespace std; const int N = 2e5 + 10; int a[2][N], t[N]; int main() { #define task "" cin.tie(0) -> sync_with_stdio(0); if (fopen ("task.inp", "r")) { freopen ("task.inp", "r", stdin); freopen ("task.out", "w", stdout); } if (fopen (task".inp", "r")) { freopen (task".inp", "r", stdin); freopen (task".out", "w", stdout); } int n, k; cin >> n >> k; for(int i = 1; i <= n; i++) cin >> a[0][i] >> a[1][i]; for(int i = 1; i <= k; i++) cin >> t[i]; long long res = 0; for(int i = 1; i <= n; i++) { int type = 0; for(int j = 1; j <= k; j++) if (a[type][i] <= t[j]) type ^= 1; res += a[type][i]; } cout << res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 3 ms | 340 KB | Output is correct |
3 | Correct | 5 ms | 340 KB | Output is correct |
4 | Correct | 4 ms | 340 KB | Output is correct |
5 | Correct | 4 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 340 KB | Output is correct |
7 | Correct | 4 ms | 340 KB | Output is correct |
8 | Correct | 2 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 3 ms | 340 KB | Output is correct |
11 | Correct | 4 ms | 340 KB | Output is correct |
12 | Correct | 3 ms | 340 KB | Output is correct |
13 | Correct | 4 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 3 ms | 340 KB | Output is correct |
3 | Correct | 5 ms | 340 KB | Output is correct |
4 | Correct | 4 ms | 340 KB | Output is correct |
5 | Correct | 4 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 340 KB | Output is correct |
7 | Correct | 4 ms | 340 KB | Output is correct |
8 | Correct | 2 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 3 ms | 340 KB | Output is correct |
11 | Correct | 4 ms | 340 KB | Output is correct |
12 | Correct | 3 ms | 340 KB | Output is correct |
13 | Correct | 4 ms | 344 KB | Output is correct |
14 | Correct | 320 ms | 728 KB | Output is correct |
15 | Correct | 1315 ms | 1140 KB | Output is correct |
16 | Correct | 2790 ms | 1624 KB | Output is correct |
17 | Execution timed out | 3040 ms | 1852 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 3 ms | 340 KB | Output is correct |
3 | Correct | 5 ms | 340 KB | Output is correct |
4 | Correct | 4 ms | 340 KB | Output is correct |
5 | Correct | 4 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 340 KB | Output is correct |
7 | Correct | 4 ms | 340 KB | Output is correct |
8 | Correct | 2 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 3 ms | 340 KB | Output is correct |
11 | Correct | 4 ms | 340 KB | Output is correct |
12 | Correct | 3 ms | 340 KB | Output is correct |
13 | Correct | 4 ms | 344 KB | Output is correct |
14 | Correct | 320 ms | 728 KB | Output is correct |
15 | Correct | 1315 ms | 1140 KB | Output is correct |
16 | Correct | 2790 ms | 1624 KB | Output is correct |
17 | Execution timed out | 3040 ms | 1852 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |