oj.uz

Submission #541641

# Submission time Handle Problem Language Result Execution time Memory
541641 2022-03-24T00:03:08 Z abeker Vision Program (IOI19_vision) C++17
100 / 100
 18 ms 1772 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;

//-1 = FALSE, -2 = TRUE

const int B = 15;

int my_add_or(vector <int> v) {
  vector <int> tmp;
  for (auto it : v)
    if (it >= 0)
      tmp.push_back(it);
    else if (it == -2)
      return -2;
  return tmp.empty() ? -1 : add_or(tmp);
}

int my_add_and(vector <int> v) {
  vector <int> tmp;
  for (auto it : v)
    if (it >= 0)
      tmp.push_back(it);
    else if (it == -1)
      return -1;
  return tmp.empty() ? -2 : add_and(tmp);
}

int my_add_not(int x) {
  if (x < 0)
    return -3 - x;
  return add_not(x);
}

int my_add_nor(vector <int> v) {
  return my_add_not(my_add_or(v));
}

vector <int> solve(vector <int> a) {
  int N = a.size();
  vector <vector <int>> pref(B);
  for (int i = 0; i < N; i++)
    pref[i % B].push_back(i < B ? a[i] : my_add_or({pref[i % B].back(), a[i]}));
  vector <int> inv;
  vector <vector <int>> residue_pair(B, vector <int> (B));
  for (int i = 0; i < B; i++)
    for (int j = 0; j < B; j++)
      if (i != j) {
        int cnt = 0;
        vector <int> tmp;
        for (int k = 0; k < N; k++) {
          if (k % B == j && cnt)
            tmp.push_back(my_add_and({pref[i][cnt - 1], a[k]}));
          if (k % B == i)
            cnt++;
        }
        residue_pair[i][j] = my_add_or(tmp);
        if (i > j)
          inv.push_back(residue_pair[i][j]);
      }
  for (int i = 0; i < B; i++) {
    vector <int> tmp;
    for (int j = 0; j < B; j++)
      if (j != i && !pref[j].empty())
        tmp.push_back(pref[j].back());
    residue_pair[i][i] = my_add_nor(tmp);
  }
  vector <int> block(B);
  for (int i = 0; i < B; i++) {
    vector <int> tmp;
    for (int j = 0; j < B; j++)
      if (i * B + j < N)
        tmp.push_back(a[i * B + j]);
    block[i] = my_add_or(tmp);
  }
  vector <vector <int>> block_pair(B, vector <int> (B));
  for (int i = 0; i < B - 1; i++)
    for (int j = i + 1; j < B; j++)
      block_pair[i][j] = my_add_and({block[i], block[j]});
  for (int i = 0; i < B; i++) {
    vector <int> tmp;
    for (int j = 0; j < B; j++)
      if (j != i)
        tmp.push_back(block[j]);
    block_pair[i][i] = my_add_nor(tmp);
  }
  int carry = my_add_or(inv);
  int no_carry = my_add_not(carry);
  vector <int> residue_diff(B);
  for (int i = 0; i < B; i++) {
    vector <int> tmp;
    for (int j = 0; j < B; j++)
      tmp.push_back(residue_pair[j][(i + j) % B]);
    residue_diff[i] = my_add_or(tmp);
  }
  vector <int> block_diff(B);
  for (int i = 0; i < B; i++) {
    vector <int> option1, option2;
    for (int j = 0; j < B - i; j++) {
      option1.push_back(block_pair[j][i + j]);
      if (j < B - i - 1)
        option2.push_back(block_pair[j][i + j + 1]);
    }
    block_diff[i] = my_add_or({my_add_and({my_add_or(option1), no_carry}), my_add_and({my_add_or(option2), carry})});
  }
  vector <int> res(N);
  for (int i = 0; i < N; i++)
    res[i] = my_add_and({block_diff[i / B], residue_diff[i % B]});
  return res;
}

void construct_network(int H, int W, int K) {
  vector <int> row(H);
  for (int i = 0; i < H; i++) {
    vector <int> tmp(W);
    for (int j = 0; j < W; j++)
      tmp[j] = i * W + j;
    row[i] = my_add_or(tmp);
  }
  vector <int> col(W);
  for (int j = 0; j < W; j++) {
    vector <int> tmp(H);
    for (int i = 0; i < H; i++)
      tmp[i] = i * W + j;
    col[j] = my_add_or(tmp);
  }
  vector <int> combs;
  vector <int> row_diff = solve(row);
  vector <int> col_diff = solve(col);
  for (int i = 0; i <= K; i++)
    if (i < H && K - i < W)
      combs.push_back(my_add_and({row_diff[i], col_diff[K - i]}));
  my_add_or(combs);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 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 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 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 340 KB Output is correct
27 Correct 1 ms 340 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 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 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 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 576 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 6 ms 724 KB Output is correct
44 Correct 6 ms 724 KB Output is correct
45 Correct 5 ms 812 KB Output is correct
46 Correct 6 ms 724 KB Output is correct
47 Correct 6 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 3 ms 560 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 4 ms 596 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 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 1 ms 212 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 4 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 6 ms 724 KB Output is correct
9 Correct 4 ms 684 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 3 ms 560 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 8 ms 1232 KB Output is correct
21 Correct 8 ms 1104 KB Output is correct
22 Correct 9 ms 1080 KB Output is correct
23 Correct 8 ms 1104 KB Output is correct
24 Correct 9 ms 1156 KB Output is correct
25 Correct 11 ms 1196 KB Output is correct
26 Correct 8 ms 1104 KB Output is correct
27 Correct 13 ms 1704 KB Output is correct
28 Correct 13 ms 1744 KB Output is correct
29 Correct 13 ms 1744 KB Output is correct
30 Correct 13 ms 1704 KB Output is correct
31 Correct 13 ms 1616 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 308 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1616 KB Output is correct
2 Correct 1 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 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 10 ms 1144 KB Output is correct
8 Correct 8 ms 1140 KB Output is correct
9 Correct 13 ms 1708 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 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 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 576 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 6 ms 724 KB Output is correct
44 Correct 6 ms 724 KB Output is correct
45 Correct 5 ms 812 KB Output is correct
46 Correct 6 ms 724 KB Output is correct
47 Correct 6 ms 724 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 3 ms 560 KB Output is correct
50 Correct 3 ms 560 KB Output is correct
51 Correct 3 ms 596 KB Output is correct
52 Correct 3 ms 596 KB Output is correct
53 Correct 3 ms 596 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 3 ms 628 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 3 ms 596 KB Output is correct
59 Correct 3 ms 564 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 4 ms 596 KB Output is correct
62 Correct 4 ms 596 KB Output is correct
63 Correct 3 ms 596 KB Output is correct
64 Correct 4 ms 596 KB Output is correct
65 Correct 4 ms 596 KB Output is correct
66 Correct 3 ms 596 KB Output is correct
67 Correct 3 ms 596 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 596 KB Output is correct
73 Correct 3 ms 564 KB Output is correct
74 Correct 3 ms 560 KB Output is correct
75 Correct 4 ms 596 KB Output is correct
76 Correct 3 ms 596 KB Output is correct
77 Correct 6 ms 724 KB Output is correct
78 Correct 4 ms 684 KB Output is correct
79 Correct 5 ms 724 KB Output is correct
80 Correct 4 ms 724 KB Output is correct
81 Correct 4 ms 724 KB Output is correct
82 Correct 3 ms 596 KB Output is correct
83 Correct 3 ms 596 KB Output is correct
84 Correct 3 ms 596 KB Output is correct
85 Correct 3 ms 560 KB Output is correct
86 Correct 3 ms 596 KB Output is correct
87 Correct 3 ms 596 KB Output is correct
88 Correct 3 ms 596 KB Output is correct
89 Correct 8 ms 1232 KB Output is correct
90 Correct 8 ms 1104 KB Output is correct
91 Correct 9 ms 1080 KB Output is correct
92 Correct 8 ms 1104 KB Output is correct
93 Correct 9 ms 1156 KB Output is correct
94 Correct 11 ms 1196 KB Output is correct
95 Correct 8 ms 1104 KB Output is correct
96 Correct 13 ms 1704 KB Output is correct
97 Correct 13 ms 1744 KB Output is correct
98 Correct 13 ms 1744 KB Output is correct
99 Correct 13 ms 1704 KB Output is correct
100 Correct 13 ms 1616 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 308 KB Output is correct
103 Correct 13 ms 1616 KB Output is correct
104 Correct 1 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 3 ms 596 KB Output is correct
108 Correct 3 ms 596 KB Output is correct
109 Correct 10 ms 1144 KB Output is correct
110 Correct 8 ms 1140 KB Output is correct
111 Correct 13 ms 1708 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 18 ms 1736 KB Output is correct
115 Correct 3 ms 596 KB Output is correct
116 Correct 3 ms 560 KB Output is correct
117 Correct 8 ms 1092 KB Output is correct
118 Correct 9 ms 1164 KB Output is correct
119 Correct 12 ms 1704 KB Output is correct
120 Correct 14 ms 1692 KB Output is correct
121 Correct 12 ms 1640 KB Output is correct
122 Correct 14 ms 1740 KB Output is correct
123 Correct 14 ms 1772 KB Output is correct
124 Correct 13 ms 1740 KB Output is correct
125 Correct 14 ms 1656 KB Output is correct
126 Correct 16 ms 1744 KB Output is correct
127 Correct 13 ms 1744 KB Output is correct
128 Correct 13 ms 1656 KB Output is correct