发现一种超短超简单做法!!
查看原帖
发现一种超短超简单做法!!
723171
fqEason楼主2022/8/30 14:59
#include<bits/stdc++.h>
using namespace std;
int n,l,m;
string s,q,x;
map<string,string>t;
map<string,bool>vis;
string change(int n) {
	string x;
    while(n) {
        x+=(n%10)+'0';
        n/=10;
    }
    reverse(x.begin(), x.end());
    return x;
}
int main() {
    cin >> n;
    for (int i=1;i<=n;i++) {
        cin >> l;
        vis.clear();
        for (int j=1;j<=l;j++) {
            cin >> s;
            if (!vis[s]) 
                t[s]+=change(i)+" ", vis[s]=true;
        }
    }
    cin >> m;
    for (int i=1;i<=m;i++) {
        cin >> q;
        cout << t[q] << "\n";
    }
    return 0;
}
2022/8/30 14:59
加载中...