oj.uz

Submission #655990

# Submission time Handle Problem Language Result Execution time Memory
655990 2022-11-06T08:15:25 Z evenvalue Vision Program (IOI19_vision) C++17
100 / 100
 63 ms 7012 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

using int64 = long long;
using ld = long double;

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;

struct foo {
  int black1;
  int black2;
};

int check(const vector<foo> &a, const int k) {
  auto add = [&](deque<int> &d, const int i) {
    d.push_back(i);
  };

  auto rem = [&](deque<int> &d, const int i) {
    assert(d.front() == i);
    d.pop_front();
  };

  auto get_vec = [&](deque<int> &d) -> vector<int> {
    return {d.begin(), d.end()};
  };

  deque<int> one;
  deque<int> two;

  for (int i = 0; i < k; i++) {
    add(one, a[i].black1);
    add(two, a[i].black2);
  }

  vector<int> consider;
  for (int i = k; i < a.size(); i++) {
    add(one, a[i].black1);
    add(two, a[i].black2);

    const int x = add_or(get_vec(one));
    const int y = add_xor(get_vec(one));
    const int z = add_xor(get_vec(two));
    consider.push_back(add_xor({x, y, z}));

    rem(one, a[i - k].black1);
    rem(two, a[i - k].black2);
  }

  assert(not consider.empty());
  return add_or(consider);
}

void construct_network(int H, int W, int K) {
  if (H * W == 2) {
    assert(K == 1);
    add_and({0, 1});
    return;
  }

  auto cell = [&](const int row, const int col) {
    assert(0 <= row and row < H);
    assert(0 <= col and col < W);
    return row * W + col;
  };

  vector<foo> left_diagonal(H + W - 1);
  for (int sum = 0; sum < H + W - 1; sum++) {
    vector<int> cells;
    for (int r = 0, c = sum; r < H; r++, c--) {
      if (0 > c or c >= W) continue;
      cells.push_back(cell(r, c));
    }
    left_diagonal[sum].black1 = add_or(cells);
    left_diagonal[sum].black2 = add_xor({
        left_diagonal[sum].black1,
        add_xor(cells)
    });
  }

  vector<foo> right_diagonal(H + W - 1);
  for (int diff = 1 - W; diff < H; diff++) {
    vector<int> cells;
    for (int r = 0, c = r - diff; r < H; r++, c++) {
      if (0 > c or c >= W) continue;
      cells.push_back(cell(r, c));
    }
    right_diagonal[diff + W - 1].black1 = add_or(cells);
    right_diagonal[diff + W - 1].black2 = add_xor({
        right_diagonal[diff + W - 1].black1,
        add_xor(cells)
    });
  }

  const int w = check(left_diagonal, K);
  const int x = check(right_diagonal, K);
  const int y = check(left_diagonal, K - 1);
  const int z = check(right_diagonal, K - 1);

  add_and({
      add_and({w, x}),
      add_not(add_and({y, z}))
  });
}

Compilation message

