oj.uz

Submission #799729

# Submission time Handle Problem Language Result Execution time Memory
799729 2023-07-31T21:26:35 Z Benmath Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 11 ms 508 KB 
#include <bits/stdc++.h>
 
#include "messy.h"
using namespace std;
std::vector<int> restore_permutation(int n, int w, int r) {
    vector<int>ans;
    for(int i=0;i<n;i++){
        ans.push_back(0);
    }
    queue<pair<int,int>>q;
    q.push({0,n-1});
    vector<string>cek;
    while(!q.empty()){
        pair<int,int>ro=q.front();
        q.pop();
        if((ro.second-ro.first)>=1){
            int a=ro.first;
            int b=ro.second;
            int ti=(a+b)/2;
            for(int i=a;i<=ti;i++){
                string s="";
 
                for(int j=0;j<a;j++){
                    s=s+'0';
                }
                for(int j=a;j<=b;j++){
                    if(j!=i){
                        s=s+'1';
                    }else{
                    s=s+'0';}
                }
                for(int j=b+1;j<n;j++){
                    s=s+'0';
                }
               // cout<<s<<endl;
add_element(s);
            }
q.push({a,ti});
q.push({ti+1,b});
        }
    }
    queue<pair<pair<int,int>,vector<int>>>q1;
vector<int>v;
for(int i=0;i<n;i++){
    v.push_back(i);
}
q1.push({{0,n-1},v});
 
compile_set();
while(!q1.empty()){
    pair<pair<int,int>,vector<int>>ro=q1.front();
    q1.pop();
    int a=ro.first.first;
    int b=ro.first.second;
    v=ro.second;
    if(a==b){
        ans[v[0]]=a;
    }else{
    vector<int>v1;
    vector<int>v2;
    int ti=(a+b)/2;
    int provjera[n];
    for(int i=0;i<n;i++){
        provjera[i]=0;
    }
    for(int i=0;i<v.size();i++){
        provjera[v[i]]++;
    }
    for(int i=0;i<n;i++){
        if(provjera[i]>0){
            string s1="";
            for(int j=0;j<n;j++){
                if(j==i){
                    s1=s1+'0';
                }else{
                if(provjera[j]==1){
                    s1=s1+'1';
                }else{
                s1=s1+'0';}
            }
        }
        if(check_element(s1)==true){
            v1.push_back(i);
        }else{
        v2.push_back(i);}
    }
    }
 
 
            q1.push({{a,ti},v1});
            q1.push({{ti+1,b},v2});
    }
}
 
    return ans;
 
}
/*
int main(){
    vector<int>ro=restore_permutation(16,12,12);
}
*/

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 212 KB n = 8
3 Correct 1 ms 296 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 1 ms 212 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 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 212 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 296 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 324 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 292 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 300 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 1 ms 212 KB n = 32
4 Correct 1 ms 304 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 212 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 #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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