提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114848	2023-10-24 08:56:26	Fysty	F	cpp	18/18	AC	9

#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;

ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll tmp=1;
    for(ll cur=a;b;b>>=1,cur=cur*cur%m) if(b&1) tmp=tmp*cur%m;
    return tmp;
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)


void solve()
{
    queue<string> v;
    int q;
    cin>>q;
    while(q--)
    {
        int t;
        cin>>t;
        if(t==1)
        {
            string s;
            cin>>s;
            v.push(s);
        }
        else
        {
            if(v.empty()) cout<<"何もなくてごめんね\n";
            else
            {
                string s=v.front();v.pop();
                cout<<s;
                if(v.empty()) cout<<"しかなかったんだけどいいかな\n";
                else cout<<"だけどいいかな\n";
            }
        }
    }
    cout<<v.size()<<"\n";
}

signed main()
{
    MottoHayaku
    int t;
    //cin>>t;
    t=1;
    while(t--)
    {
        solve();
    }
}

sample1.txt AC 2
sample2.txt AC 6
sample3.txt AC 6
case1.txt AC 9
case2.txt AC 2
case3.txt AC 5
case4.txt AC 4
case5.txt AC 5
case6.txt AC 4
case7.txt AC 4
case8.txt AC 3
case9.txt AC 5
case10.txt AC 4
case11.txt AC 4
case12.txt AC 5
case13.txt AC 4
case14.txt AC 4
case15.txt AC 5
9 AC9 AC