oj.uz

답안 #259522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259522 2020-08-08T00:59:54 Z anayk Vision Program (IOI19_vision) C++14
100 / 100
 20 ms 1480 KB 
    #include "vision.h"
     
    void construct_network(int H, int W, int K) {
      std::vector<int> row(H, 0), col(W, 0);
     
      for(int i = 0; i < H; i++) {
        std::vector<int> cur;
        for(int j = 0; j < W; j++) {
          cur.push_back(i*W + j);
        }
        row[i] = add_or(cur);
      }
     
      for(int i = 0; i < W; i++) {
        std::vector<int> cur;
        for(int j = 0; j < H; j++) {
          cur.push_back(j*W + i);
        }
        col[i] = add_or(cur);
      }
     
      std::vector<int> spec = {19, 21, 23};
     
      std::vector<int> rows[spec.size()], cols[spec.size()];
      for(int i = 0; i < spec.size(); i++) {
        for(int j = 0; j < spec[i]; j++) {
          std::vector<int> cur;
          rows[i].push_back(-1);
          for(int k = j; k < H; k += spec[i])
            cur.push_back(row[k]);
          if(cur.size() == 0)
            continue;
          rows[i][j] = add_or(cur);
        }
      }
     
      for(int i = 0; i < spec.size(); i++) {
        for(int j = 0; j < spec[i]; j++) {
          std::vector<int> cur;
          cols[i].push_back(-1);
          for(int k = j; k < W; k += spec[i])
            cur.push_back(col[k]);
          if(cur.size() == 0)
            continue;
          cols[i][j] = add_or(cur);
        }
      }
     
      std::vector<int> mrows[spec.size()], mcols[spec.size()];
      for(int i = 0; i < spec.size(); i++) {
        std::vector<int> cur;
        for(int j = 0; j < spec[i]; j++)
          if(rows[i][j] > -1) cur.push_back(rows[i][j]);
        if(cur.size() != 0)
          mrows[i].push_back(add_xor(cur));
     
        for(int j = 1; j < spec[i]; j++) {
          std::vector<int> temp;
          for(int k = 0; k < spec[i]; k++) {
            if(rows[i][(k+j)%spec[i]] > -1 && rows[i][k] > -1) temp.push_back(add_and({rows[i][k], rows[i][(k+j)%spec[i]]}));
          }
          mrows[i].push_back(-1);
          if(temp.size() == 0)
            continue;
          mrows[i][j] = add_or(temp);
        }
      }
     
      for(int i = 0; i < spec.size(); i++) {
        std::vector<int> cur;
        for(int j = 0; j < spec[i]; j++)
          if(cols[i][j] > -1) cur.push_back(cols[i][j]);
        if(cur.size() != 0)
          mcols[i].push_back(add_xor(cur));
     
        for(int j = 1; j < spec[i]; j++) {
          std::vector<int> temp;
          for(int k = 0; k < spec[i]; k++) {
            if(cols[i][(k+j)%spec[i]] > -1 && cols[i][k] > -1) temp.push_back(add_and({cols[i][k], cols[i][(k+j)%spec[i]]}));
          }
          mcols[i].push_back(-1);
          if(temp.size() == 0)
            continue;
          mcols[i][j] = add_or(temp);
        }
      }
     
      std::vector<int> finale;
      for(int i = 0; i <= K; i++) {
        std::vector<int> temp;
        if(i == H)
          break;
        if(K-i >= W)
          continue;
        for(int j = 0; j < spec.size(); j++) {
          if(mrows[j][i%spec[j]] == -1 || mcols[j][(K-i)%spec[j]] == -1) continue;
          temp.push_back(mrows[j][i%spec[j]]);
          temp.push_back(mcols[j][(K-i)%spec[j]]);
        }
     
        finale.push_back(add_and(temp));
      }
      int ans = add_or(finale);
    }

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:25:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < spec.size(); i++) {
                      ~~^~~~~~~~~~~~~
vision.cpp:37:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < spec.size(); i++) {
                      ~~^~~~~~~~~~~~~
vision.cpp:50:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < spec.size(); i++) {
                      ~~^~~~~~~~~~~~~
vision.cpp:69:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 0; i < spec.size(); i++) {
                      ~~^~~~~~~~~~~~~
vision.cpp:95:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < spec.size(); j++) {
                        ~~^~~~~~~~~~~~~
vision.cpp:103:11: warning: unused variable 'ans' [-Wunused-variable]
       int ans = add_or(finale);
           ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 1 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 564 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 3 ms 640 KB Output is correct
34 Correct 3 ms 640 KB Output is correct
35 Correct 3 ms 640 KB Output is correct
36 Correct 3 ms 640 KB Output is correct
37 Correct 3 ms 640 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 564 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 3 ms 640 KB Output is correct
34 Correct 3 ms 640 KB Output is correct
35 Correct 3 ms 640 KB Output is correct
36 Correct 3 ms 640 KB Output is correct
37 Correct 3 ms 640 KB Output is correct
38 Correct 5 ms 768 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 4 ms 640 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 6 ms 768 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 5 ms 768 KB Output is correct
46 Correct 5 ms 768 KB Output is correct
47 Correct 5 ms 768 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 256 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 8 ms 1024 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 8 ms 1024 KB Output is correct
23 Correct 8 ms 1024 KB Output is correct
24 Correct 8 ms 1024 KB Output is correct
25 Correct 8 ms 1024 KB Output is correct
26 Correct 11 ms 1024 KB Output is correct
27 Correct 13 ms 1408 KB Output is correct
28 Correct 20 ms 1408 KB Output is correct
29 Correct 13 ms 1408 KB Output is correct
30 Correct 13 ms 1408 KB Output is correct
31 Correct 13 ms 1408 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1408 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 704 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 8 ms 1024 KB Output is correct
9 Correct 14 ms 1408 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 360 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 292 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 564 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 3 ms 640 KB Output is correct
34 Correct 3 ms 640 KB Output is correct
35 Correct 3 ms 640 KB Output is correct
36 Correct 3 ms 640 KB Output is correct
37 Correct 3 ms 640 KB Output is correct
38 Correct 5 ms 768 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 4 ms 640 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 6 ms 768 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 5 ms 768 KB Output is correct
46 Correct 5 ms 768 KB Output is correct
47 Correct 5 ms 768 KB Output is correct
48 Correct 2 ms 512 KB Output is correct
49 Correct 2 ms 512 KB Output is correct
50 Correct 2 ms 512 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 512 KB Output is correct
54 Correct 2 ms 384 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 2 ms 384 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 2 ms 512 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 2 ms 512 KB Output is correct
66 Correct 2 ms 512 KB Output is correct
67 Correct 2 ms 384 KB Output is correct
68 Correct 0 ms 384 KB Output is correct
69 Correct 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 3 ms 640 KB Output is correct
73 Correct 3 ms 640 KB Output is correct
74 Correct 3 ms 640 KB Output is correct
75 Correct 3 ms 640 KB Output is correct
76 Correct 3 ms 640 KB Output is correct
77 Correct 4 ms 640 KB Output is correct
78 Correct 4 ms 640 KB Output is correct
79 Correct 4 ms 640 KB Output is correct
80 Correct 7 ms 640 KB Output is correct
81 Correct 4 ms 640 KB Output is correct
82 Correct 2 ms 512 KB Output is correct
83 Correct 2 ms 512 KB Output is correct
84 Correct 2 ms 384 KB Output is correct
85 Correct 2 ms 512 KB Output is correct
86 Correct 2 ms 512 KB Output is correct
87 Correct 2 ms 512 KB Output is correct
88 Correct 2 ms 512 KB Output is correct
89 Correct 8 ms 1024 KB Output is correct
90 Correct 8 ms 1024 KB Output is correct
91 Correct 8 ms 1024 KB Output is correct
92 Correct 8 ms 1024 KB Output is correct
93 Correct 8 ms 1024 KB Output is correct
94 Correct 8 ms 1024 KB Output is correct
95 Correct 11 ms 1024 KB Output is correct
96 Correct 13 ms 1408 KB Output is correct
97 Correct 20 ms 1408 KB Output is correct
98 Correct 13 ms 1408 KB Output is correct
99 Correct 13 ms 1408 KB Output is correct
100 Correct 13 ms 1408 KB Output is correct
101 Correct 0 ms 256 KB Output is correct
102 Correct 0 ms 256 KB Output is correct
103 Correct 13 ms 1408 KB Output is correct
104 Correct 0 ms 256 KB Output is correct
105 Correct 4 ms 640 KB Output is correct
106 Correct 4 ms 704 KB Output is correct
107 Correct 2 ms 384 KB Output is correct
108 Correct 3 ms 512 KB Output is correct
109 Correct 8 ms 1024 KB Output is correct
110 Correct 8 ms 1024 KB Output is correct
111 Correct 14 ms 1408 KB Output is correct
112 Correct 0 ms 256 KB Output is correct
113 Correct 0 ms 256 KB Output is correct
114 Correct 13 ms 1408 KB Output is correct
115 Correct 2 ms 384 KB Output is correct
116 Correct 2 ms 512 KB Output is correct
117 Correct 8 ms 1024 KB Output is correct
118 Correct 8 ms 1024 KB Output is correct
119 Correct 13 ms 1408 KB Output is correct
120 Correct 13 ms 1408 KB Output is correct
121 Correct 13 ms 1408 KB Output is correct
122 Correct 13 ms 1408 KB Output is correct
123 Correct 13 ms 1408 KB Output is correct
124 Correct 13 ms 1408 KB Output is correct
125 Correct 13 ms 1408 KB Output is correct
126 Correct 13 ms 1480 KB Output is correct
127 Correct 13 ms 1408 KB Output is correct
128 Correct 13 ms 1408 KB Output is correct