QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#573081 | #9350. Fixing Banners | whyhere | TL | 0ms | 3876kb | C++17 | 881b | 2024-09-18 17:16:39 | 2024-09-18 17:16:40 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void Z()
{
vector<string> a(6);
string s = "harbin";
for (int i = 0; i < 6; i++)
{
cin >> a[i];
}
bool flag = 0;
do
{
int cnt = 0;
for (int i = 0; i < 6; i++)
{
for (int j = 0; j < a[i].size(); j++)
{
if (a[i][j] == s[i])
{
cnt++;
break;
}
}
}
if (cnt == 6)
{
cout << "Yes\n";
return;
}
} while (next_permutation(a.begin(), a.end()));
cout << "No\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
cin >> t;
while (t--)
{
Z();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3876kb
input:
2 welcome toparticipate inthe ccpccontest inharbin inoctober harvest belong ninja reset amazing intriguing
output:
No Yes
result:
ok 2 lines
Test #2:
score: -100
Time Limit Exceeded
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 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 No ...