Submission #928738


Source Code Expand

#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
typedef long long ll;
typedef double ld;
const ld eps = 1e-7;
#define sqr(x) (x)*(x)
#define sz(x) ((x).size())
#define TASK ""
const ll MOD = 2999999989LL;
const ll BASE = 43;
#define hash hrescgwx

int run() {
    string s;
    cin >> s;
    ll ans = 0;
    ll have = 0;
    for (int i = 0; i < s.size(); ++i) {
        if (s[i] == 'g' && have != 0) {
            have--;
            ans++;
        } else if (s[i] == 'p' && have == 0) {
            have++;
            ans--;
        } else if (s[i] == 'p' && have != 0) {
            have--;
        } else {
            have++;
        }
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    if(strlen(TASK)!=0)
    {
        freopen(TASK".in", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
#endif
    run();
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:120:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
         freopen(TASK".in", "r", stdin);
                                       ^
./Main.cpp:121:41: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
         freopen(TASK".out", "w", stdout);
                                         ^

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