oj.uz

Submission #156976

# Submission time Handle Problem Language Result Execution time Memory
156976 2019-10-08T17:18:47 Z dcj Preokret (COCI18_preokret) C++14
2 / 50
 3 ms 376 KB 
#include <iostream>

using namespace std;


int main()
{
	int Ap[2880]={0} , Bp[2880]={0};
    int	A, B, s, pv=0, P=0, x=0, as, bs;
    cin >> A;
    cin >> as;
    Ap[as-1]=1;
    if (as<=1440)
    	pv++;
    for (int i=1;i<A;i++) {
    	cin >> s;
    	if (s<=1440)
    		pv++;
    	Ap[s-1]=1;
	}
	cin >> B;
	cin >> bs;
	Bp[bs-1]=1;
	if(bs<=1440)
		pv++;
	for (int i=1;i<B;i++) {
		cin >> s;
    	if (s<=1440)
    		pv++;
    	Bp[s-1]=1;
	}
	if (as<bs)
		x=1;
	else
		x=2;
	
	cout << pv << "\n";
	for (int i=0;i<=2879;i++) {
		if (Ap[i]==1)
			A--;
		if (Bp[i] ==1)
			B--;
		if (A<B and x==2) {
			P++;
			x=1;
		}
		if (B<A and x==1) {
			P++;
			x=2;
		}
	}
	cout << P;
		

	return 0;
}

Subtask #1
2.0 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 376 KB Output is partially correct
2 Partially correct 2 ms 376 KB Output is partially correct
3 Partially correct 2 ms 376 KB Output is partially correct
4 Partially correct 2 ms 376 KB Output is partially correct
5 Partially correct 2 ms 376 KB Output is partially correct
6 Partially correct 2 ms 376 KB Output is partially correct
7 Partially correct 3 ms 376 KB Output is partially correct
8 Partially correct 3 ms 376 KB Output is partially correct
9 Partially correct 3 ms 376 KB Output is partially correct
10 Partially correct 2 ms 376 KB Output is partially correct