oj.uz

Submission #52427

# Submission time Handle Problem Language Result Execution time Memory
52427 2018-06-25T23:41:27 Z polyfish Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 512 KB 
//I love armpit fetish
#include "messy.h"

#include <bits/stdc++.h>
using namespace std;

#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';
#define PR0(A, n) cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';
#define FILE_NAME ""

void add(int l, int r, int n) {
    if (l==r)
        return;
    string s;
    for (int i=0; i<n; ++i)
        s += '0';
    int mid = (l+r)/2;
    for (int i=l; i<=r; ++i)
        s[i] = '1';
    for (int i=l; i<=mid; ++i) {
        s[i] = '0';
        //cerr << s << '\n';
        add_element(s);
        s[i] = '1';
    }
    add(l, mid, n);
    add(mid+1, r, n);
}

void Find(int l, int r, int n, vector<int> p, vector<int> &res) {
    if (l==r) {
        res[p[0]] = l;
        return;
    }
    string s;
    vector<int> p1, p2;
    for (int i=0; i<n; ++i)
        s += '0';
    for (int i=0; i<p.size(); ++i)
        s[p[i]] = '1';
    for (int i=0; i<p.size(); ++i) {
        //cerr << p[i] << '\n';
        s[p[i]] = '0';
        //cerr << s << '\n';
        if (check_element(s))
            p1.push_back(p[i]);
        else
            p2.push_back(p[i]);
        s[p[i]] = '1';
    }
    int mid = (l + r) / 2;
    Find(l, mid, n, p1, res);
    Find(mid+1, r, n, p2, res);
}

vector<int> restore_permutation(int n, int w, int r) {
    add(0, n-1, n);
    compile_set();
    vector<int> p, res(n);
    for (int i=0; i<n; ++i)
        p.push_back(i);
    Find(0, n-1, n, p, res);
    return res;
}

Compilation message

messy.cpp: In function 'void Find(int, int, int, std::vector<int>, std::vector<int>&)':
messy.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<p.size(); ++i)
                   ~^~~~~~~~~
messy.cpp:43:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<p.size(); ++i) {
                   ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 8
2 Correct 2 ms 384 KB n = 8
3 Correct 2 ms 384 KB n = 8
4 Correct 2 ms 256 KB n = 8
5 Correct 2 ms 256 KB n = 8
6 Correct 2 ms 384 KB n = 8
7 Correct 2 ms 384 KB n = 8
8 Correct 2 ms 384 KB n = 8
9 Correct 2 ms 256 KB n = 8
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 384 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 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 256 KB n = 32
8 Correct 2 ms 384 KB n = 32
9 Correct 2 ms 256 KB n = 32
10 Correct 2 ms 384 KB n = 32
11 Correct 2 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 #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 2 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 3 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 484 KB n = 128
14 Correct 3 ms 512 KB n = 128
15 Correct 3 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 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 3 ms 512 KB n = 128