oj.uz

Submission #791857

# Submission time Handle Problem Language Result Execution time Memory
791857 2023-07-24T11:28:03 Z I_Love_EliskaM_ Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 1 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(x) x.begin(), x.end()
#define pi pair<int,int>
#define f first
#define s second

int N;
void encode(vector<int> s, vector<int> t) {
    if (s.size()==1) return;
    vector<int> s1,s2;
    int n=s.size();
    forn(i,n/2) s1.pb(s[i]), s2.pb(s[i+n/2]);
    string q(N,'0');
    for(auto&x:t) q[x]='1';
    for(auto&x:s1) {
        q[x]='1';
        add_element(q);
        q[x]='0';
    }
    for(auto&x:s2) t.pb(x);
    encode(s1,t);
    for(auto&x:s2) t.pop_back();
    for(auto&x:s1) t.push_back(x);
    encode(s2,t);
}

int ans[128];
void decode(vector<int> s, vector<int> t, int l, int r) {
    if (r-l==1) {
        ans[s[0]]=l;
        return;
    }
    int m=(l+r)>>1;
    vector<int> s1, s2;
    string q(N,'0');
    for(auto&x:t) q[x]='1';
    for(auto&x:s) {
        q[x]='1';
        int z=check_element(q);
        if (z) s1.pb(x);
        else s2.pb(x);
        q[x]='0';
    }
    for(auto&x:s2) t.pb(x);
    decode(s1,t,l,m);
    for(auto&x:s2) t.pop_back();
    for(auto&x:s1) t.push_back(x);
    decode(s2,t,m,r);
}

vector<int> restore_permutation(int n, int w, int r) {
    N=n;
    vector<int> s,t;
    forn(i,n) s.pb(i);
    encode(s,t);
    compile_set();
    decode(s,t,0,n);
    vector<int> z(n);
    forn(i,n) z[i]=ans[i];
    return z;
}

Compilation message

messy.cpp: In function 'void encode(std::vector<int>, std::vector<int>)':
messy.cpp:26:14: warning: unused variable 'x' [-Wunused-variable]
   26 |     for(auto&x:s2) t.pop_back();
      |              ^
messy.cpp: In function 'void decode(std::vector<int>, std::vector<int>, int, int)':
messy.cpp:50:14: warning: unused variable 'x' [-Wunused-variable]
   50 |     for(auto&x:s2) t.pop_back();
      |              ^

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 1 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 300 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 0 ms 296 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 304 KB n = 8
14 Correct 1 ms 212 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 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 212 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 300 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 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 0 ms 212 KB n = 32
4 Correct 1 ms 292 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 340 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 0 ms 212 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 0 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 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 424 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 1 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 404 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

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