Submission #1051146

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051146		Halit	Vision Program (IOI19_vision)	C++17	100 / 100	24 ms	6116 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>

void construct_network(int H, int W, int K) { 
  std::vector<std::vector<int>> a(H+W-1), b(H+W-1);
  for (int i = 0;i < H; ++i) {
    for (int j = 0;j < W; ++j) {
      a[i +  j].push_back(i * W + j);
      b[W - j - 1 + i].push_back(i * W + j);
    }     
  }
  std::vector<std::vector<int>> diagonal(2);
  std::vector<std::vector<int>> diagonal_xor(2);
  for (int i = 0;i < H+W-1; ++i) {
    diagonal[0].push_back(add_or(a[i]));
    diagonal[1].push_back(add_or(b[i]));
    diagonal_xor[0].push_back(add_xor(a[i]));
    diagonal_xor[1].push_back(add_xor(b[i]));
  }
  std::vector<std::vector<int>> ends(2);
  for (int d = 0;d < 2; ++d) {
    for (int i = 0;i+K < H+W-1; ++i) {
      std::vector<int> test = {diagonal[d][i], diagonal[d][i+K]};
      ends[d].push_back(add_and(test));
    }
  }
  std::vector<int> results;
  ++K;
  for (int d = 0;d < 2; ++d) {
    for (int i = 0;i+K <= H+W-1; ++i) {
      std::vector<int> area_or, area_xor;
      for (int j = i;j < i+K; ++j) {
        area_or.push_back(diagonal[d^1][j]);
        area_xor.push_back(diagonal_xor[d^1][j]);
      }
      int aor = add_or(area_or);
      int axor = add_xor(area_xor);
      int notxor = add_not(axor);
      results.push_back(add_and({add_or(ends[d]), add_and({aor, notxor})}));
    }
  }
  add_or(results);
  return;
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 15 / 15
• Subtask 5: 12 / 12
• Subtask 6: 8 / 8
• Subtask 7: 14 / 14
• Subtask 8: 19 / 19