QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #603957 | #9350. Fixing Banners | Saton | AC ✓ | 157ms | 4884kb | C++20 | 1.4kb | 2024-10-01 21:16:40 | 2024-10-01 21:16:42 |
Judging History
answer
///by Saton.
#include<bits/stdc++.h>
#define PI acos(-1)
#define fi first
#define se second
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define LL long long
#define ll __int128
#define DD double double
#define LD long double
#define rep(i,a,b) for(LL i = (a);i <= (b);i ++)
#define lep(i,a,b) for(LL i = (a);i >= (b);i --)
#define FLUSH fflush(stdout)
using namespace std;
const int N = 2e5 + 10,mod = 1e9+7,P = 131;
const LL inf = 1e9+10,INF = 1e18+10;
typedef pair<int,int> PII;
typedef pair<LL,int> PLI;
typedef pair<LL,LL> PLL;
LL n,m,k;
string str;
string target = " harbin";
bool a[7][7];
bool dfs(int step,int pos,int state) {
if(step==7) return true;
if(!a[pos][step]) return false;
bool ans = false;
rep(i,1,6) {
if((state>>i&1) && step<6) continue;
ans |= dfs(step+1,i,state|(1<<i));
}
return ans;
}
void solve() {
rep(i,0,6) rep(j,0,6) a[i][j] = false;
rep(i,1,6) {
cin >> str;
rep(j,0,sz(str)-1) rep(k,1,6) a[i][k] |= (str[j]==target[k]);
}
bool ans = false;
rep(i,1,6) ans |= dfs(1,i,1<<i);
cout << (ans ? "Yes" : "No") << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T;
cin >> T;
while(T --) {
solve();
}
// solve();
return 0;
}
/* /\_/\
* (= ._.)
* / > \>
*/
这程序好像有点Bug，我给组数据试试？
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3600kb
input:
2 welcome toparticipate inthe ccpccontest inharbin inoctober harvest belong ninja reset amazing intriguing
output:
No Yes
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 22ms
memory: 3612kb
input:
50000 dwwfplbjd elulqfmsp whobggs kbnhtvzcs zllux ggye vtnqpmvi cgsplau gkuwhhmrio sp q utrefny tvdcequdjj klesyx esovlmdy x nywu gklfbqfb ysnaswszfq ouo tq r auvi copeabvz nruvawao cdv vdsk hboecpit s ewscbmb jeqp gel u htk fcoigxbux ylinyzut bnhrvoetf xa ehnbce keyk efvzoyba xan tvnlm tetpijfh blq...
output:
No No No No No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No...
result:
ok 50000 lines
Test #3:
score: 0
Accepted
time: 29ms
memory: 3556kb
input:
46400 qmcsjjknjvhfv hnbul nsnkqejawa klkoaytykfhkfaqvxv djqcmokv xtzwoye blmxpxgpmx rqqca j zshflbdjsccxg crzivheauq uoshinevxqbbyfqdz cirxjbhihcaorkur kbnzxqfq llmekjvhdldyva wtjxb eswthf rcmzrfjoaj vrvmk fhqfu tlessqmw vi gzyjwk xyodo qzwvuhvxabzyxdb vhb urprkoxfukz fnuqu zklzuqshoagqsxkjcmuj cpza...
output:
No No Yes No No No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No Yes Yes No No No Yes No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No Yes No No...
result:
ok 46400 lines
Test #4:
score: 0
Accepted
time: 43ms
memory: 3540kb
input:
16799 qnirkhvdc irjxeqoc eojfaoxqhwsjksqu ttquucbewrvjlqeqdbdholwu lmgxyknn xotixvxrmmadrgsbcwzzuzafxwurahacrfdu cjgmratfgjzyfksceqs yuhyir wrzyvilptvpmvsqkedivuzaqsoszmafcvdgutocixrv dgefgjaf tqiabsvnpzhsryva ruzlibegdwgphsrrhqjrapvh anwhzchedodtiigibhsq lyonlnfujgktbzb pkfcicbqkediphbw ogmwdqq eqo...
output:
Yes Yes No No No Yes Yes Yes Yes No No Yes Yes No Yes Yes No No No No Yes Yes Yes No No Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes No Yes Yes Yes No No No Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes No No Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes...
result:
ok 16799 lines
Test #5:
score: 0
Accepted
time: 99ms
memory: 3712kb
input:
50000 aaahrrr n ir ia arrr innranirr aaiii iir iiiirnnhn bbb rai nb nrb rrn baabb birabarrna aaaiinann arnnbrrban rrrbni bbr ir bbari briiianh irrr b aini iarr aaaai naraanri i rrbr airbnbabh hbbhhbb hihrbrrih bihrrrhrb ar inihnn ib n hh hiiini haibbi iihnihi bih bibhi ihbahia bn iibhbiiinb bhab nbi...
output:
No Yes No Yes No Yes No No Yes Yes Yes No Yes Yes Yes Yes Yes Yes No No No No No No Yes Yes Yes No Yes No No Yes Yes No Yes No Yes No No No No No Yes Yes No Yes No Yes Yes Yes No Yes Yes No Yes No Yes Yes No Yes Yes Yes Yes Yes No Yes Yes No No No No No Yes Yes No Yes No No No No Yes Yes No No No Ye...
result:
ok 50000 lines
Test #6:
score: 0
Accepted
time: 157ms
memory: 3708kb
input:
25285 brrbinhrirnaabaa ahbahnnrbnbnhar arrhararrrarhrnraranhran ararbrnbnhabna nanaaarrhh rrrbhrrr bhhhhrbbh hnhbbbbhrhrarrbbhbhbbbbhbrb biribhharhrbbbibharbb bhrbbbnr bhhbihbbbrb bhanh anbhaaniaibbnibri rhnninnaibhaaa ibbri abbibriannbibin biinbabai bnnrbnrrhihbiihiaibaibii iannbbabihahibnnbbrn nbb...
output:
Yes Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes No Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes Yes No Yes Yes No Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes No Yes Yes No Yes Yes Yes Yes No No ...
result:
ok 25285 lines
Test #7:
score: 0
Accepted
time: 42ms
memory: 3508kb
input:
5588 nhhbhhhbbrhhbnbrrhrbhbnhnrhbbhhnbhnbhnhhbhrbhnnhrbbnrnnbhnrnbbhhhhnrrnnhn brhbbnnhrbnrbrhbbhhhnrnrrnnhbnhrnnbnrrnnnrbrbrnnbnbnbrbbrbhnbrnhrhhnhrbbbhbrbbbhnrbrnhhbbnnnnhhrnhn bbnbnbnbrhhnrrhbbhhbbbbnbbhhhhhrhbrbnhbbnbhbbbnhrnhrrbhhhbnnrnhnhrnhnbnnrbhhhn hbhhbrbbbbbbbrhnbhbnnbnhbhrrnnrbnhnnbhhbhn...
output:
No No Yes Yes Yes Yes No No No No Yes Yes Yes No Yes Yes No Yes Yes No No Yes Yes Yes No Yes Yes No No Yes Yes No No No Yes No Yes Yes No No Yes Yes No Yes No Yes No No No No Yes Yes No Yes Yes No Yes No No No No Yes No No Yes No Yes No No No No Yes No Yes Yes Yes No No Yes Yes No Yes No Yes No Yes ...
result:
ok 5588 lines
Test #8:
score: 0
Accepted
time: 7ms
memory: 3720kb
input:
129 inaaiannnbnibanaannibnabbanaaibinbbiibaibbbinaabiainnanaiinbbanbaaannnniannaaibnnbnnaaabnnbibnaibiannbaiiaaanbiaanibbibbanbaaninaniabiabibibbaabiaaaiiiabaaiiabiabiabbnnananinabnnnnbbibanniibaaaianininnbiinnbbninanibnnbannabbainbbinaibinbannainiaibnannnnbbbbinnaiibabbanbniiibbnanbbnabnnaiibiabinb...
output:
No Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes No Yes No Yes No Yes No Yes Yes No Yes No Yes Yes No Yes Yes Yes No Yes Yes Yes Yes Yes Yes No Yes No Yes Yes No Yes No Yes No No Yes Yes No Yes Yes Yes No No No Yes No No No Yes No Yes Yes No No No Yes Yes Yes Yes Yes Yes Yes No Yes No No Yes No No N...
result:
ok 129 lines
Test #9:
score: 0
Accepted
time: 7ms
memory: 3620kb
input:
61 irnnnrrnrrrrnrnrnnirrnininrniirrrrnrrirhnrnririnniiinnnnriariinrrrrrirnrnnrrrrrrrriirnnrrnrrrrrnirnaihnnranrnnniirninninrrihininnninnninrirrnrrnririnrnnnrirrinnarrinannninrnrrninrnrbnnriirnnibinnnirrrrnirririrrrinrnbnnrnnrnrninrranrnrbnirnaiirinnnnnnnrrrrinirnniarnrrrrnrirrnrrnirrnrrninrnrrnnhnna...
output:
Yes Yes Yes No Yes Yes No No Yes No No No Yes Yes No Yes No No Yes No No No Yes Yes Yes Yes No Yes Yes No Yes No Yes Yes Yes No No Yes Yes Yes Yes Yes Yes No No Yes Yes Yes Yes Yes Yes No Yes Yes No Yes Yes Yes Yes Yes Yes
result:
ok 61 lines
Test #10:
score: 0
Accepted
time: 11ms
memory: 4448kb
input:
13 cweiayuxohsmbxvfpdnybebtylugrhlmqatwkthgeuscafhzihzehsnxkavzcvvwctferlinigkugjdsqirpghlcdnsdejkscnltwenhgwkiyvfenrwscpdinbhknpabvfaaevveoikkgntndtfgemlwgjzknjmyxvuvxslafuadslrsbnevnqmzfftqwdjwaxznnmxmfqjzrxraupzansxfvxexjebqhypcrwphlgewyhdhprtkirsywimvvueqnjvscytbecblomknyqphcztrqpfengnnstsmesjkm...
output:
Yes Yes Yes Yes Yes Yes No No No No No No No
result:
ok 13 lines
Test #11:
score: 0
Accepted
time: 7ms
memory: 4884kb
input:
8 ribiirrbribiiriiriibrrbrnrbbbiibrbnnirribbnriiibrrbbrrinniiribrrirbiirbiiribrrrribbrbiribrniririrbriibiiiirbbnriibirbibbribbiibrbbbbirribrrbirrirbibbirbbirniriiribbirbrbirbrirbbrbbibbbbrbirriibbriiiinninbnbnibbinrbinnbirbriiibbbbbinrrbibribbnirrrrribbrrririibnnriirbibiibinrrbrirrbrriiiiibrnrrbrbrr...
output:
No Yes No Yes Yes No No No
result:
ok 8 lines
Extra Test:
score: 0
Extra Test Passed