oj.uz

Submission #1063199

# Submission time Handle Problem Language Result Execution time Memory
1063199 2024-08-17T15:10:25 Z vjudge1 Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 3000 ms 3024 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

ll N, K;
vector<pair<ll, ll>> a;
vector<ll> b;

int main()
{
    cin >> N >> K;
    for (int i = 0; i < N; i++)
    {
        ll x, y;
        cin >> x >> y;
        a.pb({x, y});
    }
    for (int i = 0; i < K; i++)
    {
        ll temp;
        cin >> temp;
        b.pb(temp);
    }

    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < K; j++)
        {
            if (a[i].first <= b[j])
            {
                swap(a[i].first, a[i].second);
            }
        }
    }

    ll sum = 0;
    for (int i = 0; i < N; i++)
    {
        sum += a[i].first;
    }

    cout << sum;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 285 ms 792 KB Output is correct
15 Correct 1160 ms 1224 KB Output is correct
16 Correct 2549 ms 1392 KB Output is correct
17 Execution timed out 3062 ms 3024 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 285 ms 792 KB Output is correct
15 Correct 1160 ms 1224 KB Output is correct
16 Correct 2549 ms 1392 KB Output is correct
17 Execution timed out 3062 ms 3024 KB Time limit exceeded
18 Halted 0 ms 0 KB -