Submission #563112

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int main(){
cin.tie(0);
ios::sync_with_stdio(false);
	int n;cin>>n;
	string s;cin>>s;
	int cnt[2];
	cnt[0]=cnt[1]=0;
	for(int i=0;i+1<2*n;){
		if(s[i] != s[i+1]) i+=2;
		else{
			i++;
			cnt[s[i]-'0']++;

		}
	}
	cout<<max(cnt[0],cnt[1])<<endl;
}

Submission Info

Submission Time
Task C - 寿司タワー
User ish_774
Language C++ (GCC 4.9.2)
Score 100
Code Size 841 Byte
Status AC
Exec Time 28 ms
Memory 928 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 18
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt
Case Name Status Exec Time Memory
01-01.txt AC 25 ms 816 KiB
01-02.txt AC 24 ms 800 KiB
01-03.txt AC 28 ms 796 KiB
01-04.txt AC 24 ms 916 KiB
01-05.txt AC 25 ms 796 KiB
01-06.txt AC 28 ms 800 KiB
01-07.txt AC 24 ms 800 KiB
01-08.txt AC 24 ms 808 KiB
01-09.txt AC 23 ms 928 KiB
01-10.txt AC 24 ms 928 KiB
01-11.txt AC 23 ms 928 KiB
01-12.txt AC 26 ms 928 KiB
01-13.txt AC 23 ms 924 KiB
01-14.txt AC 23 ms 800 KiB
01-15.txt AC 24 ms 804 KiB
01-16.txt AC 24 ms 924 KiB
sample-01.txt AC 26 ms 808 KiB
sample-02.txt AC 26 ms 804 KiB