답안 #477126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477126 2021-09-30T17:13:52 Z JvThunder 레지스터 (IOI21_registers) C++17
75 / 100
1 ms 332 KB
#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
 
const int B = 2000;
void construct_instructions(int S, int N, int K, int Q) 
{ 
	{
		vector<bool> tmp(B);
		fill(tmp.begin()+N*K, tmp.end(), true);
		append_store(1, tmp);
		append_or(0, 0, 1);
	}
 
	int L = 8*sizeof(N) - __builtin_clz(N-1);
	N = (1 << L);
 
	const int K_MSK_OFF = 90;
	for (int p = 0; p < L; p++) {
		vector<bool> tmp(B);
		tmp[0] = true;
		for (int i = 0; (i+1)*K < B; i ++) tmp[(i+1)*K] = !((i >> p) & 1);
		append_store(K_MSK_OFF+p, tmp);
	}
	for (int z = 0; z < L; z++) {
		for (int p = z; p >= 0; p--) {
			append_right(1, 0, (1 << p) * K);
			append_xor(2, 0, 1);
			append_not(3, 0);
			append_add(3, 3, 1);
			append_xor(3, 3, 2);
			if (z+1 < L) {
				append_xor(3, 3, K_MSK_OFF + z+1);
				append_not(3, 3);
			}
			append_and(3, 3, K_MSK_OFF + p);
			append_right(4, 3, K);
			append_not(4, 4);
			append_add(3, 3, 4);
			append_and(2, 2, 3);
			append_xor(0, 0, 2);
			append_left(2, 2, (1 << p) * K);
			append_xor(0, 0, 2);
		}
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct