This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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();
for (int i=1;i<k;++i)
{
cin>>ras[i].first.first>>ras[i].first.second>>ras[i].second.first>>ras[i].second.second;
}
for (int i=1;i<=T;++i)
{
int x,y;
cin>>x>>y;
}
for (int i=1;i<=T;++i)
cout<<1<<" "<<1<<'\n';
cout.flush();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |