oj.uz

답안 #437015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437015 2021-06-25T16:06:00 Z model_code 레지스터 (IOI21_registers) C++17
33 / 100
 3 ms 620 KB 
#include "registers.h"

#include <bits/stdc++.h>
using namespace std;

constexpr int M = 100;
constexpr int B = 2000;

constexpr int kOne = M - 1;
constexpr int kOneTimesK = kOne - 1;

constexpr int kFirstBuffer = kOneTimesK - 1;
constexpr int kSecondBuffer = kFirstBuffer - 1;

// r[c] = min(r[a], r[b])
void take_min(int K, int a, int b, int c) {
  append_not(kFirstBuffer, b);
  append_add(kFirstBuffer, kFirstBuffer, kOne);  // r[kFirstBuffer] is 2s complement
                                          // of r[b]
  append_add(kFirstBuffer, a, kFirstBuffer);
  append_right(kFirstBuffer, kFirstBuffer, B - 1);  // r[kFirstBuffer] is 0 if
                                              // r[a] >= r[b], else 1
  for (int i = 1; i < K; ++i) {
    append_left(kSecondBuffer, kFirstBuffer, 1);
    append_or(kFirstBuffer, kFirstBuffer, kSecondBuffer);
  }

  // r[kFirstBuffer] is 0 if r[a] >= r[b], else 1 * K
  append_xor(kSecondBuffer, kFirstBuffer, kOneTimesK);
  // r[kSecondBuffer] is 0 if r[a] < r[b], else 1 * K

  append_and(kFirstBuffer, kFirstBuffer, a);  // r[kFirstBuffer] is 0 if
                                        // r[a] >= r[b], else r[a]
  append_and(kSecondBuffer, kSecondBuffer, b);  // r[kSecondBuffer] is 0 if
                                          // r[a] < r[b], else r[b]
  append_or(c, kFirstBuffer, kSecondBuffer);
}

void construct_instructions(int S, int N, int K, int Q) {
  vector<bool> v(B, false);
  v[0] = true;
  append_store(kOne, v);

  for (int i = 0; i < K; ++i) {
    v[i] = true;
  }
  append_store(kOneTimesK, v);

  append_move(2, 0);
  append_and(0, 0, kOneTimesK);
  for (int i = 1; i < N; ++i) {
    append_right(1, 2, i * K);
    append_and(1, 1, kOneTimesK);
    take_min(K, 0, 1, 0);
  }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 588 KB Output is correct

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Incorrect sorting
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Incorrect sorting
2 Halted 0 ms 0 KB -