2017乌鲁木齐网络赛

01 banana

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>

using namespace std;
typedef pair<int , int> p2 ;
int monkey[60][60] , banana[60][60] , out[60];
int main(){
    int kase ; scanf("%d" , &kase) ;
    int m , n , a , b;
    while( kase -- ){
        scanf("%d %d" , &m , &n) ; memset(banana , 0 , sizeof(banana)) ; memset(monkey , 0 , sizeof(monkey)) ;
        int max_place = 0 , max_monkey = 0 , max_banana = 0;
        for(int i = 0 ; i < m ; i ++ )
            scanf("%d %d" , &a , &b) , monkey[a][b] = 1 , max_monkey = max(max_monkey , a) , max_banana = max(max_banana , b);
        for(int i = 0 ; i < n ; i ++ )
            scanf("%d %d" , &a , &b) ,banana[a][b] = 1 , max_place = max(max_place , b) ;
        for(int i = 1 ; i <= max_monkey ; i ++){
            memset(out , 0 , sizeof(out));
            for(int j = 1 ; j <= max_banana ; j ++){
                if(monkey[i][j]){
                    for(int k = 1 ; k <= max_place ; k ++ )
                        if(banana[j][k]) out[k] = 1 ;
                }
            }
            for(int j = 1 ; j <= max_place ; j ++ )
                if(out[j])  printf("%d %d\n" , i , j) ;
        }
        printf("\n");
    }
    return 0 ;
}