ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#195243 | #3418. 鹅鸭杀 | wangborao | 100 | 22ms | 1556kb | C++ | 1.2kb | 2023-10-18 18:42:04 | 2023-10-18 21:59:43 |
answer
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
int n;
const int N=1200;
string s[N];
struct qcl{
string name,id,plase;
}a[N];
string pl[N];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n+1;i++){
getline(cin,s[i]);
int h=0;
int dc=0;
for(int j=0;j<s[i].size();j++){
if(s[i][j]==' '&&dc==0){
for(int p=0;p<j;p++){
a[i].name+=s[i][p];
}
dc=1;
}else if(s[i][j-1]==' '&&s[i][j-2]=='a'&&s[i][j-3]==' '){
int y=j;
while(s[i][y]!=','){
a[i].id+=s[i][y];
y++;
}
}else if(s[i][j-1]==' '&&s[i][j-2]=='t'&&s[i][j-3]=='a'){
int y=j;
while(y<s[i].size()){
a[i].plase+=s[i][y];
y++;
}
}
}
}
int u=0;
for(int i=1;i<=n+1;i++){
if(a[i].id=="duck"){
pl[++u]=a[i].plase;
}
}
for(int i=2;i<=n+1;i++){
bool f=true;
for(int j=1;j<=u;j++){
if(f==true&&a[i].id=="goose"&&a[i].plase==pl[j]){
f=false;
cout<<a[i].name<<" is dead"<<endl;
break;
}
}
if(f==true){
if(a[i].id=="duck"){
cout<<a[i].name<<" is alive"<<endl;
continue;
}
cout<<a[i].name<<" is alive"<<endl;
}
}
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1300kb
input:
1 DnONuKkfsK is a duck, it is at VxdjvTXugQrxHcBy
output:
DnONuKkfsK is alive
result:
ok single line: 'DnONuKkfsK is alive'
Test #2:
score: 10
Accepted
time: 0ms
memory: 1300kb
input:
1 h is a goose, it is at DgPHXhVJtkESkHmf
output:
h is alive
result:
ok single line: 'h is alive'
Test #3:
score: 10
Accepted
time: 1ms
memory: 1300kb
input:
2 HRiAYWN is a goose, it is at EL dgwgYboiuaytmJOAv is a duck, it is at EL
output:
HRiAYWN is dead dgwgYboiuaytmJOAv is alive
result:
ok 2 lines
Test #4:
score: 10
Accepted
time: 0ms
memory: 1300kb
input:
2 izNydjl is a goose, it is at qYWlAosa EISnxurnHqHNKDD is a goose, it is at qYWlAosa
output:
izNydjl is alive EISnxurnHqHNKDD is alive
result:
ok 2 lines
Test #5:
score: 10
Accepted
time: 0ms
memory: 1300kb
input:
10 NSWzSOl is a duck, it is at VCLAQReUMFYoH owVUjFuAPuutSaKhLqh is a duck, it is at ZYPmZsegdxJOuB ...
output:
NSWzSOl is alive owVUjFuAPuutSaKhLqh is alive iamfqstvZbCYSDhlDnbq is alive T is alive zGub is alive...
result:
ok 10 lines
Test #6:
score: 10
Accepted
time: 0ms
memory: 1304kb
input:
10 kjbxCSWpMH is a duck, it is at FIlDOBA gxRn is a duck, it is at zXofss vIFtyFL is a duck, it is a...
output:
kjbxCSWpMH is alive gxRn is alive vIFtyFL is alive PFeZj is alive uEy is alive qnoZYPzR is alive Rff...
result:
ok 10 lines
Test #7:
score: 10
Accepted
time: 0ms
memory: 1300kb
input:
10 CdhUNaBieDYujJ is a goose, it is at ftZTshCjDGgjvPZ e is a duck, it is at HHvP fnjTJMUYgydjEeAFet...
output:
CdhUNaBieDYujJ is alive e is alive fnjTJMUYgydjEeAFet is alive Vvc is alive MLHmWVs is alive AYDTmkf...
result:
ok 10 lines
Test #8:
score: 10
Accepted
time: 11ms
memory: 1556kb
input:
1000 zS is a duck, it is at uZoViqfzXzBHnojfjo WUzyrypHYFMkE is a goose, it is at RqXtorsLNPVXWX mbV...
output:
zS is alive WUzyrypHYFMkE is dead mbVP is alive iWelC is alive DqMTir is alive Zr is alive BsHCmmN i...
result:
ok 1000 lines
Test #9:
score: 10
Accepted
time: 7ms
memory: 1556kb
input:
1000 luK is a duck, it is at Jr kz is a duck, it is at Q momuTR is a duck, it is at beRModCS HmqEgsw...
output:
luK is alive kz is alive momuTR is alive HmqEgswLg is dead uFNEeUULkDT is alive uQgDGhomNgYQuwndOxKn...
result:
ok 1000 lines
Test #10:
score: 10
Accepted
time: 3ms
memory: 1556kb
input:
1000 IbBJmdORPKZQEUANbGl is a duck, it is at OJplxaPZjvPj BzokAqyWjUIVWu is a duck, it is at xxYRvKG...
output:
IbBJmdORPKZQEUANbGl is alive BzokAqyWjUIVWu is alive tLHbuTjOxzopobuOMg is alive rLeadcccgsTAuIbpOGU...
result:
ok 1000 lines
Extra Test:
score: 0
Extra Test Passed