제출 #993329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993329		Savu_Stefan_Catalin	Prize (CEOI22_prize)	C++14	0 / 100	601 ms	17348 KiB

Main

#include <iostream>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
const int NMAX=1e6+505;
int n,t[2][NMAX+5],k,q,T,id[NMAX+5],imp[NMAX+5];
pair<pair<int,int>,pair<int,int>> ras[NMAX+5];
void read(int ind)
{
    for (int i=1;i<=n;++i)
    {
        cin>>t[ind][i];
    }
}
signed main()
{
    cin>>n>>k>>q>>T;
    read(0);
    read(1);
    for (int i=1;i<=k;++i)
    {
        imp[i]=i;
        cout<<imp[i]<<" ";
    }
        cout<<'\n';
        cout.flush();
    for (int i=1;i<=k;++i)
    {
        id[i]=imp[i];
    }
    for (int i=1;i<k;++i)
    {
        cout<<"? "<<id[i]<<" "<<id[i+1]<<'\n';
    }
    cout<<"!"<<'\n';
    cout.flush();
    return 0;
}

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