提出詳細
ソースコード
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
#include <numeric>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x),greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define sprint(X) printf("%f\n", (X)) // 小数点の出力
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
#define case(X) cout << "Case #" << (X) + 1 << ":" << "\n"
static const int INF = 1e+9+7;
// 嘘解法?
// これやろうとした人多そう
// 諦めません
int main(){
int T;
cin >> T;
for(int t=1; t<=T; t++){
cout << "Case #" << t << ":" << "\n";
int32_t N;
cin >> N;
vector<int> Ws, Wl;
for(int i=0; i < N; i++){
string w;
cin >> w;
Ws.push_back(w[0] - 'a');
Wl.push_back(w[sz(w)-1] - 'a');
}
vector<int> sWs = Ws;
vector<int> sWl = Wl;
sort(sWs.begin(), sWs.end());
sort(sWl.begin(), sWl.end());
bool flag = true;
ll same[27] = {};
for(int i=0; i < N; i++){
if(sWs[i] != sWl[i]){
flag = false;
break;
}
if(Ws[i] == Wl[i]){
same[Ws[i]]++;
}
}
ll count = 0;
for(int i=0; i < 26; i++){
if(N == 1)break;
if(same[i] > 0){
count++;
}
}
if(flag && count != N) cout << "OK" << "\n";
else cout << "NG" << "\n";
}
return 0;
}
提出情報
提出出力結果
テストケース情報