oj.uz

Submission #965599

# Submission time Handle Problem Language Result Execution time Memory
965599 2024-04-19T02:24:16 Z maomao90 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 768 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "messy.h"
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 130;

int n;
vi ans;

void encode(int l, int r, int tl, int tr) {
    int m = l + r >> 1;
    string s(n, '0');
    REP (i, tl, tr) {
        s[i] = '1';
    }
    REP (i, l, m) {
        string t = s;
        t[i] = '1';
        add_element(t);
    }
    if (l + 1 < r) {
        encode(l, m, m, r); encode(m, r, l, m);
    }
}
void decode(int l, int r, vi vt, vi id) {
    if (l + 1 == r) {
        ans[id[0]] = l;
        return;
    }
    int m = l + r >> 1;
    string s(n, '0');
    for (int i : vt) {
        s[i] = '1';
    }
    vi lv, rv;
    for (int i : id) {
        string t = s;
        t[i] = '1';
        if (check_element(t)) {
            lv.pb(i);
        } else {
            rv.pb(i);
        }
    }
    decode(l, m, rv, lv); decode(m, r, lv, rv);
}

vi restore_permutation(int N, int W, int R) {
    n = N;
    encode(0, n, 0, 0);
    compile_set();
    vi id(n);
    iota(ALL(id), 0);
    ans = vi(n);
    decode(0, n, vi(), id);
    return ans;
}

Compilation message

messy.cpp: In function 'void encode(int, int, int, int)':
messy.cpp:45:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |     int m = l + r >> 1;
      |             ~~^~~
messy.cpp: In function 'void decode(int, int, vi, vi)':
messy.cpp:64:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |     int m = l + r >> 1;
      |             ~~^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n = 32
2 Correct 1 ms 348 KB n = 32
3 Correct 0 ms 348 KB n = 32
4 Correct 0 ms 364 KB n = 32
5 Correct 0 ms 360 KB n = 32
6 Correct 1 ms 344 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 1 ms 352 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 1 ms 444 KB n = 32
11 Correct 1 ms 360 KB n = 32
12 Correct 1 ms 360 KB n = 32
13 Correct 0 ms 360 KB n = 32
14 Correct 0 ms 356 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 2 ms 760 KB n = 128
3 Correct 1 ms 600 KB n = 128
4 Correct 2 ms 436 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 608 KB n = 128
7 Correct 1 ms 432 KB n = 128
8 Correct 1 ms 600 KB n = 128
9 Correct 2 ms 504 KB n = 128
10 Correct 1 ms 600 KB n = 128
11 Correct 1 ms 604 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 600 KB n = 128
15 Correct 1 ms 604 KB n = 128