Submission #1331002


Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	string str;
	cin >> str;
	int size = str.size();
	int ans = 0;//最小値
	int G = 0;
	int P = 0;
	for(int i=0;i<size;++i){
		if( P+1 <= G ){
			//Pだす
			++P;
			if( str[i] == 'g' ){
				ans += 1;
			}
		}else{//gだす
			++G;
			if( str[i] == 'p' ){
				ans -= 1;
			}
		}
	}
	cout << ans << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Submission Time
Task D - AtCoDeer and Rock-Paper
User akarin55
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1523 Byte
Status AC
Exec Time 2 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 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
1_002.txt AC 2 ms 512 KB
1_003.txt AC 1 ms 384 KB
1_004.txt AC 2 ms 512 KB
1_005.txt AC 1 ms 384 KB
1_006.txt AC 2 ms 512 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 2 ms 512 KB
1_009.txt AC 2 ms 512 KB
1_010.txt AC 2 ms 512 KB
1_011.txt AC 1 ms 384 KB
1_012.txt AC 2 ms 512 KB
1_013.txt AC 1 ms 256 KB
1_014.txt AC 2 ms 512 KB
1_015.txt AC 1 ms 384 KB
1_016.txt AC 2 ms 512 KB
1_017.txt AC 1 ms 384 KB
1_018.txt AC 2 ms 512 KB
1_019.txt AC 1 ms 256 KB
1_020.txt AC 2 ms 512 KB
1_021.txt AC 1 ms 384 KB
1_022.txt AC 2 ms 512 KB
1_023.txt AC 1 ms 384 KB
1_024.txt AC 2 ms 512 KB