답안 #498978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498978 2021-12-26T21:22:14 Z inksamurai Preokret (COCI19_preokret) C++17
44 / 50
1 ms 316 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

int main(){
_3qplfh5;
	int n;
	cin>>n;
	vi cnt(2,0),cons(2,0);
	int vcons=0,tie=1;
	rep(i,n){
		int x;
		cin>>x;
		x--;
		cons[x]++;
		vcons=max(vcons,cons[x^1]);
		cons[x^1]=0;
		cnt[x]++;
		if(cnt[0]==cnt[1]) 
			tie++;
	}
	vcons=max({vcons,cons[0],cons[1]});
	cout<<cnt[0]<<" "<<cnt[1]<<"\n";
	cout<<tie<<"\n";
	cout<<vcons<<"\n";
//	
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 292 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Partially correct 0 ms 316 KB Output is partially correct
8 Correct 0 ms 308 KB Output is correct
9 Partially correct 0 ms 204 KB Output is partially correct
10 Correct 0 ms 204 KB Output is correct