oj.uz

Submission #878905

# Submission time Handle Problem Language Result Execution time Memory
878905 2023-11-25T13:00:50 Z HuyQuang_re_Zero Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 3 ms 656 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#include "messy.h"
using namespace std;
/*
struct Interactive
{
    int n=4,p[4]={ 2,1,3,0 };
    map <string,bool> have;
    void add(string a)
    {
        string s="";
        for(int i=0;i<n;i++) s+=a[p[i]];
        have[s]=1;
    }
    bool check(string s) { return have[s]; }
} IR;
void add_element(string s) { IR.add(s); }
bool check_element(string s) { return IR.check(s); }
*/
int n,a[100005];
void Add(int l,int r)
{
    if(l==r) return ;
    int mid=(l+r)>>1,i;
    string s="";
    for(i=0;i<n;i++) s+="0";
    for(i=0;i<n;i++)
        if(i<l || i>r) s[i]='1';
    for(i=l;i<=mid;i++)
    {
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    Add(l,mid); Add(mid+1,r);
}
void Fill(int l,int r,vector <int> our)
{
    if(l==r) { a[our[0]]=l; return ; }
    vector <int> v1,v2;
    map <int,bool> have;
    for(int i:our) have[i]=1;
    string s="";
    int mid=(l+r)>>1,i;
    for(i=0;i<n;i++) s+="0";
    for(i=0;i<n;i++)
        if(have[i]==0) s[i]='1';
    for(int i:our)
    {
        s[i]='1';
        if(check_element(s)) v1.push_back(i);
        else v2.push_back(i);
        s[i]='0';
    }
    Fill(l,mid,v1); Fill(mid+1,r,v2);
}
vector <int> restore_permutation(int _n,int w,int r)
{
    n=_n;
    vector <int> vec,p;
    Add(0,n-1);
    compile_set();
    for(int i=0;i<n;i++) vec.push_back(i);
    Fill(0,n-1,vec);
    for(int i=0;i<n;i++) p.push_back(a[i]);
    return p;
}

/*
int main()
{
    freopen("messy.inp","r",stdin);
    freopen("messy.out","w",stdout);
    int n,w,r,p[105],i;
    cin>>n>>w>>r;
    restore_permutation(n,w,r,p);
    for(i=0;i<n;i++) cout<<p[i]<<" ";
}
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.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 0 ms 348 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 1 ms 348 KB n = 32
8 Correct 1 ms 372 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 0 ms 344 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 1 ms 504 KB n = 32
15 Correct 1 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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