oj.uz

답안 #824627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824627 2023-08-14T08:22:19 Z vnm06 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

int N;
string s;
void fill_set(int le, int ri)
{
    if(ri-le==1)
    {
        s[le]='1';
        ///cout<<s<<endl;
        add_element(s);
        s[le]='0';
        return;
    }
    else
    {
        int mid=(le+ri)/2;
        for(int i=le; i<=mid; i++)
        {
            s[i]='1';
        ///cout<<s<<endl;
            add_element(s);
            s[i]='0';
        }
        for(int i=le; i<=mid; i++) s[i]='1';
        fill_set(mid+1, ri);
        for(int i=le; i<=mid; i++) s[i]='0';
        s[ri]='1';
        fill_set(le, mid);
        s[ri]='0';
    }

}

vector<int> res, res2;

void solve_res(int le, int ri)
{
    if(ri-le==1)
    {
        s[res[le]]='1';
        bool ans=check_element(s);
        s[res[le]]='0';
        if(!ans) swap(res[le], res[ri]);
        return;
    }
    int id=le;
    for(int i=le; i<=ri; i++)
    {
        s[res[i]]='1';
        bool ans=check_element(s);
        s[res[i]]='0';
        if(ans) {swap(res[id], res[i]); id++;}
    }
    int mid=(le+ri)/2;
    for(int i=le; i<=mid; i++) s[res[i]]='1';
    solve_res(mid+1, ri);
    for(int i=le; i<=mid; i++) s[res[i]]='0';
    s[res[ri]]='1';
    solve_res(le, mid);
    s[res[ri]]='0';
}

std::vector<int> restore_permutation(int n, int w, int r)
{
    N=n;
    s.resize(n, '0');
    fill_set(0, N-1);
    compile_set();
    ///cout<<endl;
    s.resize(n, '0');
    for(int i=0; i<N; i++) res.push_back(i);
    solve_res(0, N-1);
    res2.resize(N);
    for(int i=0; i<N; i++) res2[res[i]]=i;
    return res2;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 0 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 0 ms 300 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 300 KB n = 32
8 Correct 0 ms 340 KB n = 32
9 Correct 0 ms 304 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 1 ms 212 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 0 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 1 ms 288 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 0 ms 304 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 300 KB n = 32
9 Correct 1 ms 296 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 #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 424 KB n = 128
3 Correct 1 ms 436 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 424 KB n = 128
6 Correct 1 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 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 400 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 448 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 2 ms 424 KB n = 128
9 Correct 1 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 1 ms 468 KB n = 128
15 Correct 1 ms 428 KB n = 128