oj.uz

Submission #1033333

# Submission time Handle Problem Language Result Execution time Memory
1033333 2024-07-24T16:34:58 Z VMaksimoski008 Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 1768 KB 
#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,bmi,bmi2,lzcnt,popcnt")


using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

signed main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n, q;
    cin >> n >> q;

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

    while(q--) {
        int x;
        cin >> x;
        for(int i=1; i<=n; i++) if(a[i] <= x) swap(a[i], b[i]);
    }

    ll ans = 0;
    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 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 476 KB Output is correct
11 Correct 1 ms 500 KB Output is correct
12 Correct 2 ms 464 KB Output is correct
13 Correct 2 ms 344 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 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 476 KB Output is correct
11 Correct 1 ms 500 KB Output is correct
12 Correct 2 ms 464 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 241 ms 604 KB Output is correct
15 Correct 916 ms 1116 KB Output is correct
16 Correct 2027 ms 1432 KB Output is correct
17 Execution timed out 3062 ms 1768 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 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 476 KB Output is correct
11 Correct 1 ms 500 KB Output is correct
12 Correct 2 ms 464 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 241 ms 604 KB Output is correct
15 Correct 916 ms 1116 KB Output is correct
16 Correct 2027 ms 1432 KB Output is correct
17 Execution timed out 3062 ms 1768 KB Time limit exceeded
18 Halted 0 ms 0 KB -