oj.uz

Submission #993380

# Submission time Handle Problem Language Result Execution time Memory
993380 2024-06-05T14:23:07 Z Savu_Stefan_Catalin Prize (CEOI22_prize) C++14
0 / 100
 366 ms 17556 KB 
#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<=T;++i)
        cout<<1<<" "<<1<<'\n';
    cout.flush();
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 214 ms 9244 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 192 ms 9608 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 257 ms 8088 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 345 ms 16028 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 366 ms 17556 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -