oj.uz

Submission #796416

# Submission time Handle Problem Language Result Execution time Memory
796416 2023-07-28T11:23:29 Z WLZ Vision Program (IOI19_vision) C++17
21 / 100
 9 ms 2384 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

int h, w, k;

void construct_network(int H, int W, int K) {
  h = H; w = W; k = K;
  if (k == h + w - 2) {
    add_or({add_and({0, h * w - 1}), add_and({w - 1, (h - 1) * w})});
    return;
  }
  map<int, vector<int> > diag1, diag2;
  map<int, int> rep1, rep2;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      diag1[i - j].push_back(i * w + j);
      diag2[i + j].push_back(i * w + j);
    }
  }
  for (auto &p : diag1) rep1[p.first] = add_or(p.second);
  for (auto &p : diag2) rep2[p.first] = add_or(p.second);
  vector<int> vx(h + w - 1), vy(h + w - 1);
  map<int, vector<int> > diag_grp1, diag_grp2;
  map<int, map<int, pair<int, int> > > mp1, mp2;
  for (int d = h + w - 2; d >= k; d--) {
    bool multiple = false;
    for (int dd = 2 * d; dd <= h + w - 2; dd += d) {
      multiple = true;
      vector<int> v1, v2;
      for (auto &p : rep1) {
        if (p.first >= rep1.begin()->first + d) break;
        vector<int> tmp_or, tmp_xor;
        for (int i = p.first; ; i += d) {
          if (i >= rep1.begin()->first + dd) break;
          tmp_or.push_back(mp1[dd][i].first);
          tmp_xor.push_back(mp1[dd][i].second);
        }
        pair<int, int> added;
        if ((int) tmp_or.size() > 1) added = {add_or(tmp_or), add_xor(tmp_xor)};
        else added = {p.second, p.second};
        mp1[d][p.first] = added;
        v1.push_back(add_xor({added.first, added.second}));
      }
      for (auto &p : rep2) {
        if (p.first >= rep2.begin()->first + d) break;
        vector<int> tmp_or, tmp_xor;
        for (int i = p.first; ; i += d) {
          if (i >= rep2.begin()->first + dd) break;
          tmp_or.push_back(mp2[dd][i].first);
          tmp_xor.push_back(mp2[dd][i].second);
        }
        pair<int, int> added;
        if ((int) tmp_or.size() > 1) added = {add_or(tmp_or), add_xor(tmp_xor)};
        else added = {p.second, p.second};
        mp2[d][p.first] = added;
        v2.push_back(add_xor({added.first, added.second}));
      }
      vx[d] = add_or(v1);
      vy[d] = add_or(v2);
    }
    if (multiple) continue;
    vector<int> v1, v2;
    for (auto &p : rep1) {
      if (p.first >= rep1.begin()->first + d) break;
      vector<int> tmp;
      for (int i = p.first; ; i += d) {
        if (!rep1.count(i)) break;
        tmp.push_back(rep1[i]);
      }
      pair<int, int> added;
      if ((int) tmp.size() > 1) added = make_pair(add_or(tmp), add_xor(tmp));
      else added = make_pair(p.second, p.second);
      mp1[d][p.first] = added;
      v1.push_back(add_xor({added.first, added.second}));
    }
    for (auto &p : rep2) {
      if (p.first >= rep2.begin()->first + d) break;
      vector<int> tmp;
      for (int i = p.first; ; i += d) {
        if (!rep2.count(i)) break;
        tmp.push_back(rep2[i]);
      }
      pair<int, int> added;
      if ((int) tmp.size() > 1) added = make_pair(add_or(tmp), add_xor(tmp));
      else added = make_pair(p.second, p.second);
      mp2[d][p.first] = added;
      v2.push_back(add_xor({added.first, added.second}));
    }
    vx[d] = add_or(v1);
    vy[d] = add_or(v2);
  }
  vector<int> tmp;
  for (int d = h + w - 2; d > k; d--) {
    tmp.push_back(vx[d]);
    tmp.push_back(vy[d]);
  }
  int a = add_or(tmp);
  tmp.push_back(vx[k]); tmp.push_back(vy[k]);
  int b = add_or(tmp);
  add_xor({a, b});
}

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 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 300 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 1 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 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 300 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 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
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 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 300 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 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 5 ms 1104 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 4 ms 940 KB Output is correct
33 Incorrect 3 ms 1232 KB WA in grader: Too many instructions
34 Halted 0 ms 0 KB -

Subtask #4
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 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 300 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 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 5 ms 1104 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 4 ms 940 KB Output is correct
33 Incorrect 3 ms 1232 KB WA in grader: Too many instructions
34 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 1616 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 3 ms 1572 KB WA in grader: Too many instructions
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 2384 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
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 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 300 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 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 5 ms 1104 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 4 ms 940 KB Output is correct
33 Incorrect 3 ms 1232 KB WA in grader: Too many instructions
34 Halted 0 ms 0 KB -