oj.uz

Submission #643403

# Submission time Handle Problem Language Result Execution time Memory
643403 2022-09-22T02:05:28 Z kebine Zagonetka (COI18_zagonetka) C++17
9 / 100
 8 ms 208 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const ll MOD=1e9+7;
using namespace std;
ll N,a[105];
int main(){
  cin>>N;
  for(int i=1;i<=N;i++){
    cin>>a[i];
  }
  if(N<=6){
    ll p[105],minn[105],maks[105];
    for(int i=1;i<=N;i++){
      p[i]=i;
      minn[i]=a[i];
      maks[i]=a[i];
    }
    do{
      cout<<"query";
      for(int i=1;i<=N;i++){
        cout<<' '<<p[i];
      }
      cout<<endl;
      ll x;
      cin>>x;
      if(x==1){
        for(int i=1;i<=N;i++){
          if(p[i]<minn[i]){
//            cout<<"update minn"<<endl;
            for(int j=1;j<=N;j++){
              minn[j]=p[j];
            }
            break;
          }
          if(p[i]>minn[i]){
            break;
          }
        }
        for(int i=1;i<=N;i++){
          if(p[i]>maks[i]){
//            cout<<"update maks"<<endl;
            for(int j=1;j<=N;j++){
              maks[j]=p[j];
            }
            break;
          }
          if(p[i]<maks[i]){
            break;
          }
        }  
      }
    }while(next_permutation(p+1,p+N+1));
    cout<<"end"<<endl;
    for(int i=1;i<=N;i++){
      cout<<minn[i]<<' ';
    }
    cout<<endl;
    for(int i=1;i<=N;i++){
      cout<<maks[i]<<' ';
    }
    cout<<endl;
  }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 8 ms 208 KB Output is correct
6 Correct 8 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -