Submission #1287510

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287510		dang_hai_long	Fortune Telling 2 (JOI14_fortune_telling2)	C++20	0 / 100	1 ms	332 KiB

fortune_telling2

#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    vector<long long> A(N), B(N);
    for (int i = 0; i < N; ++i) cin >> A[i] >> B[i];

    vector<long long> T(K);
    for (int j = 0; j < K; ++j) cin >> T[j];
    sort(T.begin(), T.end());

    long long ans = 0;
    for (int i = 0; i < N; ++i) {
        long long lo = min(A[i], B[i]);
        long long hi = max(A[i], B[i]);
        int cnt = upper_bound(T.begin(), T.end(), hi) -
                  lower_bound(T.begin(), T.end(), lo);
        if (cnt % 2 == 0) ans += A[i];
        else ans += B[i];
    }
    cout << ans << "\n";
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65