oj.uz

Submission #217547

# Submission time Handle Problem Language Result Execution time Memory
217547 2020-03-30T08:26:28 Z anonymous Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 8 ms 640 KB 
#include <vector>
#include<string>
#include "messy.h"
using namespace std;
int N;
vector<int> Ans;

void add(int l, int r) {
    if (l == r) {return;}
    string s;
    int mid = (l + r) >> 1;
    for (int i=0; i<N; i++) {
        if (l <= i && i <= r) {
            s.push_back('0');
        } else {
            s.push_back('1');
        }
    }
    for (int i=l; i<=mid; i++) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    add(l, mid);
    add(mid+1,r);
}

void slv(int l, int r, vector<bool> Not) {
    if (l == r) {
        for (int i=0; i<N; i++) {
            if (!Not[i]) {Ans[i]=l;}
        }
    } else {
        string s;
        vector<bool> NotL=Not, NotR=Not;
        int mid = (l + r) >> 1;
        for (int i=0; i<N; i++) {
            if (Not[i]) {
                s.push_back('1');
            } else {
                s.push_back('0');
            }
        }
        for (int i=0; i<N; i++) {
            if (!Not[i]) {
                s[i] = '1';
                if (check_element(s)) { 
                    NotR[i] = true;
                } else {
                    NotL[i] = true;
                }
                s[i] = '0';
            }
        }
        slv(l, mid, NotL);
        slv(mid+1, r, NotR);
    }
}

vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    vector<bool> Not;
    for (int i=0; i<N; i++) {
        Not.push_back(0);
        Ans.push_back(0);
    }
    add(0, N-1);
    compile_set();
    slv(0, N-1, Not);
    return(Ans);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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