oj.uz

Submission #894022

# Submission time Handle Problem Language Result Execution time Memory
894022 2023-12-27T19:55:10 Z Malix Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 856 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair

#include "messy.h"

int m=0;
vi ans;

void solve(int a, int b, string &s){
    REP(i,0,m)s[i]='1';
    REP(i,a,b)s[i]='0';
    REP(i,a,(a+b)/2){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
}

void check(int a, int b, string &s,vi &p){
    int g=p.size();
    REP(i,0,m)s[i]='1';
    REP(i,0,g)s[p[i]]='0';
    REP(i,0,g){
        s[p[i]]='1';
       // cout<<s<<" ";
        bool x=check_element(s);
        if(x==0)ans[p[i]]=(a+b)/2;
        s[p[i]]='0';
    }
}

std::vector<int> restore_permutation(int n, int w, int r) {
    string s;
    m=n;
    ans.resize(n,0);
    REP(i,0,n)s.PB('0');
    int k=n;
    int a=0,b=0;
    while(k>1){
        a=0;b=k;
        while(b<=n){
            solve(a,b,s);
            a+=k;b+=k;
        }
        k/=2;
    }
   // add_element("0");
    
    compile_set();

    k=n;vi p;
    while(k>1){
        a=0;b=k;
        while(b<=n){
            REP(i,0,n)if(ans[i]==a)p.PB(i);
            check(a,b,s,p);
            a+=k;b+=k;p.clear();
        }
        k/=2;
    }

    //check_element("0");
    return ans;
   // return std::vector<int>();
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 8
2 Correct 0 ms 348 KB n = 8
3 Correct 1 ms 348 KB n = 8
4 Correct 0 ms 348 KB n = 8
5 Correct 0 ms 432 KB n = 8
6 Correct 0 ms 348 KB n = 8
7 Correct 0 ms 344 KB n = 8
8 Correct 0 ms 344 KB n = 8
9 Correct 0 ms 344 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 1 ms 348 KB n = 8
14 Correct 0 ms 348 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 1 ms 344 KB n = 32
3 Correct 1 ms 344 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 1 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 432 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 0 ms 344 KB n = 32
11 Correct 0 ms 348 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 0 ms 348 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 0 ms 344 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 1 ms 344 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 1 ms 348 KB n = 32
11 Correct 0 ms 348 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 0 ms 436 KB n = 32
14 Correct 0 ms 344 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 604 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 600 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 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 1 ms 604 KB n = 128
13 Correct 1 ms 440 KB n = 128
14 Correct 1 ms 604 KB n = 128
15 Correct 1 ms 604 KB n = 128

Subtask #5
30.0 / 30.0

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