oj.uz

답안 #1028562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028562 2024-07-20T04:49:40 Z onbert Vision Program (IOI19_vision) C++17
100 / 100
 23 ms 3420 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
int n, m;
int id(int x, int y) {
    return x*m + y;
}

void construct_network(int N, int M, int k) {
    n = N, m = M;
    int nn[2] = {n, m};
    int ok[4];
    for (int I=0;I<=1;I++) {
        int sz = nn[I], kn = min(k, sz-1);
        vector<int> OR(sz), XOR(sz), NOTXOR(sz), TWO(sz), range;
        for (int i=0;i<sz;i++) {
            vector<int> cur;
            if (I==0) for (int j=0;j<m;j++) cur.push_back(id(i, j));
            else for (int j=0;j<n;j++) cur.push_back(id(j, i));
            OR[i] = add_or(cur);
            XOR[i] = add_xor(cur);
            NOTXOR[i] = add_not(XOR[i]);
            TWO[i] = add_and({NOTXOR[i], OR[i]});
        }
        for (int l=0, r=kn; r<sz; l++, r++) {
            // if (I==1) cout << l << " " << r << endl;
            vector<int> cur;
            for (int j=l;j<=r;j++) cur.push_back({OR[j]});
            int x = add_or(cur), y = add_xor(cur), z = add_not(y);
            range.push_back(add_and({x, z}));
        }
        vector<int> ck = TWO;
        for (int x:range) ck.push_back(x);
        ok[I] = add_or(ck);
    }
    for (int I=2;I<=3;I++) {
        int sz = nn[I];
        vector<int> OR;
        if (I==2) {
            for (int i=-n;i<m;i++) {
                vector<int> cur;
                for (int x=0, y=i; x<n; x++, y++) {
                    if (x>=0 && x<n && y>=0 && y<m) cur.push_back(id(x, y));
                }
                if (cur.size()!=0) OR.push_back(add_or(cur));
            }
        } else if (I==3) {
            for (int i=0;i<m+n+5;i++) {
                vector<int> cur;
                for (int x=0, y=i; x<n; x++, y--) {
                    if (x>=0 && x<n && y>=0 && y<m) cur.push_back(id(x, y));
                }
                if (cur.size()!=0) OR.push_back(add_or(cur));
            }
        }
        vector<int> range;
        for (int l=0, r=k; r<OR.size(); l++, r++) {
            // cout << l << " " << r << endl;
            range.push_back(add_and({OR[l], OR[r]}));
        }
        ok[I] = add_or(range);
    }
    int diag = add_or({ok[2], ok[3]});
    int a = add_and({ok[0]}), b = add_and({ok[1]}), c = add_and({ok[2]}), d = add_and({ok[3]});
    int ans = add_and({ok[0], ok[1], diag});
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:57:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for (int l=0, r=k; r<OR.size(); l++, r++) {
      |                            ~^~~~~~~~~~
vision.cpp:37:13: warning: unused variable 'sz' [-Wunused-variable]
   37 |         int sz = nn[I];
      |             ^~
vision.cpp:64:9: warning: unused variable 'a' [-Wunused-variable]
   64 |     int a = add_and({ok[0]}), b = add_and({ok[1]}), c = add_and({ok[2]}), d = add_and({ok[3]});
      |         ^
vision.cpp:64:31: warning: unused variable 'b' [-Wunused-variable]
   64 |     int a = add_and({ok[0]}), b = add_and({ok[1]}), c = add_and({ok[2]}), d = add_and({ok[3]});
      |                               ^
vision.cpp:64:53: warning: unused variable 'c' [-Wunused-variable]
   64 |     int a = add_and({ok[0]}), b = add_and({ok[1]}), c = add_and({ok[2]}), d = add_and({ok[3]});
      |                                                     ^
vision.cpp:64:75: warning: unused variable 'd' [-Wunused-variable]
   64 |     int a = add_and({ok[0]}), b = add_and({ok[1]}), c = add_and({ok[2]}), d = add_and({ok[3]});
      |                                                                           ^
vision.cpp:65:9: warning: unused variable 'ans' [-Wunused-variable]
   65 |     int ans = add_and({ok[0], ok[1], diag});
      |         ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 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
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 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 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 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 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 484 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 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 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 484 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 5 ms 1116 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 3 ms 600 KB Output is correct
43 Correct 4 ms 1032 KB Output is correct
44 Correct 4 ms 1152 KB Output is correct
45 Correct 4 ms 860 KB Output is correct
46 Correct 6 ms 1040 KB Output is correct
47 Correct 3 ms 860 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 8 ms 1628 KB Output is correct
21 Correct 7 ms 1880 KB Output is correct
22 Correct 7 ms 1700 KB Output is correct
23 Correct 7 ms 1624 KB Output is correct
24 Correct 6 ms 1628 KB Output is correct
25 Correct 7 ms 1884 KB Output is correct
26 Correct 6 ms 1628 KB Output is correct
27 Correct 13 ms 3032 KB Output is correct
28 Correct 15 ms 3420 KB Output is correct
29 Correct 12 ms 2908 KB Output is correct
30 Correct 11 ms 2908 KB Output is correct
31 Correct 12 ms 2720 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 3028 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 7 ms 1744 KB Output is correct
8 Correct 6 ms 1628 KB Output is correct
9 Correct 12 ms 3032 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 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 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 484 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 5 ms 1116 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 3 ms 600 KB Output is correct
43 Correct 4 ms 1032 KB Output is correct
44 Correct 4 ms 1152 KB Output is correct
45 Correct 4 ms 860 KB Output is correct
46 Correct 6 ms 1040 KB Output is correct
47 Correct 3 ms 860 KB Output is correct
48 Correct 2 ms 600 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 2 ms 688 KB Output is correct
54 Correct 2 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 2 ms 604 KB Output is correct
59 Correct 3 ms 604 KB Output is correct
60 Correct 2 ms 600 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 2 ms 604 KB Output is correct
65 Correct 2 ms 688 KB Output is correct
66 Correct 1 ms 604 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 2 ms 600 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 1 ms 604 KB Output is correct
75 Correct 1 ms 604 KB Output is correct
76 Correct 1 ms 604 KB Output is correct
77 Correct 2 ms 860 KB Output is correct
78 Correct 3 ms 860 KB Output is correct
79 Correct 3 ms 860 KB Output is correct
80 Correct 2 ms 604 KB Output is correct
81 Correct 2 ms 604 KB Output is correct
82 Correct 1 ms 600 KB Output is correct
83 Correct 2 ms 600 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 2 ms 600 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 8 ms 1628 KB Output is correct
90 Correct 7 ms 1880 KB Output is correct
91 Correct 7 ms 1700 KB Output is correct
92 Correct 7 ms 1624 KB Output is correct
93 Correct 6 ms 1628 KB Output is correct
94 Correct 7 ms 1884 KB Output is correct
95 Correct 6 ms 1628 KB Output is correct
96 Correct 13 ms 3032 KB Output is correct
97 Correct 15 ms 3420 KB Output is correct
98 Correct 12 ms 2908 KB Output is correct
99 Correct 11 ms 2908 KB Output is correct
100 Correct 12 ms 2720 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 13 ms 3028 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 2 ms 604 KB Output is correct
106 Correct 3 ms 860 KB Output is correct
107 Correct 1 ms 604 KB Output is correct
108 Correct 1 ms 604 KB Output is correct
109 Correct 7 ms 1744 KB Output is correct
110 Correct 6 ms 1628 KB Output is correct
111 Correct 12 ms 3032 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 23 ms 3420 KB Output is correct
115 Correct 1 ms 344 KB Output is correct
116 Correct 1 ms 604 KB Output is correct
117 Correct 7 ms 1628 KB Output is correct
118 Correct 8 ms 1884 KB Output is correct
119 Correct 12 ms 2840 KB Output is correct
120 Correct 12 ms 2908 KB Output is correct
121 Correct 12 ms 2908 KB Output is correct
122 Correct 12 ms 2904 KB Output is correct
123 Correct 16 ms 3032 KB Output is correct
124 Correct 23 ms 3420 KB Output is correct
125 Correct 14 ms 2904 KB Output is correct
126 Correct 13 ms 2908 KB Output is correct
127 Correct 12 ms 2908 KB Output is correct
128 Correct 12 ms 2904 KB Output is correct