oj.uz

Submission #395469

# Submission time Handle Problem Language Result Execution time Memory
395469 2021-04-28T11:37:17 Z jeroenodb Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 496 KB 
#include "bits/stdc++.h"
#include "messy.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
int N;
void queries(int l, int r) {
    if(l==r) return;
    int mid = (l+r)/2;
    for(int i=l;i<=mid;++i) {
        string q(N,'0');
        for(int j=l;j<=r;++j) {
            if(j!=i) q[j]++;
        }
        add_element(q);
    }
    queries(l,mid);
    queries(mid+1,r);
}
void get(int l, int r, vi got, vi& ans) {
    if(l==r) {
        ans[got[0]]=l;
        return;
    }
    vi left,right;
    for(int i: got) {
        string q(N,'0');
        for(int j: got) {
            if(i!=j) {
                q[j]++;
            }
        }
        if(check_element(q)) {
            left.push_back(i);
        } else right.push_back(i);
    }
    int mid = (l+r)/2;
    get(l,mid, left,ans);
    get(mid+1,r, right,ans);
}
std::vector<int> restore_permutation(int n, int w, int r) {
    N=n;
    queries(0,n-1);
    compile_set();
    vi got(n);
    iota(all(got),0);
    vi ans(n,-1);
    get(0,n-1,got,ans);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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