oj.uz

Submission #1080527

# Submission time Handle Problem Language Result Execution time Memory
1080527 2024-08-29T10:45:10 Z Mihailo Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 604 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#include "messy.h"

int N;
vector<int> pp;

void start(int l, int r) {
    if(l==r) return;
    string s="";
    for(int i=0; i<l; i++) s+='1';
    for(int i=l; i<=r; i++) s+='0';
    for(int i=r+1; i<N; i++) s+='1';
    int m=(l+r)/2;
    for(int i=l; i<=m; i++) {
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    start(l, m);
    start(m+1, r);
}

void finish(int l, int r, vector<int> ostali, vector<int> ovde) {
    //cout<<l<<' '<<r<<' '<<ovde.size()<<' '<<ostali.size()<<'\n';
    if(l==r) {
        pp[ovde[0]]=l;
        return;
    }
    string s="";
    vector<int> a, b;
    for(int i=0; i<N; i++) s+='0';
    for(int i:ostali) s[i]='1';
    for(int i:ovde) {
        s[i]='1';
        if(check_element(s)) {
            a.pb(i);
        }
        else {
            b.pb(i);
        }
        s[i]='0';
    }
    for(int i=0; i<b.size(); i++) {
        ostali.pb(b[i]);
    }
    int m=(l+r)/2;
    finish(l, m, ostali, a);
    for(int i=0; i<b.size(); i++) {
        ostali.pop_back();
    }
    for(int i=0; i<a.size(); i++) {
        ostali.pb(a[i]);
    }
    finish(m+1, r, ostali, b);
}

vector<int> restore_permutation(int n, int w, int r) {
    N=n;
    for(int i=0; i<N; i++) pp.pb(-1);
    start(0, N-1);
    compile_set();
    vector<int> v, em;
    for(int i=0; i<N; i++) v.pb(i);
    finish(0, N-1, em, v);
    return pp;
}

Compilation message

messy.cpp: In function 'void finish(int, int, std::vector<int>, std::vector<int>)':
messy.cpp:45:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i=0; i<b.size(); i++) {
      |                  ~^~~~~~~~~
messy.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i=0; i<b.size(); i++) {
      |                  ~^~~~~~~~~
messy.cpp:53:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i=0; i<a.size(); i++) {
      |                  ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB n = 8
2 Correct 0 ms 440 KB n = 8
3 Correct 0 ms 344 KB n = 8
4 Correct 0 ms 432 KB n = 8
5 Correct 0 ms 348 KB n = 8
6 Correct 0 ms 344 KB n = 8
7 Correct 1 ms 348 KB n = 8
8 Correct 1 ms 348 KB n = 8
9 Correct 0 ms 348 KB n = 8
10 Correct 0 ms 348 KB n = 8
11 Correct 0 ms 600 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 ms 348 KB n = 8
15 Correct 1 ms 344 KB n = 8

Subtask #2
18.0 / 18.0

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