oj.uz

Submission #1063160

# Submission time Handle Problem Language Result Execution time Memory
1063160 2024-08-17T14:45:23 Z vjudge1 Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 2064 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);
    }
    int arr[n];
    memset(arr, 0, sizeof arr);
    for(auto e:que){
        for(int i = 0; i < n; ++i){
            if(arr[i] % 2 == 0){
                if(x[i].fi <= e){
                    arr[i]++;
                }
            }else{
                if(x[i].se <= e){
                    arr[i]++;
                }
            }
        }
    }
    ll cnt = 0;
    for(int i = 0; i < n; ++i){
        if(arr[i] % 2 == 0){
            cnt += x[i].fi;
        }else{
            cnt += x[i].se;
        }
    }
    cout << cnt << endl;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 7 ms 520 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 6 ms 464 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 7 ms 520 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 610 ms 1360 KB Output is correct
15 Correct 2450 ms 1640 KB Output is correct
16 Execution timed out 3053 ms 2064 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 7 ms 520 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 6 ms 464 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 7 ms 520 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 610 ms 1360 KB Output is correct
15 Correct 2450 ms 1640 KB Output is correct
16 Execution timed out 3053 ms 2064 KB Time limit exceeded
17 Halted 0 ms 0 KB -