oj.uz

Submission #143566

# Submission time Handle Problem Language Result Execution time Memory
143566 2019-08-14T15:57:31 Z MladenP Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 632 KB 
#include <vector>
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 130
#include "messy.h"
int N, P[MAXN], Q[MAXN];
void update(int l, int r) {
    if(l == r) return;
    string s = string(N, '0');
    for(int i = 1; i < l; i++) s[i-1] = '1';
    for(int i = N; i > r; i--) s[i-1] = '1';
    for(int i = l; i <= mid; i++) {
        s[i-1] = '1';
        add_element(s);
        s[i-1] = '0';
    }
    update(l, mid); update(mid+1, r);
}
vector<int> p, d;
void query(int l, int r) {
    if(l == r) return;
    p.clear(); d.clear();
    string s = string(N, '0');
    for(int i = 1; i < l; i++) s[P[i]] = '1';
    for(int i = N; i > r; i--) s[P[i]] = '1';
    for(int i = l; i <= r; i++) {
        s[P[i]] = '1';
        if(check_element(s)) p.pb(P[i]);
        else d.pb(P[i]);
        s[P[i]] = '0';
    }
    for(int i = l; i <= r; i++) {
        if(!p.empty()) P[i] = p.back(), p.pop_back();
        else P[i] = d.back(), d.pop_back();
    }
    query(l, mid); query(mid+1, r);
}
std::vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    update(1, N);
    compile_set();
    for(int i = 1; i <= N; i++) P[i] = i-1;
    query(1, N);
    vector<int> rez;
    for(int i = 0; i < N; i++) {
        for(int j = 1; j <= N; j++) {
            if(P[j] == i) rez.pb(j-1);
        }
    }
    return rez;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 256 KB n = 8
3 Correct 2 ms 376 KB n = 8
4 Correct 2 ms 376 KB n = 8
5 Correct 2 ms 376 KB n = 8
6 Correct 2 ms 256 KB n = 8
7 Correct 3 ms 256 KB n = 8
8 Correct 2 ms 376 KB n = 8
9 Correct 2 ms 376 KB n = 8
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 256 KB n = 8
15 Correct 2 ms 256 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 392 KB n = 32
2 Correct 2 ms 356 KB n = 32
3 Correct 2 ms 376 KB n = 32
4 Correct 2 ms 376 KB n = 32
5 Correct 2 ms 376 KB n = 32
6 Correct 2 ms 376 KB n = 32
7 Correct 3 ms 376 KB n = 32
8 Correct 3 ms 376 KB n = 32
9 Correct 2 ms 376 KB n = 32
10 Correct 2 ms 376 KB n = 32
11 Correct 2 ms 380 KB n = 32
12 Correct 2 ms 376 KB n = 32
13 Correct 3 ms 376 KB n = 32
14 Correct 2 ms 376 KB n = 32
15 Correct 2 ms 376 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB n = 32
2 Correct 2 ms 376 KB n = 32
3 Correct 2 ms 376 KB n = 32
4 Correct 2 ms 376 KB n = 32
5 Correct 2 ms 376 KB n = 32
6 Correct 2 ms 376 KB n = 32
7 Correct 2 ms 376 KB n = 32
8 Correct 2 ms 376 KB n = 32
9 Correct 2 ms 376 KB n = 32
10 Correct 2 ms 376 KB n = 32
11 Correct 2 ms 376 KB n = 32
12 Correct 2 ms 376 KB n = 32
13 Correct 2 ms 376 KB n = 32
14 Correct 2 ms 376 KB n = 32
15 Correct 2 ms 376 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB n = 128
2 Correct 4 ms 504 KB n = 128
3 Correct 4 ms 504 KB n = 128
4 Correct 4 ms 504 KB n = 128
5 Correct 4 ms 504 KB n = 128
6 Correct 4 ms 504 KB n = 128
7 Correct 4 ms 504 KB n = 128
8 Correct 4 ms 504 KB n = 128
9 Correct 4 ms 504 KB n = 128
10 Correct 4 ms 504 KB n = 128
11 Correct 4 ms 556 KB n = 128
12 Correct 4 ms 504 KB n = 128
13 Correct 4 ms 484 KB n = 128
14 Correct 4 ms 504 KB n = 128
15 Correct 3 ms 504 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB n = 128
2 Correct 4 ms 508 KB n = 128
3 Correct 4 ms 508 KB n = 128
4 Correct 4 ms 504 KB n = 128
5 Correct 4 ms 504 KB n = 128
6 Correct 4 ms 504 KB n = 128
7 Correct 4 ms 504 KB n = 128
8 Correct 4 ms 504 KB n = 128
9 Correct 3 ms 504 KB n = 128
10 Correct 4 ms 504 KB n = 128
11 Correct 4 ms 504 KB n = 128
12 Correct 4 ms 504 KB n = 128
13 Correct 4 ms 504 KB n = 128
14 Correct 4 ms 504 KB n = 128
15 Correct 4 ms 504 KB n = 128