제출 #1228687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1228687		AlperenT_	Prize (CEOI22_prize)	C++20	0 / 100	361 ms	468 KiB

Main

#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{
        }
    }   
    rep(i ,1 , n){
        int v ;cin >> v; 
        if(v==-1){
            r2 =i ;
        }else{
        }
    }
    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

*/

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 19
• Subtask 4: 0 / 22
• Subtask 5: 0 / 24