Submission #794099

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
794099	2023-07-26T09:21:19 Z	Valaki2	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++14	0 / 100	1839 ms	24328 KB

encoder

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

#define pb push_back

vector<vector<int> > v;
bool voltemar;

int encode (int n, int x, int y) {
    if(!voltemar) {
        voltemar = true;
        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;
bool woltemar;

int decode (int n, int q, int h) {
	if(!woltemar) {
		woltemar = true;
		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.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1839 ms	24328 KB	wrong answer
2	Incorrect	1492 ms	24260 KB	wrong answer