提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
115003	2023-10-25 09:50:39	arad	F	cpp	18/18	AC	33

#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        while (N % a == 0) {
            ++ex;
            N /= a;
        }

        res.push_back({a, ex});
    }

    if (N != 1) res.push_back({N, 1});
    return res;
}

int main(){
    ll q;
    cin >> q;
    map<string,ll> mp;
    queue<string> que;
    rep(qi,q){
        ll t;
        cin >> t;
        if(t == 1){
            string s;
            cin >> s;
            mp[s]++;
            que.push(s);
        } else {
            if(que.empty()){
                out("何もなくてごめんね");
            } else {
                string s = que.front();
                string ans = s;
                que.pop();
                if(sz(mp)==1){
                    ans += "しかなかったんだけどいいかな";
                } else {
                    ans += "だけどいいかな";
                }
                mp[s]--;
                if(mp[s] == 0) mp.erase(s);
                out(ans);
            }
        }
    }
    out(sz(que));
}

sample1.txt AC 2
sample2.txt AC 2
sample3.txt AC 3
case1.txt AC 33
case2.txt AC 2
case3.txt AC 18
case4.txt AC 18
case5.txt AC 22
case6.txt AC 20
case7.txt AC 18
case8.txt AC 8
case9.txt AC 26
case10.txt AC 18
case11.txt AC 12
case12.txt AC 25
case13.txt AC 15
case14.txt AC 22
case15.txt AC 27
33 AC33 AC