oj.uz

Submission #690667

# Submission time Handle Problem Language Result Execution time Memory
690667 2023-01-30T10:48:23 Z alexdd Mouse (info1cup19_mouse) C++17
5.99999 / 100
 146 ms 280 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
int n;
vector<int> p;
bool done[300];
void solve(int N)
{
    ///reseteaza chestii
    n=N;
    p.clear();
    for(int i=1;i<=n;i++)
    {
        done[i-1]=0;
        done[i]=0;
        p.push_back(i);
    }
    if(n<=2)
    {
        if(query(p)==n)
            return;
        swap(p[0],p[1]);
        if(query(p)==n)
            return;
    }
    while(1)
    {
        int x=query(p);
        if(x==n)
            return;
        if(x==0)
            break;
        random_shuffle(p.begin(),p.end());
    }
    int cur=0,aux;
    for(int i=0;i<n-2;i++)
    {
        if(done[i])
            continue;
        for(int j=i+1;j<n;j++)
        {
            if(done[j])
                continue;
            cur=query(p);
            ///verific daca p[j] ar trebui sa fie pe pozitia i
            swap(p[j],p[i]);
            aux=query(p);
            if(aux==n)
                return;
            if(aux==cur)///nu ii bine
                continue;
            else if(aux==cur+2)
            {
                done[i]=1;
                done[j]=1;
                cur=aux;
                break;
            }
            else if(aux==cur+1)
            {
                int ava=j+1;
                if(j+1>=n)
                    ava=j-1;
                swap(p[j],p[ava]);
                int cv=query(p);
                if(cv==n)
                    return;
                if(cv>=aux)
                {
                    swap(p[j],p[ava]);
                    done[i]=1;
                    cur=aux;
                    break;
                }
                else
                {
                    swap(p[j],p[ava]);
                    done[j]=1;
                    cur=aux;
                }
            }
        }
    }
    int x=query(p);
    if(x==n)
        return;
    swap(p[n-2],p[n-1]);
    x=query(p);
    if(x==n)
        return;
    while(query(p)<n)
        random_shuffle(p.begin(),p.end());
    return;
}

Subtask #1
5.999994 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct! Number of queries: 22
2 Correct 1 ms 208 KB Correct! Number of queries: 7
3 Correct 1 ms 208 KB Correct! Number of queries: 17
4 Correct 29 ms 208 KB Correct! Number of queries: 3349
5 Correct 1 ms 208 KB Correct! Number of queries: 30
6 Correct 1 ms 208 KB Correct! Number of queries: 31

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct! Number of queries: 22
2 Correct 1 ms 208 KB Correct! Number of queries: 7
3 Correct 1 ms 208 KB Correct! Number of queries: 17
4 Correct 29 ms 208 KB Correct! Number of queries: 3349
5 Correct 1 ms 208 KB Correct! Number of queries: 30
6 Correct 1 ms 208 KB Correct! Number of queries: 31
7 Correct 14 ms 208 KB Correct! Number of queries: 900
8 Runtime error 146 ms 280 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Correct! Number of queries: 22
2 Correct 1 ms 208 KB Correct! Number of queries: 7
3 Correct 1 ms 208 KB Correct! Number of queries: 17
4 Correct 29 ms 208 KB Correct! Number of queries: 3349
5 Correct 1 ms 208 KB Correct! Number of queries: 30
6 Correct 1 ms 208 KB Correct! Number of queries: 31
7 Correct 14 ms 208 KB Correct! Number of queries: 900
8 Runtime error 146 ms 280 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -