# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
714125 | 2023-03-24T02:05:39 Z | mongla | Preokret (COCI18_preokret) | C++ | 1 ms | 340 KB |
#include<bits/stdc++.h> #define MAX 2880 using namespace std; int t1[MAX+5],t2[MAX+5]; int main(){ int a,b,x; cin>>a; for(int i=1;i<=a;i++) cin>>x,t1[x]++; cin>>b; for(int i=1;i<=b;i++) cin>>x,t2[x]++; int s1=0,s2=0,exceed=0,ans=0; char winner='\0'; for(int i=1;i<=MAX;i++){ if(t1[i]) s1++; if(t2[i]) s2++; ans=s1+s2; if(i==MAX/2) cout<<ans<<'\n'; if(s1>s2) if(winner=='B') exceed++; winner='A'; if(s1<s2) if(winner=='A') exceed++; winner='B'; } cout<<exceed; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 212 KB | Output is partially correct |
2 | Partially correct | 1 ms | 312 KB | Output is partially correct |
3 | Partially correct | 1 ms | 212 KB | Output is partially correct |
4 | Partially correct | 1 ms | 212 KB | Output is partially correct |
5 | Partially correct | 1 ms | 212 KB | Output is partially correct |
6 | Partially correct | 1 ms | 212 KB | Output is partially correct |
7 | Partially correct | 1 ms | 212 KB | Output is partially correct |
8 | Partially correct | 1 ms | 316 KB | Output is partially correct |
9 | Partially correct | 1 ms | 340 KB | Output is partially correct |
10 | Partially correct | 1 ms | 212 KB | Output is partially correct |