제출 #1334981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1334981		SulA	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++20	100 / 100	740 ms	39860 KiB

encoder

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

vector<int> josip[1000];

int encode(int n, int x, int y) {
    if (josip[1].empty()) {
        vector<int> b = {0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1};
        for (int i = 1; i <= 920; i++) {
            josip[i] = b;
            ranges::next_permutation(b);
        }
    }
    for (int p = 0; p < 12; p++) {
        if (josip[x][p] && !josip[y][p]) {
            return p+1;
        }
    }
}

decoder

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

vector<int> josip[1000];

int decode(int n, int q, int h) {
    if (josip[1].empty()) {
        vector<int> b = {0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1};
        for (int i = 1; i <= 920; i++) {
            josip[i] = b;
            ranges::next_permutation(b);
        }
    }
    return josip[q][h-1];
}

컴파일 시 표준 에러 (stderr) 메시지

# 1번째 컴파일 단계

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

• Subtask 1: 100 / 100