Submission #928740


Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for(ut i=(a);i<(ut)(b);i++)
#define REP(i,b) FOR(i,0,b)
#define ALL(c) c.begin(),c.end()
#define PB push_back
#define cat cout << __LINE__ << endl;
using namespace std;
typedef long long LL;
typedef double ld;
typedef int ut;
typedef complex<int> cli;
typedef vector<ut> VI;
typedef pair<ut,ut> pr;
typedef pair<ut,pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<pr,Vpr> PQ;
const int INF=1<<30;

int main(){
	string s;
	cin >> s;
	int n=0;
	REP(i,s.size()){
		if(s[i]=='p') n++;
	}
	cout << s.size()/2-n << endl;
	return 0;
}

Submission Info

Submission Time
Task D - AtCoDeer and Rock-Paper
User reew2n
Language C++14 (GCC 5.4.1)
Score 300
Code Size 632 Byte
Status AC
Exec Time 6 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 25
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt
Case Name Status Exec Time Memory
0_000.txt AC 3 ms 256 KB
0_001.txt AC 3 ms 256 KB
1_002.txt AC 6 ms 512 KB
1_003.txt AC 4 ms 384 KB
1_004.txt AC 6 ms 512 KB
1_005.txt AC 4 ms 384 KB
1_006.txt AC 6 ms 512 KB
1_007.txt AC 3 ms 256 KB
1_008.txt AC 6 ms 512 KB
1_009.txt AC 6 ms 512 KB
1_010.txt AC 6 ms 512 KB
1_011.txt AC 4 ms 384 KB
1_012.txt AC 6 ms 512 KB
1_013.txt AC 3 ms 256 KB
1_014.txt AC 6 ms 512 KB
1_015.txt AC 5 ms 384 KB
1_016.txt AC 6 ms 512 KB
1_017.txt AC 6 ms 512 KB
1_018.txt AC 6 ms 512 KB
1_019.txt AC 3 ms 256 KB
1_020.txt AC 6 ms 512 KB
1_021.txt AC 5 ms 512 KB
1_022.txt AC 6 ms 512 KB
1_023.txt AC 6 ms 512 KB
1_024.txt AC 6 ms 512 KB