제출 #1010235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010235		kunzaZa183	Vision Program (IOI19_vision)	C++17	44 / 100	5 ms	2516 KiB

vision

#include "vision.h"

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

int width;

int val(int a, int b) { return a * width + b; }

void construct_network(int H, int W, int K) {
  width = W;
  vector<int> lastone;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      vector<int> vi;
      // cout << i << " " << j << "\n";
      for (int k = 0; k <= K; k++)
        if (i + k >= 0 && i + k < H) {
          if (j + K - k >= 0 && j + K - k < W) {
            // cout << i + k << " " << j + K - k << "  ";
            vi.push_back(val(i + k, j + K - k));
          }
          if (j - (K - k) >= 0 && j - (K - k) < W) {
            // cout << i + k << " " << j - (K - k) << "  ";
            vi.push_back(val(i + k, j - (K - k)));
          }
        }
      // cout << "\n\n";
      if (vi.size() >= 2) {
        int x = add_or(vi);
        vi.clear();
        vi.push_back(x);
        vi.push_back(val(i, j));
        lastone.push_back(add_and(vi));
      } else if (vi.size() == 1) {
        vi.push_back(val(i, j));
        lastone.push_back(add_and(vi));
      }
    }
  }
  add_or(lastone);
}

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