QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#397225#6785. What Kind of Friends Are You?Lezy233WA 1ms3632kbC++201.1kb2024-04-23 19:53:212024-04-23 19:53:21

Judging History

你现在查看的是最新测评结果

  • [2024-04-23 19:53:21]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3632kb
  • [2024-04-23 19:53:21]
  • 提交

answer

#include <bits/stdc++.h>
// #include <bits/extc++.h>
using std::cin,std::cout,std::vector;
#define endl "\n"
typedef std::pair<int,int> PII;

void solve()
{
    int n,q; cin>>n>>q;
    int c; cin>>c;
    vector<int>aa(c,0);
    vector<std::string>name(c+1);
    // __gnu_pbds::gp_hash_table<std::string,int>mp;
    std::unordered_map<std::string,int>mp;
    for(int i=0;i<c;++i){
        cin>>name[i];
        mp[name[i]]=i;
    }
    name[c]="Let’s go to the library!!";
    for(int i=0;i<q;++i){
        int m; cin>>m;
        while(m--){
            std::string s; cin>>s;
            aa[mp[s]]|=1<<i;
        }
    }
    
    std::map<int,int>mp2;
    for(int i=0;i<c;++i){
        if(mp2.contains(aa[i])) mp2[aa[i]]=c;
        else mp2[aa[i]]=i;
    }
    while(n--){
        int tt=0;
        for(int i=0;i<q;++i){
            int t; cin>>t;
            if(t) tt|=1<<i;
        }
        if(mp2.contains(tt)) cout<<name[mp2[tt]]<<endl;
        else cout<<name[c]<<endl;
    }
}

int main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    int T; cin>>T;
    while(T--) solve();
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3632kb

input:

2
3 4
5 Serval Raccoon Fennec Alpaca Moose
4 Serval Raccoon Alpaca Moose
1 Serval
1 Fennec
1 Serval
1 1 0 1
0 0 0 0
1 0 0 0
5 5
11 A B C D E F G H I J K
3 A B K
4 A B D E
5 A B K D E
10 A B K D E F G H I J
4 B D E K
0 0 1 1 1
1 0 1 0 1
1 1 1 1 1
0 0 1 0 1
1 0 1 1 1

output:

Serval
Let’s go to the library!!
Let’s go to the library!!
Let’s go to the library!!
Let’s go to the library!!
B
Let’s go to the library!!
K

result:

wrong answer 2nd lines differ - expected: 'Let's go to the library!!', found: 'Let’s go to the library!!'