oj.uz

답안 #541801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541801 2022-03-24T12:27:03 Z status_coding Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

string s;
vector<int> ans;

void genQuery(int st, int dr)
{
    if(st == dr)
        return;

    int mij=(st+dr)/2;

    for(int i=st; i<=mij; i++)
    {
        s[i]='1';
        //cout<<s<<'\n';
        add_element(s);
        s[i]='0';
    }

    for(int i=mij+1; i<=dr; i++)
        s[i]='1';

    genQuery(st, mij);

    for(int i=mij+1; i<=dr; i++)
        s[i]='0';
    for(int i=st; i<=mij; i++)
        s[i]='1';

    genQuery(mij+1, dr);
}

void genAns(int st, int dr, vector<int> v)
{
    /*
    cout<<st<<' '<<dr<<":\n";
    for(int it : v)
        cout<<it<<' ';
    cout<<"\n\n";
    */

    if(st == dr)
    {
        ans[ v[0] ] = st;
        return;
    }

    int mij=(st+dr)/2;

    vector<int> vL, vR;
    for(int it : v)
    {
        s[it]='1';
        //cout<<"query "<<s<<' ';

        if(check_element(s))
        {
            //cout<<"da\n";
            vL.push_back(it);
        }
        else
        {
            //cout<<"nu\n";
            vR.push_back(it);
        }

        s[it]='0';
    }

    //cout<<'\n';

    for(int it : vR)
        s[it]='1';

    genAns(st, mij, vL);

    for(int it : vR)
        s[it]='0';
    for(int it : vL)
        s[it]='1';

    genAns(mij+1, dr, vR);
}

vector<int> restore_permutation(int n, int w, int r)
{
    s.resize(n);
    ans.resize(n);

    for(int i=0; i<n; i++)
        s[i]='0';

    genQuery(0, n-1);

    compile_set();

    for(int i=0; i<n; i++)
        s[i]='0';

    vector<int> aux;
    for(int i=0;i<n;i++)
        aux.push_back(i);

    genAns(0, n-1, aux);
    return ans;
}

/*
8 24 24
0 1 7 5 2 4 3 6
*/

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 0 ms 304 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 1 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 340 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 296 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 300 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 300 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 304 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 308 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 1 ms 308 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB n = 128
2 Correct 2 ms 468 KB n = 128
3 Correct 2 ms 436 KB n = 128
4 Correct 2 ms 428 KB n = 128
5 Correct 2 ms 428 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 2 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 428 KB n = 128
15 Correct 2 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 2 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 2 ms 432 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 432 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 436 KB n = 128