oj.uz

Submission #31722

# Submission time Handle Problem Language Result Execution time Memory
31722 2017-09-02T10:31:18 Z top34051 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 5 ms 640 KB 
#include "messy.h"
#include<bits/stdc++.h>
using namespace std;

string s;
vector<int> pos[900], perm, ans;

void init(int n,int l,int r) {
    if(l==r) return ;
    int mid = (l+r)/2;
    for(int i=0;i<n;i++) s[i] = '1';
    for(int i=l;i<=r;i++) s[i] = '0';
    for(int i=l;i<=mid;i++) {
        s[i] = '1';
//        cout << "add_element: " << s << endl;
        add_element(s);
        s[i] = '0';
    }
    init(n,l,mid); init(n,mid+1,r);
}

void query(int n,int now,int l,int r) {
//    printf("query %d %d\n",l,r);
    if(l==r) {
        perm[l] = pos[now][0];
        return ;
    }
    int mid = (l+r)/2;
    for(int i=0;i<n;i++) s[i] = '1';
    for(int i=0;i<pos[now].size();i++) s[pos[now][i]] = '0';
    for(int i=0;i<pos[now].size();i++) {
        int x = pos[now][i];
        s[x] = '1';
        int temp = check_element(s);
//        cout << "check_element: " << s << " = " << temp << endl;
        s[x] = '0';
        if(temp==1) pos[now<<1].push_back(x);
        else pos[now<<1|1].push_back(x);
    }
    query(n,now<<1,l,mid); query(n,now<<1|1,mid+1,r);
}

std::vector<int> restore_permutation(int n, int w, int r) {
    for(int i=0;i<n;i++) s += "0";
    init(n,0,n-1);
    compile_set();
    for(int i=0;i<n;i++) perm.push_back(-1), pos[1].push_back(i);
    query(n,1,0,n-1);
    for(int i=0;i<n;i++) ans.push_back(-1);
    for(int i=0;i<n;i++) ans[perm[i]] = i;
    return ans;
}

Compilation message

messy.cpp: In function 'void query(int, int, int, int)':
messy.cpp:30:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<pos[now].size();i++) s[pos[now][i]] = '0';
                 ~^~~~~~~~~~~~~~~~
messy.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<pos[now].size();i++) {
                 ~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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