oj.uz

Submission #1063141

# Submission time Handle Problem Language Result Execution time Memory
1063141 2024-08-17T14:37:43 Z vjudge1 Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 2780 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef pair<char, ll> ci;
typedef pair<string, ll> si;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
#define pb push_back
#define fi first
#define se second
#define whole(v) v.begin(), v.end()
#define rwhole(v) v.rbegin(), v.rend()
#define inf INT_MAX/2
#define fro front

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n, k; cin >> n >> k;
    vector<ii> x(n);
    for(ll i = 0; i < n; ++i){
        cin >> x[i].fi >> x[i].se;
    }
    vector<ll> que;
    for(ll i = 0; i < k; ++i){
        ll a; cin >> a;
        que.pb(a);
    }
    for(auto e:que){
        for(ll i = 0; i < n; ++i){
            if(x[i].fi <= e){
                swap(x[i].fi, x[i].se);
            }
        }
    }
    ll cnt = 0;
    for(auto e:x){
        cnt += e.fi;
    }
    cout << cnt << endl;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 476 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 524 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 248 ms 1116 KB Output is correct
15 Correct 963 ms 1644 KB Output is correct
16 Correct 2123 ms 2156 KB Output is correct
17 Execution timed out 3027 ms 2780 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 3 ms 476 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 524 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 248 ms 1116 KB Output is correct
15 Correct 963 ms 1644 KB Output is correct
16 Correct 2123 ms 2156 KB Output is correct
17 Execution timed out 3027 ms 2780 KB Time limit exceeded
18 Halted 0 ms 0 KB -