提出 #461140
ソースコード 拡げる
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
char calc(string &s){
int i = sz(s);
return s[i/2];
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int N;
cin >> N;
string ans;
rep(i,N){
string p,q,r;
cin >> p >> q >> r;
if (p[0] == 'B') {
ans += r[0];
}else if (p[0] == 'M') {
ans += calc(r);
}else{
ans += r.back();
}
}
cout << ans << endl;
return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
A - エンド・オブ・ビギニング |
| ユーザ |
maguro |
| 言語 |
C++11 (GCC 4.9.2) |
| 得点 |
100 |
| コード長 |
2430 Byte |
| 結果 |
AC |
| 実行時間 |
26 ms |
| メモリ |
928 KiB |
ジャッジ結果
| セット名 |
All |
| 得点 / 配点 |
100 / 100 |
| 結果 |
|
| セット名 |
テストケース |
| All |
00_sample_00.txt, 00_sample_01.txt, 10_min_00.txt, 10_min_01.txt, 10_min_02.txt, 20_max_00.txt, 20_max_01.txt, 20_max_02.txt, 90_random_00.txt, 90_random_01.txt, 90_random_02.txt, 90_random_03.txt, 90_random_04.txt, 90_random_05.txt, 90_random_06.txt, 90_random_07.txt, 90_random_08.txt, 90_random_09.txt, 99_medium_00.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 00_sample_00.txt |
AC |
25 ms |
928 KiB |
| 00_sample_01.txt |
AC |
23 ms |
928 KiB |
| 10_min_00.txt |
AC |
24 ms |
924 KiB |
| 10_min_01.txt |
AC |
25 ms |
924 KiB |
| 10_min_02.txt |
AC |
25 ms |
928 KiB |
| 20_max_00.txt |
AC |
25 ms |
928 KiB |
| 20_max_01.txt |
AC |
23 ms |
928 KiB |
| 20_max_02.txt |
AC |
25 ms |
928 KiB |
| 90_random_00.txt |
AC |
26 ms |
800 KiB |
| 90_random_01.txt |
AC |
24 ms |
928 KiB |
| 90_random_02.txt |
AC |
25 ms |
928 KiB |
| 90_random_03.txt |
AC |
23 ms |
924 KiB |
| 90_random_04.txt |
AC |
24 ms |
800 KiB |
| 90_random_05.txt |
AC |
24 ms |
920 KiB |
| 90_random_06.txt |
AC |
25 ms |
800 KiB |
| 90_random_07.txt |
AC |
24 ms |
924 KiB |
| 90_random_08.txt |
AC |
25 ms |
804 KiB |
| 90_random_09.txt |
AC |
26 ms |
928 KiB |
| 99_medium_00.txt |
AC |
26 ms |
772 KiB |