P3879 [TJOI2010]阅读理解

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <map>
#include <cstring>
#define inf 2147483647
#define N 1000010
#define p(a) putchar(a)
#define For(i,a,b) for(int i=a;i<=b;++i)
//by war
//2019.8.12
using namespace std;
int n,m,q,t;
string s;

map<string,vector<int> >a;

void in(int &x){
    int y=1;char c=getchar();x=0;
    while(c<‘0‘||c>‘9‘){if(c==‘-‘)y=-1;c=getchar();}
    while(c<=‘9‘&&c>=‘0‘){ x=(x<<1)+(x<<3)+c-‘0‘;c=getchar();}
    x*=y;
}
void o(int x){
    if(x<0){p(‘-‘);x=-x;}
    if(x>9)o(x/10);
    p(x%10+‘0‘);
}

signed main(){
    in(n);
    For(i,1,n){
        in(m);
        For(j,m){
            cin>>s;
            a[s].push_back(i);
        }
    }
    in(q);
    For(ii,q){
        cin>>s;
        t=a[s].size()-1;
        For(i,0,t)
            if(i==0||a[s][i]!=a[s][i-1]){
                if(i!=0) p(‘ ‘);
                o(a[s][i]);
            }
        p(‘n‘);
    }
    return 0;
}