oj.uz

Submission #569057

# Submission time Handle Problem Language Result Execution time Memory
569057 2022-05-26T14:32:10 Z losmi247 Unscrambling a Messy Bug (IOI16_messy) C++14
20 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
typedef long long ll;

int n,w,r;

vector <int> prvi(){
    add_element("11110000");
    add_element("11000000");
    add_element("00000011");
    add_element("10000000");
    add_element("00100000");
    add_element("00001000");
    add_element("00000010");

    compile_set();

    vector <int> ret(8,0);
    for(int i = 0; i < 8; i++) ret[i] = i;

    string s = "11110000";
    for(int i = 0; i < 4; i++){
        for(int j = 4; j < 8; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    s = "11000000";
    for(int i = 0; i < 2; i++){
        for(int j = 2; j < 4; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    s = "00000011";
    for(int i = 4; i < 6; i++){
        for(int j = 6; j < 8; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    //cout << "najmanji" << endl;

    s = "10000000";
    for(int i = 0; i < 1; i++){
        for(int j = 1; j < 2; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    s = "00100000";
    for(int i = 2; i < 3; i++){
        for(int j = 3; j < 4; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    s = "00001000";
    for(int i = 4; i < 5; i++){
        for(int j = 5; j < 6; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    s = "00000010";
    for(int i = 6; i < 7; i++){
        for(int j = 7; j < 8; j++){
            string h = s;
            swap(h[i],h[j]);
            if(check_element(h)){
                swap(ret[i],ret[j]);
                return ret;
            }
        }
    }

    return ret;
}

vector <int> restore_permutation(int N,int W,int R){
    n = N;
    w = W;
    r = R;

    if(n == 8 && w == 256 && r == 256){
        return prvi();
    }
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:119:1: warning: control reaches end of non-void function [-Wreturn-type]
  119 | }
      | ^

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 0 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 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 1 ms 212 KB n = 8

Subtask #2
0 / 18.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 ms 212 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 212 KB grader returned WA
2 Halted 0 ms 0 KB -