oj.uz

Submission #555722

# Submission time Handle Problem Language Result Execution time Memory
555722 2022-05-01T11:55:08 Z Jarif_Rahman Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 1884 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

#ifdef LOCAL
#define debug(s) for(auto x: s) cerr << x << " "; cerr << #s << "\n";
#endif

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, k; cin >> n >> k;

    vector<ll> A(n), B(n);
    vector<pair<ll, int>> T(k);

    for(int i = 0; i < n; i++) cin >> A[i] >> B[i];
    for(int i = 0; i < k; i++) cin >> T[i].f, T[i].sc = i;

    sort(T.begin(), T.end());

    ll ans = 0;

    for(int i = 0; i < n; i++){
        auto it2 = lower_bound(T.begin(), T.end(), make_pair(max(A[i], B[i]), -1));
        auto it1 = lower_bound(T.begin(), T.end(), make_pair(min(A[i], B[i]), -1));
        vector<int> ss;
        for(auto it = it2; it != T.end(); it++) ss.pb(it->sc);
        sort(ss.begin(), ss.end());
        int ls = -1;
        for(auto it = it1; it != it2; it++){
            ls = max(ls, it->sc);
        }

        if(ls == -1) ans+=int(ss.size())%2? B[i]:A[i];
        else
            ans+=(ss.end()-lower_bound(ss.begin(), ss.end(), ls))%2?min(A[i], B[i]):max(A[i], B[i]);
    }

    cout << ans << "\n";
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 8 ms 368 KB Output is correct
3 Correct 16 ms 340 KB Output is correct
4 Correct 16 ms 340 KB Output is correct
5 Correct 17 ms 340 KB Output is correct
6 Correct 14 ms 340 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 17 ms 340 KB Output is correct
11 Correct 26 ms 332 KB Output is correct
12 Correct 25 ms 340 KB Output is correct
13 Correct 25 ms 452 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 8 ms 368 KB Output is correct
3 Correct 16 ms 340 KB Output is correct
4 Correct 16 ms 340 KB Output is correct
5 Correct 17 ms 340 KB Output is correct
6 Correct 14 ms 340 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 17 ms 340 KB Output is correct
11 Correct 26 ms 332 KB Output is correct
12 Correct 25 ms 340 KB Output is correct
13 Correct 25 ms 452 KB Output is correct
14 Correct 1873 ms 1024 KB Output is correct
15 Execution timed out 3048 ms 1884 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 8 ms 368 KB Output is correct
3 Correct 16 ms 340 KB Output is correct
4 Correct 16 ms 340 KB Output is correct
5 Correct 17 ms 340 KB Output is correct
6 Correct 14 ms 340 KB Output is correct
7 Correct 23 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 17 ms 340 KB Output is correct
11 Correct 26 ms 332 KB Output is correct
12 Correct 25 ms 340 KB Output is correct
13 Correct 25 ms 452 KB Output is correct
14 Correct 1873 ms 1024 KB Output is correct
15 Execution timed out 3048 ms 1884 KB Time limit exceeded
16 Halted 0 ms 0 KB -