Submission #1063160

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063160		vjudge1	Fortune Telling 2 (JOI14_fortune_telling2)	C++17	4 / 100	3053 ms	2064 KiB

fortune_telling2

#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 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65