oj.uz

Submission #228940

# Submission time Handle Problem Language Result Execution time Memory
228940 2020-05-03T06:25:50 Z NONAME Preokret (COCI18_preokret) C++17
50 / 50
 5 ms 512 KB 
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;

int n, res1, res2, cnt[2];
vector <pair <int, bool> > v;

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

//    in("input.txt");

    cin >> n;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        v.pb({x, 0});
    }

    cin >> n;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        v.pb({x, 1});
    }

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

    n = sz(v);

    for (int i = 0; i < n; i++) {
        int t = v[i].sd;

        if (v[i].ft <= 24 * 60)
            res1++;

        if (cnt[t] < cnt[t ^ 1] && cnt[t] + 2 > cnt[t ^ 1] && i + 1 < n && v[i + 1].sd == t)
            res2++;

        cnt[t]++;
    }

    cout << res1 << el << res2;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 308 KB Output is correct