oj.uz

Submission #881956

# Submission time Handle Problem Language Result Execution time Memory
881956 2023-12-02T10:21:29 Z JakobZorz Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 628 KB 
#include<vector>
#include<iostream>
#include"messy.h"
using namespace std;

string f;

vector<int>get_order(vector<int>arr){
    if(arr.size()==1)
        return arr;
    
    string str=f;
    for(int i:arr)
        str[i]='0';
    
    vector<int>arr1,arr2;
    for(int i:arr){
        str[i]='1';
        if(check_element(str)){
            arr1.push_back(i);
        }else{
            arr2.push_back(i);
        }
        str[i]='0';
    }
    
    vector<int>res1=get_order(arr1);
    vector<int>res2=get_order(arr2);
    //for(int&i:res2){
    //    i+=(int)res1.size();
    //}
    
    res1.insert(res1.end(),res2.begin(),res2.end());
    return res1;
}

vector<int>restore_permutation(int n,int _w,int _r){
    for(int i=0;i<n;i++)
        f.push_back('1');
    
    for(int p=2;p<=n;p+=p){
        for(int i=0;i<n;i+=p){
            string str=f;
            for(int j=i;j<i+p;j++){
                str[j]='0';
            }
            
            for(int j=i;j<i+(p/2);j++){
                str[j]='1';
                add_element(str);
                //cout<<"add: "<<str<<"\n";
                str[j]='0';
            }
        }
    }
    
    compile_set();
    
    vector<int>arr(n);
    for(int i=0;i<n;i++)
        arr[i]=i;
    vector<int>res=get_order(arr);
    vector<int>res2(n);
    for(int i=0;i<n;i++){
        res2[res[i]]=i;
    }
    return res2;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

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