oj.uz

Submission #650409

# Submission time Handle Problem Language Result Execution time Memory
650409 2022-10-13T16:55:49 Z rafatoa Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 4 ms 468 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#pragma GCC optimize ("Ofast")
 
#define double ld
const int inf = 2e9;
const int INF = 4e18;
const int mod = 1e9+7;
 
#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define vvb vector<vb>
#define pb push_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
#define rs resize
#define as assign
#define vc vector<char>
#define vvc vector<vc>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
#define ppb pop_back
#define MP make_pair
 
// #define int ll
void add_element(string x);
void compile_set();
bool check_element(string x);
 
vi restore_permutation(int n, int w, int r){
    vi p(n);

    function<void(int, int)> add = [&](int l, int r){
        if(l == r) return;
        for(int j=l; j<l+(r-l+1)/2; j++){
            string s;
            for(int i=0; i<n; i++)
                if(i < l || i > r || i == j) s += '1';
                else s += '0';
            add_element(s);
        }
        add(l, l+(r-l+1)/2-1);
        add(l+(r-l+1)/2, r);
    };

    add(0, n-1);

    compile_set();

    function<void(int, int, vi)> solve = [&](int l, int r, vi v){
        if(l == r){
            p[v[0]] = l;
            return;
        }
        vi a, b;
        for(auto &x:v){
            string s;
            for(int i=0; i<n; i++){
                if(i != x && binary_search(all(v), i)) s += '0';
                else s += '1';
            }
            if(check_element(s)) a.pb(x);
            else b.pb(x);
        }
        solve(l, l+(r-l+1)/2-1, a);
        solve(l+(r-l+1)/2, r, b);
    };

    vi v(n); iota(all(v), 0);
    solve(0, n-1, v);

    return p;
}
 
/*stolen stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * READ CONSTRAINTS
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
    * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

messy.cpp:9:17: warning: overflow in conversion from 'double' to 'int' changes value from '4.0e+18' to '2147483647' [-Woverflow]
    9 | const int INF = 4e18;
      |                 ^~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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