oj.uz

답안 #176082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
176082 2020-01-07T20:38:31 Z Doda Preokret (COCI18_preokret) C++14
11.6 / 50
 2 ms 376 KB 
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;

long long a,b,as[3000],bs[3000],pp,najma=5000,najb=5000,pr,preokret,vodi,pv;

int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);

cin >> a;

for (int i = 1;i<=a;i++){
	long long r;
	cin >> r;
	as[r] = 1;
	if (r<1441)
		pp++;
	if (najma>r)
		najma = r;
}

cin >> b; 


for (int i = 1;i<=b;i++){
	long long r;
	cin >> r;
	bs[r] = 1;
	if (r<1441)
		pp++;
	if (najb>r)
		najb = r;
}

long long najm;
if (najma>najb)
	najm = b;
else
	najm = a;

for (int i = najm;i<=2880;i++){
	if (as[i] != 0 || bs[i] != 0){
		if (as[i] == 1)
			pr++;
		if (bs[i] == 1)
			pr--;
		if (pr == 1)
			vodi = 1;
		if (pr == -1)
			vodi = -1;
		if (pv != vodi)
			preokret++;
		pv = vodi;	
	}
}

cout << pp << endl << preokret-1;

return 0;
}

Subtask #1
11.6 / 50.0

# 결과 실행 시간 메모리 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 Correct 2 ms 376 KB Output is correct
6 Partially correct 2 ms 376 KB Output is partially correct
7 Partially correct 2 ms 376 KB Output is partially correct
8 Partially correct 2 ms 376 KB Output is partially correct
9 Partially correct 2 ms 376 KB Output is partially correct
10 Correct 2 ms 376 KB Output is correct