Submission #1062150

Source Code Expand

#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <fstream>
#include <string>
#include <sstream>
#include <math.h>
#include <set>
#include <map>
using namespace std;
#define rep(i,n) for(int i = 0; i < n ; i++)
#define pb push_back
static const int INF = 1000000;

typedef pair<int, int> P;
typedef pair<P, int> PP;

int main(void){
  string s; cin >> s;
  int p_cnt = 0;
  rep(i,s.size()){
    if(s[i] == 'p') p_cnt += 1;
  }

  cout << s.size() / 2 - p_cnt << endl;

  return 0;
}

Submission Info

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

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 KiB
0_001.txt AC 3 ms 256 KiB
1_002.txt AC 6 ms 512 KiB
1_003.txt AC 4 ms 384 KiB
1_004.txt AC 6 ms 512 KiB
1_005.txt AC 4 ms 384 KiB
1_006.txt AC 6 ms 512 KiB
1_007.txt AC 3 ms 256 KiB
1_008.txt AC 6 ms 512 KiB
1_009.txt AC 6 ms 512 KiB
1_010.txt AC 6 ms 512 KiB
1_011.txt AC 4 ms 384 KiB
1_012.txt AC 6 ms 512 KiB
1_013.txt AC 3 ms 256 KiB
1_014.txt AC 6 ms 512 KiB
1_015.txt AC 5 ms 384 KiB
1_016.txt AC 6 ms 512 KiB
1_017.txt AC 6 ms 512 KiB
1_018.txt AC 6 ms 512 KiB
1_019.txt AC 3 ms 256 KiB
1_020.txt AC 6 ms 512 KiB
1_021.txt AC 5 ms 512 KiB
1_022.txt AC 6 ms 512 KiB
1_023.txt AC 6 ms 512 KiB
1_024.txt AC 6 ms 512 KiB