oj.uz

Submission #755722

# Submission time Handle Problem Language Result Execution time Memory
755722 2023-06-10T15:23:50 Z DJeniUp Mouse (info1cup19_mouse) C++17
39.3333 / 100
 177 ms 288 KB 
#include "bits/stdc++.h"
#include "grader.h"

int query(vector<int> v);

typedef long long ll;
 
#define pb push_back
 
vector<int>v,a[5],h,l;
 
ll f[307];
 
void solve(int n){
    for(int i=1;i<=n;i++){
        v.pb(i);
    }
    for(int i=0;i<n*n;i++){
        ll x=(rand()+clock())%n;
        ll y=(rand()+clock())%n;
        swap(v[x],v[y]);
    }
    ll x=query(v);
    if(x==n)return ;
    for(int i=1;i<n;i++){
        swap(v[0],v[i]);
        ll y=query(v);
        a[y-x+2].pb(i);
        swap(v[0],v[i]);
    }
    if(a[2].size()==0 && a[3].size()==0 && a[4].size()==0){
        f[0]=1;
        for(auto it:a[0]){
            f[it]=1;
        }
    }else{
        for(auto it:a[1]){
            f[it]=1;
        }
        if(a[4].size()==1){
            swap(v[0],v[a[4][0]]);
            f[0]=1;
            f[a[4][0]]=1;
            x+=2;
        }else{
            swap(v[0],v[a[3][0]]);
            swap(v[0],v[a[3][1]]);
            ll y=query(v);
            if(y==n)return ;
            if(y-x==2){
                f[0]=1;
                f[a[3][0]]=1;
                x=y;
            }else if(y-x==3){
                f[0]=1;
                f[a[3][0]]=1;
                f[a[3][1]]=1;
                x=y;
            }else{
                swap(v[0],v[a[3][1]]);
                swap(v[0],v[a[3][0]]);
                
                swap(v[0],v[a[3][1]]);
                swap(v[0],v[a[3][0]]);
                y=query(v);
                if(y==n)return ;
                if(y-x==2){
                    f[0]=1;
                    f[a[3][1]]=1;
                    x=y;
                }else if(y-x==3){
                    f[0]=1;
                    f[a[3][0]]=1;
                    f[a[3][1]]=1;
                    x=y;
                }
            }
        }
    }
    h.pb(0);
    while(h.size()>0){
        h.clear();
        
        for(int i=0;i<n;i++){
            if(f[i]==0){
                h.pb(i);
                //cout<<i<<" ";
            }
        }
        
        
        ll z1=1;
        if(h.size()==2)z1=1;
        
        while(z1--){
            for(int i=h.size()-1;i>0;i--){
                swap(v[h[i-1]],v[h[i]]);
            }
            if(h.size()!=2)swap(v[h[0]],v[h[h.size()-1]]);
        }
        ll y=query(v);
        if(y==n)return ;
        if(x!=y){
            for(auto i:h){
                swap(v[0],v[i]);
                ll z=query(v);
                if(z-y==-2){
                    f[i]=1;
                }
                swap(v[0],v[i]);
            }
        }
    }
    return ;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct! Number of queries: 13
2 Correct 1 ms 208 KB Correct! Number of queries: 6
3 Correct 0 ms 208 KB Correct! Number of queries: 11
4 Correct 1 ms 208 KB Correct! Number of queries: 13
5 Correct 1 ms 208 KB Correct! Number of queries: 14
6 Correct 1 ms 208 KB Correct! Number of queries: 14

Subtask #2
26.333316 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct! Number of queries: 13
2 Correct 1 ms 208 KB Correct! Number of queries: 6
3 Correct 0 ms 208 KB Correct! Number of queries: 11
4 Correct 1 ms 208 KB Correct! Number of queries: 13
5 Correct 1 ms 208 KB Correct! Number of queries: 14
6 Correct 1 ms 208 KB Correct! Number of queries: 14
7 Correct 11 ms 208 KB Correct! Number of queries: 700
8 Correct 14 ms 208 KB Correct! Number of queries: 900
9 Correct 10 ms 208 KB Correct! Number of queries: 700
10 Correct 12 ms 208 KB Correct! Number of queries: 700
11 Correct 7 ms 208 KB Correct! Number of queries: 500
12 Correct 11 ms 208 KB Correct! Number of queries: 900
13 Correct 10 ms 208 KB Correct! Number of queries: 700
14 Correct 14 ms 208 KB Correct! Number of queries: 800
15 Correct 14 ms 208 KB Correct! Number of queries: 900
16 Correct 14 ms 208 KB Correct! Number of queries: 900

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct! Number of queries: 13
2 Correct 1 ms 208 KB Correct! Number of queries: 6
3 Correct 0 ms 208 KB Correct! Number of queries: 11
4 Correct 1 ms 208 KB Correct! Number of queries: 13
5 Correct 1 ms 208 KB Correct! Number of queries: 14
6 Correct 1 ms 208 KB Correct! Number of queries: 14
7 Correct 11 ms 208 KB Correct! Number of queries: 700
8 Correct 14 ms 208 KB Correct! Number of queries: 900
9 Correct 10 ms 208 KB Correct! Number of queries: 700
10 Correct 12 ms 208 KB Correct! Number of queries: 700
11 Correct 7 ms 208 KB Correct! Number of queries: 500
12 Correct 11 ms 208 KB Correct! Number of queries: 900
13 Correct 10 ms 208 KB Correct! Number of queries: 700
14 Correct 14 ms 208 KB Correct! Number of queries: 800
15 Correct 14 ms 208 KB Correct! Number of queries: 900
16 Correct 14 ms 208 KB Correct! Number of queries: 900
17 Runtime error 177 ms 288 KB Execution killed with signal 13
18 Halted 0 ms 0 KB -