結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | |
提出日時 | 2022-10-15 00:26:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,132 bytes |
コンパイル時間 | 1,379 ms |
コンパイル使用メモリ | 124,264 KB |
実行使用メモリ | 16,572 KB |
最終ジャッジ日時 | 2023-09-09 01:15:06 |
合計ジャッジ時間 | 40,449 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 450 ms
10,280 KB |
testcase_03 | AC | 539 ms
12,416 KB |
testcase_04 | AC | 456 ms
10,224 KB |
testcase_05 | AC | 346 ms
7,032 KB |
testcase_06 | AC | 523 ms
10,648 KB |
testcase_07 | AC | 282 ms
8,524 KB |
testcase_08 | AC | 170 ms
4,380 KB |
testcase_09 | AC | 437 ms
11,384 KB |
testcase_10 | AC | 224 ms
6,012 KB |
testcase_11 | AC | 169 ms
6,968 KB |
testcase_12 | AC | 361 ms
9,596 KB |
testcase_13 | AC | 559 ms
13,320 KB |
testcase_14 | AC | 399 ms
8,612 KB |
testcase_15 | AC | 556 ms
11,056 KB |
testcase_16 | AC | 770 ms
15,080 KB |
testcase_17 | AC | 201 ms
7,052 KB |
testcase_18 | AC | 385 ms
9,924 KB |
testcase_19 | AC | 270 ms
7,508 KB |
testcase_20 | AC | 659 ms
14,084 KB |
testcase_21 | AC | 283 ms
4,388 KB |
testcase_22 | AC | 836 ms
16,388 KB |
testcase_23 | AC | 856 ms
16,308 KB |
testcase_24 | AC | 845 ms
16,252 KB |
testcase_25 | AC | 867 ms
16,328 KB |
testcase_26 | AC | 855 ms
16,572 KB |
testcase_27 | AC | 808 ms
16,388 KB |
testcase_28 | AC | 823 ms
16,248 KB |
testcase_29 | AC | 818 ms
16,288 KB |
testcase_30 | AC | 806 ms
16,240 KB |
testcase_31 | AC | 821 ms
16,248 KB |
testcase_32 | AC | 823 ms
16,244 KB |
testcase_33 | AC | 798 ms
16,224 KB |
testcase_34 | AC | 823 ms
16,284 KB |
testcase_35 | AC | 816 ms
16,288 KB |
testcase_36 | AC | 812 ms
16,452 KB |
testcase_37 | AC | 840 ms
16,500 KB |
testcase_38 | AC | 827 ms
16,300 KB |
testcase_39 | AC | 824 ms
16,316 KB |
testcase_40 | AC | 841 ms
16,228 KB |
testcase_41 | AC | 839 ms
16,432 KB |
testcase_42 | AC | 580 ms
12,280 KB |
testcase_43 | AC | 562 ms
11,984 KB |
testcase_44 | AC | 602 ms
12,088 KB |
testcase_45 | AC | 560 ms
12,000 KB |
testcase_46 | AC | 571 ms
12,128 KB |
testcase_47 | AC | 336 ms
8,484 KB |
testcase_48 | AC | 338 ms
8,528 KB |
testcase_49 | AC | 339 ms
8,548 KB |
testcase_50 | AC | 346 ms
8,568 KB |
testcase_51 | AC | 338 ms
8,552 KB |
testcase_52 | AC | 26 ms
5,356 KB |
testcase_53 | AC | 27 ms
5,088 KB |
testcase_54 | AC | 26 ms
5,092 KB |
testcase_55 | AC | 74 ms
4,404 KB |
testcase_56 | AC | 75 ms
4,492 KB |
testcase_57 | AC | 74 ms
4,432 KB |
testcase_58 | TLE | - |
testcase_59 | -- | - |
testcase_60 | -- | - |
testcase_61 | -- | - |
testcase_62 | -- | - |
testcase_63 | -- | - |
testcase_64 | -- | - |
testcase_65 | -- | - |
testcase_66 | -- | - |
testcase_67 | -- | - |
testcase_68 | -- | - |
testcase_69 | -- | - |
ソースコード
#include <cstdio> #include <cstdint> #include <cmath> #include <cstring> #include <iostream> #include <iomanip> #include <vector> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <queue> #include <algorithm> #include <numeric> #include <cassert> using namespace std; namespace atcoder{};using namespace atcoder; using ull = uint64_t; using ll = int64_t; using vi = vector<int>; using vll = vector<ll>; using vs = vector<string>; using ld = long double; using P = pair<ll,ll>; using G = vector<vector<int>>; #ifdef MYDEBUG template<class C> string join(const C& c){stringstream ss; for(auto it=c.begin(); it!=c.end();it++){ss << *it;if(it!=c.end())ss<<", ";}return ss.str();} template<class C> ostream &operator<<(ostream &os, const vector<C>& c){for(auto it=c.begin(); it!=c.end();it++){os << *it;if(it!=c.end())os<<", ";}return os;} #define LO(...) fprintf(stderr, __VA_ARGS__) #define debug(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << "\033[m" << endl #else #define LO(...) (void)0 #define debug(x) (void)0 #endif #define reps(i,a,n) for(ll i##_len = (ll)(n), i = (a); i < i##_len; ++i) #define rep(i,n) reps(i,0,n) #define rrep(i,n) reps(i,1,n+1) #define repd(i,n) for(ll i=n-1;i>=0;i--) #define rrepd(i,n) for(ll i=n;i>=1;i--) #define inp(i) ll i; cin >> i; #define inps(s) string s; cin >> s; #define inpp(p) cin >> (p).first >> (p).second #define inpv(v,N) vll v(N);rep(i,N)cin>>v[i]; #define inpg(g,N,M) g.resize(N);rep(i,M){inp(a);inp(b);a--,b--;g[a].push_back(b);g[b].push_back(a);} #define all(v) begin(v),end(v) #define YESNO(b) cout<<(b?"YES\n":"NO\n") #define yesno(b) cout<<(b?"yes\n":"no\n") #define YesNo(b) cout<<(b?"Yes\n":"No\n") #define YES cout<<"YES\n" #define NO cout<<"NO\n" #define yes cout<<"yes\n" #define no cout<<"no\n" #define Yes cout<<"Yes\n" #define No cout<<"No\n" #define SP cout << " " #define ENDL cout << "\n" #define ou(i) cout << (i) #define ous(i) cout << (i) << " " #define oul(i) cout << (i) << "\n" #define setfp() cout << fixed << setprecision(16) template<typename C> void ouv(const C &v){for(auto &&e:v){cout << e;if(&e != &v.back()) cout << ' ';}cout << "\n";} template<typename C> void ouvadd(const C &v){for(auto &&e:v){cout << e+1;if(&e != &v.back()) cout << ' ';}cout << "\n";} template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } inline ll lg(ll __n) { return sizeof(ll) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); } int dx[8]={1,0,-1,0,1,-1,-1,1}; int dy[8]={0,1,0,-1,1,1,-1,-1}; constexpr ll INF = 1e18; int main(){ inp(N); set<string> a; rep(i,N){ inps(S); if(a.count(S)){ Yes; continue; } ll k = S.size(); bool ok = 0; rep(j,k-1){ swap(S[j], S[j+1]); if(a.count(S)){ ok=1; swap(S[j], S[j+1]); break; } swap(S[j], S[j+1]); } a.insert(S); YesNo(ok); } return 0; }