Submission #836594

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
836594	2023-08-24 13:12:48	happypotato	Vision Program (IOI19_vision)	C++17	100 / 100	13 ms	1904 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;
#define pb push_back
void construct_network(int n, int m, int k) {
  if (n * m == 2) {
    add_and({0, 1});
    return;
  }
  const int ZERO = add_and({0, 1, 2});
  const int ONE = add_not(ZERO);
  function<int(void)> add_zero = [&]() -> int { return add_and({ZERO}); };
  function<int(void)> add_one = [&]() -> int { return add_and({ONE}); };
  function<int(int, int)> hash = [&](int x, int y) -> int {
    return x * m + y;
  };
  function<bool(int, int)> valid = [&](int x, int y) -> bool {
    return ((0 <= x && x < n) && (0 <= y && y < m));
  };
  
  // stores position of min in range [st, en]
  function<int(int, int)> findmin = [&](int st, int en) -> int {
    int diff = en - st + 1;
    int prev = add_zero();
    for (int i = 1; i < 8; i++) add_zero();
    vector<int> allprev;
    int prevtakexor = add_zero();
    for (int cur = 1; cur <= diff; cur++) { // from min
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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