Submission #794097

#	Time	Username	Problem	Language	Result	Execution time	Memory
794097		Valaki2	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++14	0 / 100	7055 ms	5548 KiB

encoder

#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<vector<int> > v;

int encode (int n, int x, int y) {
    v.clear();
    v.pb({});
    vector<int> subset = {0, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0};
    for(int i = 0; i < 924; i++) {
        v.pb(subset);
        // v.pb({42});
        /*int j = -1, cnt = 0;
        for(int i = 12; i >= 1; i--) {
            if(!subset[i]) {
                j = i;
                break;
            }
            cnt++;
        }
        for(; j >= 1; j--) {
            if(subset[j]) {
                subset[j] = false;
                for(int i = j + 1; i <= j + 1 + cnt; i++) {
                    subset[i] = true;
                }
                for(int i = j + 1 + cnt + 1; i <= 12; i++) {
                    subset[i] = false;
                }
                break;
            }
        }*/
        // next_permutation(subset.begin(), subset.end());
    }
    return 1;
    for(int i = 1; i <= 12; i++) {
        if(v[x][i] == -1 && v[y][i] == 0) {
            return i;
        }
    }
    return -1;
}

decoder

#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<vector<int> > w;

int decode (int n, int q, int h) {
	w.pb({});
    vector<int> subset = {0, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0};
    for(int i = 0; i < 924; i++) {
        w.pb(subset);
        /*int j = -1, cnt = 0;
        for(int i = 12; i >= 1; i--) {
            if(!subset[i]) {
                j = i;
                break;
            }
            cnt++;
        }
        for(; j >= 1; j--) {
            if(subset[j]) {
                subset[j] = false;
                for(int i = j + 1; i <= j + 1 + cnt; i++) {
                    subset[i] = true;
                }
                for(int i = j + 1 + cnt + 1; i <= 12; i++) {
                    subset[i] = false;
                }
                break;
            }
        }*/
        next_permutation(subset.begin(), subset.end());
    }
	return ((w[q][h] == -1) ? 1 : 0);
}

• Subtask 1: 0 / 100