oj.uz

Submission #1084907

# Submission time Handle Problem Language Result Execution time Memory
1084907 2024-09-07T08:07:50 Z pemguimn Fortune Telling 2 (JOI14_fortune_telling2) C++14
4 / 100
 3000 ms 1884 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
int n, k, a[N], b[N], t[N];
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    for(int i = 1; i <= k; i++) cin >> t[i];

    long long ans = 0;
    for(int i = 1; i <= k; i++){
        for(int j = 1; j <= n; j++){
            if(a[j] <= t[i]) swap(a[j], b[j]);
        }
    }

    for(int i = 1; i <= n; i++) ans += a[i];
    cout << ans << '\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 232 ms 856 KB Output is correct
15 Correct 941 ms 1116 KB Output is correct
16 Correct 2129 ms 1680 KB Output is correct
17 Execution timed out 3071 ms 1884 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 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 232 ms 856 KB Output is correct
15 Correct 941 ms 1116 KB Output is correct
16 Correct 2129 ms 1680 KB Output is correct
17 Execution timed out 3071 ms 1884 KB Time limit exceeded
18 Halted 0 ms 0 KB -