제출 #1229677

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

encoder

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

vi sis;
int prec = 0;
int encode (int n, int x, int y) {
  //S[x] --> bi tane altılı
  if (!prec) {
    prec = 1;
    for (int i = 0;i<(1<<12);i++) {
      if (__builtin_popcountll(i) == 6) {
        sis.push_back(i);
      } 
      if (big(sis) >= n) break;
    }
  }
  for (int i = 0;i<12;i++) {
    if ((sis[x-1]&(1<<i)) && !(sis[y-1]&(1<<i))) {
      return i+1;
    }
  }
}

decoder

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

vi sis;
int prec = 0;
int decode (int n, int q, int h) {
	if (!prec) { 
		prec = 1;
		for (int i = 0;i<(1<<12);i++) {
			if (__builtin_popcountll(i) == 6) sis.push_back(i);
			if (big(sis) >= n) break;
		}
	}
	return !!(sis[q-1]&(1<<(h-1)));
}

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

# 1번째 컴파일 단계

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

• Subtask 1: 100 / 100