oj.uz

Submission #234648

# Submission time Handle Problem Language Result Execution time Memory
234648 2020-05-25T01:52:22 Z super_j6 Preokret (COCI18_preokret) C++14
50 / 50
 5 ms 384 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int n = 4 * 12 * 60;
int a[n];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	for(int t = 0; t < 2; t++){
	    int m;
	    cin >> m;
	    for(int i = 0; i < m; i++){
	        int x;
	        cin >> x;
	        x--;
	        a[x] += 2 * t - 1;
	    }
	}
	
	int ret1 = 0, ret2 = 0;
	for(int i = 0, j = 0, l = -1; i < n; i++){
	    if(!!a[i]){
	        ret1 += (i < n / 2);
	        if(!j){
	            ret2 += l != -1 && l != (a[i] > 0);
	            l = a[i] > 0;
	        }
	        j += a[i];
	    }
	}
	
	cout << ret1 << endl;
	cout << ret2 << endl;

	return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 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 384 KB Output is correct