oj.uz

Submission #437020

# Submission time Handle Problem Language Result Execution time Memory
437020 2021-06-25T16:06:18 Z model_code Bit Shift Registers (IOI21_registers) C++17
21 / 100
 1 ms 332 KB 
#include "registers.h"

#include <vector>

const int M = 100;
const int B = 2000;

void construct_instructions(int, int n, int k, int) {
  std::vector<bool> v(B);
  for (; (n & -n) != n; ++n) {
    for (int i = 0; i < k; ++i) {
      v[n*k + i] = true;
    }
  }
  append_store(1, v); append_or(0, 0, 1);

  for (int len = 1; len < n; len <<= 1) {
    std::vector<bool> oddMask(B), evenMask(B), ones(B);
    for (int i = 0; i < n; ++i) {
      if (i % len != 0) continue;
      if (i & len) {
        for (int j = 0; j < k; ++j) oddMask[i*k + j] = true;
      } else {
        for (int j = 0; j < k; ++j) evenMask[i*k + j] = true;
        ones[i*k] = 1;
      }
    }
    const int kEvenReg = M - 3, kOddReg = M - 2, kOnesReg = M - 1;
    append_store(kEvenReg, evenMask); append_store(kOddReg, oddMask); append_store(kOnesReg, ones);

    const int kEvenPos = 1, kOddPos = 2;
    append_and(kEvenPos, kEvenReg, 0); append_and(kOddPos, kOddReg, 0); append_right(kOddPos, kOddPos, k * len);

    const int kOddNeg = 3;
    append_xor(kOddNeg, kOddPos, kEvenReg); append_add(kOddNeg, kOnesReg, kOddNeg);

    const int kAddPos = 4;
    // The bug is here, missing one more AND command
    append_add(kAddPos, kEvenPos, kOddNeg); append_right(kAddPos, kAddPos, k);
    
    append_add(kAddPos, kAddPos, kEvenReg); append_and(kEvenPos, kEvenPos, kAddPos);
    append_xor(kAddPos, kAddPos, kEvenReg); append_and(kOddPos, kOddPos, kAddPos);

    append_or(0, kOddPos, kEvenPos);
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect min value
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Incorrect 1 ms 332 KB Incorrect min value
5 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect sorting
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Incorrect sorting
2 Halted 0 ms 0 KB -