oj.uz

답안 #143013

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143013 2019-08-12T15:08:53 Z MladenP Worst Reporter 2 (JOI16_worst_reporter2) C++17
0 / 100
 2 ms 504 KB 
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 200010
int N, A[MAXN], B[MAXN], C[MAXN], D[MAXN], rez, cnt[MAXN];
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
    cin >> N;
    for(int i = 1; i <= N; i++) {
        cin >> A[i] >> B[i];
    }
    for(int i = 1; i <= N; i++) {
        cin >> C[i] >> D[i];
    }
    int idx = 1;
    for(int i = 1; i <= N; i++) {
        while(idx <= N && D[idx] >= B[i]) {
            cnt[C[idx]]++;
            idx++;
        }
        if(cnt[A[i]] == 0) rez++;
        else cnt[A[i]]--;
    }
    cout << rez;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -