oj.uz

답안 #742464

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742464 2023-05-16T09:36:59 Z boyliguanhan Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 468 KB 
#include <vector>
#define PB push_back
#define For(i,j,k,l) for(int i = j; i < k; i+=l)
#define Rfor(i,j) for(auto i: j)
#include "messy.h"
#define clr(x) l[x*2]=l[x],R[x*2+1]=R[x],R[x*2]=l[x]+R[x]>>1,l[x*2+1]=R[x*2]+1;
using namespace std;
#define N 520
int l[N], R[N], dis[N];
vector<int> pos[N];
std::vector<int> restore_permutation(int n, int w, int r) {
    R[1] = n-1, R[0] = -1;
    For(i,1,n,1) clr(i);
    For(i, 2, 2*n,2) {
        if(i>2) dis[i] = i-1;
        string str(n, '0');
        For(j, l[dis[i]], 1+R[dis[i]],1) str[j] = '1';
        For(j,l[i],1+R[i],1) {
            string str2 = str;
            str2[j] = '1';
            add_element(str2);
        }
    }
    compile_set();
    For(i,0,n,1) pos[1].PB(i);
    For(i,2,2*n,2) {
        string str(n, '0');
        Rfor(j,pos[dis[i]]) str[j] = '1';
        Rfor(j,pos[i/2]) {
            string str2=str;
            str2[j] = '1';
            if(check_element(str2)) pos[i].PB(j);
            else pos[i+1].PB(j);
        }
    }
    vector<int> res(n);
    For(i,n,2*n,1) res[pos[i][0]] = i-n;
    return res;
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:6:53: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    6 | #define clr(x) l[x*2]=l[x],R[x*2+1]=R[x],R[x*2]=l[x]+R[x]>>1,l[x*2+1]=R[x*2]+1;
      |                                                 ~~~~^~~~~
messy.cpp:13:18: note: in expansion of macro 'clr'
   13 |     For(i,1,n,1) clr(i);
      |                  ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 316 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 1 ms 316 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 1 ms 320 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 212 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 316 KB n = 8
15 Correct 1 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB n = 32
2 Correct 1 ms 340 KB n = 32
3 Correct 1 ms 340 KB n = 32
4 Correct 1 ms 340 KB n = 32
5 Correct 1 ms 340 KB n = 32
6 Correct 1 ms 340 KB n = 32
7 Correct 1 ms 340 KB n = 32
8 Correct 1 ms 340 KB n = 32
9 Correct 1 ms 340 KB n = 32
10 Correct 1 ms 340 KB n = 32
11 Correct 1 ms 340 KB n = 32
12 Correct 1 ms 340 KB n = 32
13 Correct 1 ms 340 KB n = 32
14 Correct 1 ms 320 KB n = 32
15 Correct 1 ms 304 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 448 KB n = 128
4 Correct 2 ms 468 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 3 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 2 ms 432 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 2 ms 448 KB n = 128
12 Correct 2 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 2 ms 444 KB n = 128
15 Correct 2 ms 448 KB n = 128

Subtask #5
30.0 / 30.0

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