Submission #1534569
Source Code Expand
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
signed main() {
string s; cin >> s;
int cnt = 0, ans = 0;
rep(i,0,s.length()) {
if(cnt == 0) {
// g
if(s[i] == 'p') ans--, cnt++;
else cnt++;
}
else {
// p
if(s[i] == 'p') cnt--;
if(s[i] == 'g') cnt--, ans++;
}
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - AtCoDeer and Rock-Paper |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1442 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
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 |
4 ms |
512 KB |
1_003.txt |
AC |
3 ms |
384 KB |
1_004.txt |
AC |
5 ms |
512 KB |
1_005.txt |
AC |
3 ms |
384 KB |
1_006.txt |
AC |
5 ms |
512 KB |
1_007.txt |
AC |
1 ms |
256 KB |
1_008.txt |
AC |
5 ms |
512 KB |
1_009.txt |
AC |
5 ms |
512 KB |
1_010.txt |
AC |
5 ms |
512 KB |
1_011.txt |
AC |
3 ms |
384 KB |
1_012.txt |
AC |
5 ms |
512 KB |
1_013.txt |
AC |
2 ms |
256 KB |
1_014.txt |
AC |
5 ms |
512 KB |
1_015.txt |
AC |
4 ms |
512 KB |
1_016.txt |
AC |
5 ms |
512 KB |
1_017.txt |
AC |
4 ms |
512 KB |
1_018.txt |
AC |
5 ms |
512 KB |
1_019.txt |
AC |
1 ms |
256 KB |
1_020.txt |
AC |
5 ms |
512 KB |
1_021.txt |
AC |
4 ms |
512 KB |
1_022.txt |
AC |
4 ms |
512 KB |
1_023.txt |
AC |
4 ms |
512 KB |
1_024.txt |
AC |
5 ms |
512 KB |