結果
問題 | No.517 壊れたアクセサリー |
ユーザー |
![]() |
提出日時 | 2017-05-28 21:51:08 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,081 bytes |
コンパイル時間 | 1,473 ms |
コンパイル使用メモリ | 127,624 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-21 15:23:29 |
合計ジャッジ時間 | 2,142 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 15 |
ソースコード
#include <iostream>#include <string>#include <queue>#include <stack>#include <algorithm>#include <list>#include <vector>#include <complex>#include <utility>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <climits>#include <bitset>#include <ctime>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <cassert>#include <cstddef>#include <iomanip>#include <numeric>#include <tuple>#include <sstream>#include <fstream>#include <functional>#include <chrono>using namespace std;#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)#define DEBUG(C) cerr << #C << " = " << C << endl;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 PII = pair<int, int>;using PDD = pair<double, double>;using PLL = pair<LL, LL>;using VPII = vector<PII>;template<typename T> using VT = vector<T>;#define ALL(a) begin((a)), end((a))#define RALL(a) rbegin((a)), rend((a))#define SORT(a) sort(ALL((a)))#define RSORT(a) sort(RALL((a)))#define REVERSE(a) reverse(ALL((a)))#define MP make_pair#define FORE(a, b) for (auto &&a : (b))#define FIND(s, e) ((s).find(e) != (s).end())#define EB emplace_backtemplate<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}const int INF = 1e9;const int MOD = INF + 7;const LL LLINF = 1e18;const double EPS = 1e-9;int main() {int N, M;vector<string> A, B;cin >> N;A.resize(N);REP(i, N) {cin >> A[i];}cin >> M;B.resize(M);REP(i, M) {cin >> B[i];}if (N == 1) {cout << A[0] << endl;return 0;} else if (M == 1) {cout << B[0] << endl;return 0;}map<char, char> mp;FORE(e, B) {REP(i, (int) e.size() - 1) {mp[e[i]] = e[i + 1];}}while (A.size() >= 2) {//FORE(e, A) cout<<e<<" ";cout<<endl;VT<string> na;VT<bool> used(A.size(), false);REP(i, A.size()) {if (!used[i]) {REP(j, A.size()) {if (i != j && !used[j]) {if (mp[A[i].back()] == A[j].front()) {used[i] = used[j] = true;na.EB(A[i] + A[j]);goto next;}}}}next:;}if (na.empty()) {cout << -1 << endl;return 0;}REP(i, A.size()) {if (!used[i]) {na.EB(A[i]);}}A = na;}cout << A.front() << endl;}