NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #195247 | #3418. 鹅鸭杀 | H | 100 | 26ms | 1584kb | C++11 | 1.3kb | 2023-10-18 18:42:31 | 2023-10-18 21:59:55 |
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
string s;
map<string, vector<pair<string, string>>> mp;
map<string, bool> Map;
struct Node{
string name, id, place;
Node(){}
Node(string name, string id, string place) : name(name), id(id), place(place){}
}a[1005];
int main(){
cin >> n;
for(ll i = 1; i <= n; i ++){
cin >> a[i].name >> s >> s >> a[i].id >> s >> s >> s >> a[i].place;
Map[a[i].name] = false;
}
for(ll i = 1; i <= n; i ++){
string t = "";
for(ll j = 0; j < a[i].id.size() - 1; j ++) t += a[i].id[j];
a[i].id = t;
mp[a[i].place].push_back(make_pair(a[i].name, a[i].id));
}
for(ll i = 1; i <= n; i ++){
bool flag = false;
for(ll j = 0; j < mp[a[i].place].size(); j ++){
if(mp[a[i].place][j].second == "duck"){
flag = true;
}
}
for(ll j = 0; j < mp[a[i].place].size(); j ++){
if(mp[a[i].place][j].second == "goose" && flag){
Map[mp[a[i].place][j].first] = true;
}
}
}
for(ll i = 1; i <= n; i ++){
cout << a[i].name << " is ";
if(Map[a[i].name]) cout << "dead" << endl;
else cout << "alive" << endl;
}
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1284kb
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: 1280kb
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: 0ms
memory: 1284kb
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: 1ms
memory: 1280kb
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: 1284kb
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: 1280kb
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: 1280kb
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: 1580kb
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: 6ms
memory: 1580kb
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: 8ms
memory: 1584kb
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
