제출 #666503

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
6665032022-11-28 18:53:21rainboyAncient Machine (JOI21_ancient_machine)C++17
100 / 100
66 ms7688 KiB
#include "Anna.h"
#include <cassert>
#include <vector>
using namespace std;
typedef vector<char> str;
namespace A {
const int N = 100001, K = 63, L = 44, M = 70000;
long long ff[K + 1];
void init() {
ff[0] = 1, ff[1] = 2;
for (int i = 2; i <= K; i++)
ff[i] = ff[i - 1] + ff[i - 2];
assert(1LL << L >= ff[K] && (N + K - 1) / K * L <= M);
}
}
void encode(str aa, int n) {
for (int i = 0; i < n; i += A::K) {
long long x = 0;
for (int j = 0; j < A::K && i + j < n; j++)
if (aa[i + j] == 1)
x += A::ff[j];
for (int l = 0; l < A::L; l++)
Send(x >> l & 1);
}
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...