# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1228686 | AlperenT_ | Prize (CEOI22_prize) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define pii pair<ll,ll>
#define all(a) a.begin(),a.end()
#define S second
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld long double
#define ll long long
using namespace std ;
const int maxn = 2e6 + 10 , lg = 25 , maxk = 100 + 10 , inf = 1e9+ 10 , mod = 1e9 + 9 ;
int r1 , r2 , n , q , t ,k ;
signed main(){
cin>> n >> k >> q >> t ;
rep(i , 1, n){
int v;
cin >> v ;
if(v==-1){
r1 =i ;
}else{
G[0][v].pb(i);
}
}
rep(i ,1 , n){
int v ;cin >> v;
if(v==-1){
r2 =i ;
}else{
G[1][v].pb(i) ;
}
}
rep(i ,1 , k)cout << i << " " ;
cout << endl;
rep(i ,1, q){
cout << "? " << 1 << " " << 2 << endl ;
}
cout << "!" << endl ;
rep(i ,1, t){
int x, y ;
cin >> x >> y ;
cout << 0 << " " << 0 << "\n";
}
}
/*
9 3 2 3
2 -1 2 1 1 5 1 4 5
9 4 5 5 7 3 -1 3 7
10 0 0 1
0 3 13 5
2 1
1 4
2 4
*/