oj.uz

Submission #824681

# Submission time Handle Problem Language Result Execution time Memory
824681 2023-08-14T08:45:07 Z Koyote Fortune Telling 2 (JOI14_fortune_telling2) C++14
4 / 100
 3000 ms 1900 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, k; cin >> n >> k;
    int a[n], b[n];
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
    int t[k];
    for (int i = 0; i < k; i++) cin >> t[i];
    for (int i = 0; i < n; i++)
        for (int j = 0; j < k; j++)
            if (a[i] <= t[j]) swap(a[i], b[i]);
    cout << accumulate(a, a + n, 0LL) << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 372 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 372 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 296 ms 708 KB Output is correct
15 Correct 1176 ms 1112 KB Output is correct
16 Correct 2581 ms 1524 KB Output is correct
17 Execution timed out 3076 ms 1900 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 340 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 372 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 296 ms 708 KB Output is correct
15 Correct 1176 ms 1112 KB Output is correct
16 Correct 2581 ms 1524 KB Output is correct
17 Execution timed out 3076 ms 1900 KB Time limit exceeded
18 Halted 0 ms 0 KB -