oj.uz

답안 #973471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973471 2024-05-02T04:44:37 Z sleepntsheep Unscrambling a Messy Bug (IOI16_messy) C
100 / 100
 4 ms 2400 KB 
#include "messy_c.h"
#define N 128

void solve_add(int n, int w, int r, int x, int y)
{
    if (x == y) return;

    char ask[N+1]={0};

    for(int i=0;i<n;++i)ask[i]='0' + (i<x||i>y);

    int m = x+(y-x)/2;
    for(int i=x;i<=m;++i)
    {
        ask[i]='1';
        add_element(ask);
        ask[i]='0';
    }
    solve_add(n, w, r, x, m);
    solve_add(n, w, r, m+1, y);
}

void solve_restore(int n, int w, int r, int x, int y, int *mapped, int *result)
{
    if (x == y) { result[x] = mapped[0]; return; }

    char ask[N+1]={0};

    for(int i=0;i<n;++i)ask[i]='1';
    for(int i=x;i<=y;++i)ask[mapped[i-x]]='0';

    int nmapped[N],no=0,mmapped[N],mo=0;
    int m=x+(y-x)/2;

    for(int i=x;i<=y;++i)
    {
        ask[mapped[i-x]]='1';
        if(check_element(ask))
            nmapped[no++]=mapped[i-x];
        else
            mmapped[mo++]=mapped[i-x];
        ask[mapped[i-x]]='0';
    }
    solve_restore(n, w, r, x, m, nmapped, result);
    solve_restore(n, w, r, m+1, y, mmapped, result);
}

void restore_permutation(int n, int w, int r, int* result)
{
    solve_add(n, w, r, 0, n-1);
    compile_set();

    int mapped[N], iresult[N];
    for (int i = 0; i < n; ++i) mapped[i] = i;
    solve_restore(n, w, r, 0, n-1, mapped, iresult);
    for (int i=0;i<n;++i)result[iresult[i]]=i;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 32
2 Correct 1 ms 348 KB n = 32
3 Correct 0 ms 424 KB n = 32
4 Correct 0 ms 428 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 352 KB n = 32
7 Correct 0 ms 352 KB n = 32
8 Correct 0 ms 352 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 0 ms 344 KB n = 32
11 Correct 1 ms 348 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 408 KB n = 32
14 Correct 1 ms 348 KB n = 32
15 Correct 1 ms 348 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2136 KB n = 128
2 Correct 2 ms 2140 KB n = 128
3 Correct 2 ms 2140 KB n = 128
4 Correct 2 ms 2144 KB n = 128
5 Correct 2 ms 2400 KB n = 128
6 Correct 3 ms 2140 KB n = 128
7 Correct 2 ms 2140 KB n = 128
8 Correct 4 ms 2136 KB n = 128
9 Correct 3 ms 2396 KB n = 128
10 Correct 3 ms 2340 KB n = 128
11 Correct 2 ms 2140 KB n = 128
12 Correct 2 ms 2140 KB n = 128
13 Correct 2 ms 2140 KB n = 128
14 Correct 2 ms 2364 KB n = 128
15 Correct 2 ms 2140 KB n = 128

Subtask #5
30.0 / 30.0

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