oj.uz

Submission #794287

# Submission time Handle Problem Language Result Execution time Memory
794287 2023-07-26T12:05:54 Z Khizri Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 508 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=200+5;
int n,arr[mxn];
void funk(int l,int r){
    int m=(l+r)/2;
    string s="";
    for(int i=0;i<n;i++){
        s+='1';
    }
    for(int i=l;i<=r;i++){
        s[i]='0';
    }
    for(int i=l;i<=m;i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    if(r-l==1) return;
    funk(l,m);
    funk(m+1,r);
}
void funk2(int l,int r,vector<int>vt){
    if(vt.size()==1){
        arr[l]=vt[0];
        return;
    }
    string s="";
    for(int i=0;i<n;i++){
        s+='1';
    }
    for(int v:vt){
        s[v]='0';
    }
    vector<int>x,y;
    for(int i=0;i<s.size();i++){
        if(s[i]=='1') continue;
        s[i]='1';
        if(check_element(s)){
            x.pb(i);
        }
        else{
            y.pb(i);
        }
        s[i]='0';
    }
    int m=(l+r)/2;
    funk2(l,m,x);
    funk2(m+1,r,y);
}
vector<int> restore_permutation(int N, int w, int r) {
    n=N;
    funk(0,n-1);
    compile_set();
    vector<int>vt;
    for(int i=0;i<n;i++){
        vt.pb(i);
    }
    funk2(0,n-1,vt);
    vector<int>ans(n);
    for(int i=0;i<n;i++){
        ans[arr[i]]=i;
    }
    return ans;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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