vision.cpp: In function 'int check(const std::vector<foo>&, int)':
vision.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<foo>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for (int i = k; i < a.size(); i++) {
      |                   ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 14 ms 1728 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 3 ms 592 KB Output is correct
43 Correct 6 ms 976 KB Output is correct
44 Correct 13 ms 1792 KB Output is correct
45 Correct 19 ms 2008 KB Output is correct
46 Correct 12 ms 1620 KB Output is correct
47 Correct 5 ms 724 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 11 ms 1492 KB Output is correct
3 Correct 12 ms 1396 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 10 ms 1376 KB Output is correct
7 Correct 13 ms 1268 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 10 ms 1236 KB Output is correct
11 Correct 11 ms 1468 KB Output is correct
12 Correct 11 ms 1492 KB Output is correct
13 Correct 9 ms 1108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 10 ms 1284 KB Output is correct
17 Correct 13 ms 1492 KB Output is correct
18 Correct 15 ms 1492 KB Output is correct
19 Correct 9 ms 1108 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 6 ms 880 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 10 ms 1364 KB Output is correct
10 Correct 11 ms 1492 KB Output is correct
11 Correct 10 ms 1176 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 10 ms 1328 KB Output is correct
15 Correct 10 ms 1312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 12 ms 1400 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 16 ms 1488 KB Output is correct
21 Correct 35 ms 3816 KB Output is correct
22 Correct 29 ms 3560 KB Output is correct
23 Correct 9 ms 1236 KB Output is correct
24 Correct 11 ms 1488 KB Output is correct
25 Correct 33 ms 3980 KB Output is correct
26 Correct 9 ms 1108 KB Output is correct
27 Correct 19 ms 2468 KB Output is correct
28 Correct 47 ms 5840 KB Output is correct
29 Correct 59 ms 6868 KB Output is correct
30 Correct 47 ms 5592 KB Output is correct
31 Correct 16 ms 2004 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2476 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 11 ms 1460 KB Output is correct
8 Correct 12 ms 1488 KB Output is correct
9 Correct 18 ms 2504 KB Output is correct
10 Correct 0 ms 224 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 468 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 14 ms 1728 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 4 ms 724 KB Output is correct
42 Correct 3 ms 592 KB Output is correct
43 Correct 6 ms 976 KB Output is correct
44 Correct 13 ms 1792 KB Output is correct
45 Correct 19 ms 2008 KB Output is correct
46 Correct 12 ms 1620 KB Output is correct
47 Correct 5 ms 724 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 11 ms 1492 KB Output is correct
50 Correct 12 ms 1396 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Correct 3 ms 596 KB Output is correct
53 Correct 10 ms 1376 KB Output is correct
54 Correct 13 ms 1268 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 10 ms 1236 KB Output is correct
58 Correct 11 ms 1468 KB Output is correct
59 Correct 11 ms 1492 KB Output is correct
60 Correct 9 ms 1108 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 3 ms 596 KB Output is correct
63 Correct 10 ms 1284 KB Output is correct
64 Correct 13 ms 1492 KB Output is correct
65 Correct 15 ms 1492 KB Output is correct
66 Correct 9 ms 1108 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 3 ms 596 KB Output is correct
73 Correct 6 ms 880 KB Output is correct
74 Correct 7 ms 852 KB Output is correct
75 Correct 5 ms 724 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 5 ms 724 KB Output is correct
78 Correct 10 ms 1364 KB Output is correct
79 Correct 11 ms 1492 KB Output is correct
80 Correct 10 ms 1176 KB Output is correct
81 Correct 4 ms 596 KB Output is correct
82 Correct 3 ms 596 KB Output is correct
83 Correct 10 ms 1328 KB Output is correct
84 Correct 10 ms 1312 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 3 ms 596 KB Output is correct
87 Correct 12 ms 1400 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 16 ms 1488 KB Output is correct
90 Correct 35 ms 3816 KB Output is correct
91 Correct 29 ms 3560 KB Output is correct
92 Correct 9 ms 1236 KB Output is correct
93 Correct 11 ms 1488 KB Output is correct
94 Correct 33 ms 3980 KB Output is correct
95 Correct 9 ms 1108 KB Output is correct
96 Correct 19 ms 2468 KB Output is correct
97 Correct 47 ms 5840 KB Output is correct
98 Correct 59 ms 6868 KB Output is correct
99 Correct 47 ms 5592 KB Output is correct
100 Correct 16 ms 2004 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 21 ms 2476 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 3 ms 596 KB Output is correct
106 Correct 4 ms 724 KB Output is correct
107 Correct 2 ms 596 KB Output is correct
108 Correct 2 ms 596 KB Output is correct
109 Correct 11 ms 1460 KB Output is correct
110 Correct 12 ms 1488 KB Output is correct
111 Correct 18 ms 2504 KB Output is correct
112 Correct 0 ms 224 KB Output is correct
113 Correct 0 ms 212 KB Output is correct
114 Correct 56 ms 5908 KB Output is correct
115 Correct 2 ms 340 KB Output is correct
116 Correct 3 ms 596 KB Output is correct
117 Correct 21 ms 2644 KB Output is correct
118 Correct 22 ms 2860 KB Output is correct
119 Correct 56 ms 6852 KB Output is correct
120 Correct 59 ms 6908 KB Output is correct
121 Correct 56 ms 6912 KB Output is correct
122 Correct 63 ms 6904 KB Output is correct
123 Correct 22 ms 2456 KB Output is correct
124 Correct 47 ms 5832 KB Output is correct
125 Correct 57 ms 7012 KB Output is correct
126 Correct 58 ms 6976 KB Output is correct
127 Correct 47 ms 5704 KB Output is correct
128 Correct 15 ms 2004 KB Output is correct