제출 #1230822

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1230822		rxlfd314	레지스터 (IOI21_registers)	C++20	21 / 100	0 ms	328 KiB

registers

#include "registers.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;
using arl2 = array<ll, 2>;
using arl3 = array<ll, 3>;
template <class T> using vt = vector<T>;
#define all(x) begin(x), end(x)
#define size(x) (int((x).size()))
#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

constexpr int M = 100, B = 2000;

void construct_instructions(int s, int n, int k, int q) {
  if (s || n != 2 || k > 2)
    return;
  if (k == 1) {
    append_move(1, 0);
    append_right(0, 0, 1);
    append_left(1, 1, B-1);
    append_right(1, 1, B-1);
    append_and(0, 0, 1);
    return;
  }
  append_move(1, 0);
  append_move(2, 0);
  append_move(3, 0);
  append_right(0, 0, 3);
  append_left(1, 1, B-3);
  append_right(1, 1, B-1);
  append_left(2, 2, B-2);
  append_right(2, 2, B-1);
  append_left(3, 3, B-1);
  append_right(3, 3, B-1);
  #ifdef DEBUG
  append_print(0);
  append_print(1);
  append_print(2);
  append_print(3);
  #endif
  append_or(4, 0, 1);
  append_or(5, 2, 3);
  append_xor(6, 0, 2);
  append_and(7, 1, 3);
  append_and(8, 0, 2);
  append_left(8, 8, 1);
  append_or(0, 6, 7);
  append_and(0, 0, 4);
  append_and(0, 0, 5);
  append_or(0, 0, 8);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 25
• Subtask 5: 0 / 13
• Subtask 6: 0 / 29