oj.uz

답안 #305121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305121 2020-09-22T15:38:03 Z phathnv Preokret (COCI18_preokret) C++11
50 / 50
 1 ms 384 KB 
#include <bits/stdc++.h>

#define mp make_pair
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef pair <int, int> ii;

const int N = 3000;

int a, b;
int dif[N];

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

    int points = 0, turnarounds = 0;

    cin >> a;
    for(int i = 1; i <= a; i++){
        int x;
        cin >> x;
        dif[x]++;
        if (x <= 1440)
            points++;
    }
    cin >> b;
    for(int i = 1; i <= b; i++){
        int x;
        cin >> x;
        dif[x]--;
        if (x <= 1440)
            points++;
    }

    for(int i = 1; i <= 2880; i++)
        dif[i] += dif[i - 1];

    int pre = 0, cur = 0;
    while (cur < 2880){
        int nxt = cur;
        while (dif[nxt] == dif[cur] && nxt <= 2880)
            nxt++;
        if (nxt > 2880)
            break;

        if (dif[pre] * dif[nxt] == -1)
            turnarounds++;

        pre = cur;
        cur = nxt;
    }

    cout << points << endl << turnarounds << endl;

    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct