Submission #618809

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
618809	2022-08-02 07:35:14	joelau	Vision Program (IOI19_vision)	C++14	100 / 100	46 ms	4536 KiB

vision

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> V,V1,V2,V3,V4;
 
void construct_network(int H, int W, int K) {
  int n = H*W;
  for (int k = -W+1; k < H; ++k) {
    V.clear();
    for (int i = 0; i < H; ++i) {
      int j = i-k;
      if (j >= 0 && j < W) V.push_back(i*W+j);
    }
    add_or(V); n++;
  }
  V.clear();
  for (int i = 0; i < H+W-1; ++i) V.push_back(H*W+i);
  add_xor(V); n++;
  V1.push_back(n-1); V3.push_back(n-1);
  for (int k = 0; k < H+W-1; ++k) {
    V.clear();
    for (int i = 0; i < H; ++i) {
      int j = k-i;
      if (j >= 0 && j < W) V.push_back(i*W+j);
    }
    add_or(V); n++;
  }
  V.clear();
  for (int i = 0; i < H+W-1; ++i) V.push_back(H*W+H+W+i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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