oj.uz

Submission #259800

# Submission time Handle Problem Language Result Execution time Memory
259800 2020-08-08T15:12:13 Z uacoder123 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 640 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
vi v;
void init(int l,int r,int n)
{
    if(l==r)
        return;
    int m=(l+r)/2;
    string s;
    for(int i=0;i<n;++i)
    {
        if(i<l||i>r)
            s+="1";
        else
            s+="0";
    }
    for(int i=l;i<=m;++i)
    {
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    init(l,m,n);
    init(m+1,r,n);
}
void solve(int l,int r,string s,int n)
{
    if(l==r)
    {
        for(int i=0;i<n;++i)
        {
            if(s[i]=='0')
            {
                v[i]=l;
                break;
            }
        }
        return;
    }
    string s1=s,s2=s;
    for(int i=0;i<n;++i)
    {
        if(s[i]!='1')
        {
            s[i]='1';
            if(check_element(s))
                s2[i]='1';
            else
                s1[i]='1';
            s[i]='0';
        }
    }
    int m=(l+r)/2;
    solve(l,m,s1,n);
    solve(m+1,r,s2,n);
}
std::vector<int> restore_permutation(int n, int w, int r) {
    init(0,n-1,n);
    compile_set();
    string s;
    for(int i=0;i<n;++i)
    {
        v.pb(0);
        s+="0";
    }
    solve(0,n-1,s,n);
    return v;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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