oj.uz

Submission #711423

# Submission time Handle Problem Language Result Execution time Memory
711423 2023-03-16T23:44:52 Z Jovan26 Unscrambling a Messy Bug (IOI16_messy) C++14
38 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

#include "messy.h"

using namespace std;

#define pb push_back
void display(vector<string> v){
    for(auto u:v){
        cout<<u<<" ";
    }
    cout<<endl;
}

std::vector<int> restore_permutation(int n, int w, int r) {
   // vector<string> v;
    int tr = 1;
    for(int i=0;i<n-1;i++){
        string s = "";
        for(int j=0;j<tr;j++){
            s.pb('1');
        }
        for(int j=tr;j<n;j++){
            s.pb('0');
        }
        //v.pb(s);
        add_element(s);
        tr++;
    }
    compile_set();
    //cout<<'x'<<endl;
    int pp[n] = {};
    for(int i=1;i<n;i++){
        string s = "";
        for(int j=0;j<n;j++) s.pb('1');
        for(int j=0;j<n;j++){
            if(pp[j]) s[j] = '0';
        }
        vector<int> ind;
        for(int j=0;j<n;j++){
            if(s[j]=='1') ind.pb(j);
        }
        for(int j=0;j<ind.size();j++){
            s[ind[j]] = '0';
            bool x = check_element(s);
            //if(i==1 && x) cout<<s<<endl;
            if(x){
                pp[ind[j]] = n-i;
                break;
            }
            s[ind[j]] = '1';
        }
    }
    //or(int i=0;i<n;i++) cout<<pp[i]<<" ";
    vector<int> p(n,0);
    //p.resize(n);
    for(int i=0;i<n;i++){
        p[i] = pp[i];
    }
    //display(p);
    return p;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 300 KB n = 32
4 Correct 1 ms 212 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 340 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 300 KB n = 32

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -