oj.uz

Submission #1050790

# Submission time Handle Problem Language Result Execution time Memory
1050790 2024-08-09T14:33:34 Z Halit Vision Program (IOI19_vision) C++17
36 / 100
 20 ms 5332 KB 
#include "vision.h"
#include <bits/stdc++.h>

void construct_network(int H, int W, int K) { 
  std::vector<std::vector<int>> a(H+W), b(H+W);
  for (int i = 0;i < H; ++i) {
    for (int j = 0;j < W; ++j) {
      a[i +  j].push_back(i * W + j);
      b[H - i + j - 1].push_back(i * W + j);
    }     
  }
  std::vector<std::vector<int>> diagonal(2);
  for (int i = 0;i < H+W-1; ++i) {
    diagonal[0].push_back(add_or(a[i]));
    diagonal[1].push_back(add_or(b[i]));
  }
  std::vector<std::vector<int>> ends(2);
  for (int d = 0;d < 2; ++d) {
    for (int i = 0;i+K < H+W-1; ++i) {
      std::vector<int> test = {diagonal[d][i], diagonal[d][i+K]};
      ends[d].push_back(add_and(test));
    }
  }
  std::vector<int> results;
  for (int d = 0;d < 2; ++d) {
    if (2*K >= H+W-2) {
      std::vector<int> area_or;
      for (int i = 0;i < H+W-1; ++i) {
        area_or.push_back(diagonal[d][i]);
      }
      results.push_back(add_and({add_or(ends[d]), add_or(area_or)}));
      continue;
    }
    for (int i = 0;i+2*K < H+W-1; ++i) {
      std::vector<int> area_or, area_xor;
      for (int j = i;j <= std::min(i+2*K, H+W-2); ++j) {
        area_or.push_back(diagonal[d^1][j]);
        area_xor.push_back(diagonal[d^1][j]);
      }
      int aor = add_or(area_or);
      int axor = add_xor(area_xor);
      int notxor = add_not(axor);
      results.push_back(add_and({add_or(ends[d]), add_and({aor, notxor})}));
    }
  }
  add_or(results);
  return;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 432 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
22 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 432 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
22 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 432 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
22 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1112 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 1200 KB Output is correct
10 Correct 4 ms 1112 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 1120 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 356 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 636 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 5 ms 1116 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 13 ms 3064 KB Output is correct
21 Correct 8 ms 2648 KB Output is correct
22 Correct 2 ms 1112 KB Output is correct
23 Correct 4 ms 1116 KB Output is correct
24 Correct 11 ms 3032 KB Output is correct
25 Correct 3 ms 1116 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 19 ms 5260 KB Output is correct
28 Incorrect 17 ms 4696 KB on inputs (0, 0), (50, 50), expected 1, but computed 0
29 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 5332 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 736 KB Output is correct
4 Correct 4 ms 1368 KB Output is correct
5 Correct 4 ms 1112 KB Output is correct
6 Correct 4 ms 1116 KB Output is correct
7 Correct 11 ms 2964 KB Output is correct
8 Correct 11 ms 3032 KB Output is correct
9 Correct 19 ms 5332 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 432 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
22 Halted 0 ms 0 KB -