提出 #461154

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

#define FOR(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define first F
#define second S

const int INF = 1 << 29;
const double EPS = 1e-9;
template<class T> ostream& operator<<(ostream &os, const vector<T> &v){ FOR(i, v.size()) { if(v[i] == INF) os << "INF"; else os << v[i]; if(i != v.size() - 1) os << ' '; } return os; }

const int MAX = INF;

int main() {
    std::ios_base::sync_with_stdio(0);
    int n;
    string ans = "", s, p, q;
    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> s;
        cin >> p >> q;
        if(s == "BEGINNING") {
            ans += q[0];
        } else if(s == "MIDDLE") {
            ans += q[q.size() / 2];
        } else {
            ans += q[q.size() - 1];
        }
    }
    cout << ans << endl;
}

提出情報

ジャッジ結果