oj.uz

답안 #166931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166931 2019-12-04T16:33:26 Z muhi1112 Preokret (COCI18_preokret) C++17
21.2 / 50
 2 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;

#define f1 first
#define s2 second
#define mp make_pair
#define pb push_back
#define ll long long 
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=3e4+5;

bool cnt1[N],cnt2[N];
int ans1,ans2,n,a,x,y;
bool flag=0;

int main(){
//	fri("in.txt");
//	fro("out.txt");
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a;
		if(a<=1440)ans1++;
		cnt1[a]=1;
	}
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a;
		if(a<=1440)ans1++;
		cnt2[a]=1;
	}
	for(int i=0;i<=2880;i++){
		if(cnt1[i]==1){
			x++;
		}
		else if(cnt2[i]==1)y++;
		if(x>y && flag==0){
			ans2++;
			flag=1;
		}
		if(y>x && flag==1){
			ans2++;
			flag=0;
		}
	}
	cout<<ans1<<endl;
	cout<<ans2-1<<endl;
	return 0;
}

Subtask #1
21.2 / 50.0

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