oj.uz

Submission #555019

# Submission time Handle Problem Language Result Execution time Memory
555019 2022-04-30T00:39:36 Z slime Vision Program (IOI19_vision) C++14
100 / 100
 30 ms 3656 KB 
#include <bits/stdc++.h>
#include "vision.h"
#include <map>

void construct_network(int H, int W, int K) {
	std::vector<int> Ns;
  std::vector<int> by_sum, by_diff;
  std::map<int, std::vector<int> > mp_sum, mp_diff;
  for(int i=0; i<H; i++) {
    for(int j=0; j<W; j++) {
      mp_sum[i + j].push_back(i*W + j);
      mp_diff[i - j].push_back(i*W + j);
    }
  }
  std::vector<int> analyze; // Necessary conditions, i.e. AND clause
  for(auto x: mp_sum) {
    by_sum.push_back(add_or(x.second));
  }
  for(auto x: mp_diff) {
    by_diff.push_back(add_or(x.second));
  }
  // Condition 1: at least one of these two arrays' 1s are exactly K cells apart
  std::vector<int> cond1;
  for(int i=0; i<by_sum.size(); i++) {
    if(i + K < by_sum.size()) {
      std::vector<int> uwu = {by_sum[i], by_sum[i + K]};
      cond1.push_back(add_and(uwu));
    }
  }
  for(int i=0; i<by_diff.size(); i++) {
    if(i + K < by_diff.size()) {
      std::vector<int> uwu = {by_diff[i], by_diff[i + K]};
      cond1.push_back(add_and(uwu));
    }
  }
  
  // Only one in cond1 array = 1 is necessary (but at least 1)!
  analyze.push_back(add_or(cond1));
  // condition 2: [1 + K 0s] + at least one 1 in the right should not appear in any of them
  std::vector<int> cond2;
  for(int i=0; i<by_sum.size(); i++) {
    if(i + 2 + K < by_sum.size()) {
      std::vector<int> patt; // does this subarray match the pattern?
      std::vector<int> uwu = {by_sum[i]};
      patt.push_back(add_and(uwu));
      uwu.clear();
      for(int j=i+1; j<i+1+K; j++) uwu.push_back(by_sum[j]);
      patt.push_back(add_not(add_or(uwu)));
      // Everything in patt = 1 iff by_sum[i] = 1 and all by_sum[i+1] to by_sum[i+K] = 0
      std::vector<int> all_nxt;
      for(int j=i+1+K; j<by_sum.size(); j++) all_nxt.push_back(by_sum[j]);
      patt.push_back(add_or(all_nxt));
      cond2.push_back(add_and(patt)); // = 1 if match pattern, = 0 otherwise
    }
  }
  for(int i=0; i<by_diff.size(); i++) {
    if(i + 2 + K < by_diff.size()) {
      std::vector<int> patt; // does this subarray match the pattern?
      std::vector<int> uwu = {by_diff[i]};
      patt.push_back(add_and(uwu));
      uwu.clear();
      for(int j=i+1; j<i+1+K; j++) uwu.push_back(by_diff[j]);
      patt.push_back(add_not(add_or(uwu)));
      // Everything in patt = 1 iff by_diff[i] = 1 and all by_diff[i+1] to by_diff[i+K] = 0
      std::vector<int> all_nxt;
      for(int j=i+1+K; j<by_diff.size(); j++) all_nxt.push_back(by_diff[j]);
      patt.push_back(add_or(all_nxt));
      cond2.push_back(add_and(patt)); // = 1 if match pattern, = 0 otherwise
    }
  }
  if(cond2.size()) analyze.push_back(add_not(add_or(cond2))); // = 1 if all cond2 = 0, i.e. no pattern found
  add_and(analyze); // answer

}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:24:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for(int i=0; i<by_sum.size(); i++) {
      |                ~^~~~~~~~~~~~~~
vision.cpp:25:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     if(i + K < by_sum.size()) {
      |        ~~~~~~^~~~~~~~~~~~~~~
vision.cpp:30:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for(int i=0; i<by_diff.size(); i++) {
      |                ~^~~~~~~~~~~~~~~
vision.cpp:31:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     if(i + K < by_diff.size()) {
      |        ~~~~~~^~~~~~~~~~~~~~~~
vision.cpp:41:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for(int i=0; i<by_sum.size(); i++) {
      |                ~^~~~~~~~~~~~~~
vision.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     if(i + 2 + K < by_sum.size()) {
      |        ~~~~~~~~~~^~~~~~~~~~~~~~~
vision.cpp:51:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |       for(int j=i+1+K; j<by_sum.size(); j++) all_nxt.push_back(by_sum[j]);
      |                        ~^~~~~~~~~~~~~~
vision.cpp:56:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for(int i=0; i<by_diff.size(); i++) {
      |                ~^~~~~~~~~~~~~~~
vision.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     if(i + 2 + K < by_diff.size()) {
      |        ~~~~~~~~~~^~~~~~~~~~~~~~~~
vision.cpp:66:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |       for(int j=i+1+K; j<by_diff.size(); j++) all_nxt.push_back(by_diff[j]);
      |                        ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.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 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 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 212 KB Output is correct
13 Correct 1 ms 304 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 300 KB Output is correct
17 Correct 1 ms 300 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 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 212 KB Output is correct
13 Correct 1 ms 304 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 300 KB Output is correct
17 Correct 1 ms 300 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 296 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 296 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 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 212 KB Output is correct
13 Correct 1 ms 304 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 300 KB Output is correct
17 Correct 1 ms 300 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 296 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 296 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 296 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #4
15.0 / 15.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 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 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 212 KB Output is correct
13 Correct 1 ms 304 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 300 KB Output is correct
17 Correct 1 ms 300 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 296 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 296 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 296 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 7 ms 1200 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 1 ms 300 KB Output is correct
41 Correct 4 ms 816 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 8 ms 1196 KB Output is correct
44 Correct 7 ms 1192 KB Output is correct
45 Correct 7 ms 940 KB Output is correct
46 Correct 5 ms 852 KB Output is correct
47 Correct 3 ms 560 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 868 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 4 ms 580 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 5 ms 844 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 808 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 5 ms 776 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 2 ms 468 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 1 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 980 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 5 ms 964 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 18 ms 2128 KB Output is correct
21 Correct 14 ms 1860 KB Output is correct
22 Correct 11 ms 1452 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 15 ms 2092 KB Output is correct
25 Correct 13 ms 1748 KB Output is correct
26 Correct 6 ms 984 KB Output is correct
27 Correct 30 ms 3604 KB Output is correct
28 Correct 26 ms 3364 KB Output is correct
29 Correct 23 ms 3000 KB Output is correct
30 Correct 18 ms 2348 KB Output is correct
31 Correct 13 ms 1620 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3568 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 596 KB Output is correct
4 Correct 6 ms 980 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 836 KB Output is correct
7 Correct 16 ms 2096 KB Output is correct
8 Correct 20 ms 2108 KB Output is correct
9 Correct 27 ms 3528 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 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 212 KB Output is correct
13 Correct 1 ms 304 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 300 KB Output is correct
17 Correct 1 ms 300 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 296 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 296 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 296 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 7 ms 1200 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 1 ms 300 KB Output is correct
41 Correct 4 ms 816 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 8 ms 1196 KB Output is correct
44 Correct 7 ms 1192 KB Output is correct
45 Correct 7 ms 940 KB Output is correct
46 Correct 5 ms 852 KB Output is correct
47 Correct 3 ms 560 KB Output is correct
48 Correct 5 ms 868 KB Output is correct
49 Correct 4 ms 596 KB Output is correct
50 Correct 4 ms 580 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 5 ms 844 KB Output is correct
53 Correct 5 ms 768 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 5 ms 808 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 4 ms 596 KB Output is correct
59 Correct 4 ms 596 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 5 ms 852 KB Output is correct
63 Correct 5 ms 776 KB Output is correct
64 Correct 4 ms 596 KB Output is correct
65 Correct 4 ms 596 KB Output is correct
66 Correct 2 ms 468 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 1 ms 212 KB Output is correct
72 Correct 3 ms 596 KB Output is correct
73 Correct 3 ms 596 KB Output is correct
74 Correct 3 ms 468 KB Output is correct
75 Correct 2 ms 468 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 7 ms 980 KB Output is correct
78 Correct 6 ms 852 KB Output is correct
79 Correct 5 ms 724 KB Output is correct
80 Correct 4 ms 596 KB Output is correct
81 Correct 2 ms 468 KB Output is correct
82 Correct 5 ms 852 KB Output is correct
83 Correct 5 ms 964 KB Output is correct
84 Correct 3 ms 596 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 5 ms 852 KB Output is correct
87 Correct 4 ms 596 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 18 ms 2128 KB Output is correct
90 Correct 14 ms 1860 KB Output is correct
91 Correct 11 ms 1452 KB Output is correct
92 Correct 6 ms 980 KB Output is correct
93 Correct 15 ms 2092 KB Output is correct
94 Correct 13 ms 1748 KB Output is correct
95 Correct 6 ms 984 KB Output is correct
96 Correct 30 ms 3604 KB Output is correct
97 Correct 26 ms 3364 KB Output is correct
98 Correct 23 ms 3000 KB Output is correct
99 Correct 18 ms 2348 KB Output is correct
100 Correct 13 ms 1620 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 28 ms 3568 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 4 ms 596 KB Output is correct
106 Correct 6 ms 980 KB Output is correct
107 Correct 6 ms 852 KB Output is correct
108 Correct 5 ms 836 KB Output is correct
109 Correct 16 ms 2096 KB Output is correct
110 Correct 20 ms 2108 KB Output is correct
111 Correct 27 ms 3528 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 27 ms 3376 KB Output is correct
115 Correct 1 ms 340 KB Output is correct
116 Correct 5 ms 852 KB Output is correct
117 Correct 9 ms 1196 KB Output is correct
118 Correct 16 ms 2048 KB Output is correct
119 Correct 23 ms 2948 KB Output is correct
120 Correct 23 ms 2984 KB Output is correct
121 Correct 24 ms 2900 KB Output is correct
122 Correct 26 ms 3008 KB Output is correct
123 Correct 28 ms 3656 KB Output is correct
124 Correct 26 ms 3400 KB Output is correct
125 Correct 23 ms 2948 KB Output is correct
126 Correct 23 ms 2892 KB Output is correct
127 Correct 18 ms 2376 KB Output is correct
128 Correct 11 ms 1708 KB Output is correct