oj.uz

Submission #405133

# Submission time Handle Problem Language Result Execution time Memory
405133 2021-05-15T18:20:42 Z MDario Unscrambling a Messy Bug (IOI16_messy) C++11
100 / 100
 3 ms 460 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#include "messy.h"
vector<int> v;
void fw(ll lf, ll rf, ll n){
    if(rf-lf+1<=2)return;
    string s, s1;
    for(int i=0; i<n; i++){
        s.push_back('0');
        s1.push_back('0');
    }
    for(int i=lf; i<=(lf+rf)/2; i++){
        s[i]='1';
    }
    for(int i=(lf+rf)/2+1; i<=rf; i++){
        s1[i]='1';
    }
    for(int i=lf; i<=(lf+(lf+rf)/2)/2; i++){
        s1[i]='1';
        add_element(s1);
        s1[i]='0';
    }
    for(int i=(lf+rf)/2+1; i<=((lf+rf)/2+1+rf)/2; i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    fw(lf, (lf+rf)/2, n);
    fw((lf+rf)/2+1, rf, n);
    return ;
}
void fr(vector<int>v1, vector<int> v2, ll lf, ll rf, ll n){
    if(rf-lf+1==2){
        v[v1[0]]=lf;
        v[v2[0]]=rf;
        return;
    }
    string s, s1;
    for(int i=0; i<n; i++){
        s.push_back('0');
        s1.push_back('0');
    }
    for(int i=0; i<v1.size(); i++){
        s[v1[i]]='1';
    }
    for(int i=0; i<v2.size(); i++){
        s1[v2[i]]='1';
    }
    vector<int> v3, v4;
    for(int i=0; i<v2.size(); i++){
        s[v2[i]]='1';
        if(check_element(s))v3.push_back(v2[i]);
        else v4.push_back(v2[i]);
        s[v2[i]]='0';
    }
    fr(v3, v4, (lf+rf)/2+1, rf, n);
    v3.clear();
    v4.clear();
    for(int i=0; i<v1.size(); i++){
        s1[v1[i]]='1';
        if(check_element(s1))v3.push_back(v1[i]);
        else v4.push_back(v1[i]);
        s1[v1[i]]='0';
    }
    fr(v3, v4, lf, (lf+rf)/2, n);
    return ;
}
vector<int> restore_permutation(int n, int w, int r) {
    string s;
    for(int i=0; i<n; i++){
        s.push_back('0');
        v.push_back(0);
    }
    for(int i=0; i<n/2; i++){
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    fw(0, n-1, n);
    compile_set();
    vector<int> v1, v2;
    for(int i=0; i<n; i++){
        s[i]='1';
        if(check_element(s))v1.push_back(i);
        else v2.push_back(i);
        s[i]='0';
    }
    fr(v1, v2, 0, n-1, n);
    return v;
}

Compilation message

messy.cpp: In function 'void fr(std::vector<int>, std::vector<int>, ll, ll, ll)':
messy.cpp:46:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0; i<v1.size(); i++){
      |                  ~^~~~~~~~~~
messy.cpp:49:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int i=0; i<v2.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<v2.size(); i++){
      |                  ~^~~~~~~~~~
messy.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i=0; i<v1.size(); i++){
      |                  ~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 1 ms 204 KB n = 8
3 Correct 1 ms 204 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 296 KB n = 8
8 Correct 1 ms 204 KB n = 8
9 Correct 1 ms 204 KB n = 8
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 332 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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