oj.uz

답안 #311339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
311339 2020-10-10T00:15:31 Z aZvezda Vision Program (IOI19_vision) C++14
100 / 100
 62 ms 5880 KB 
#include <vector>
#include <string>

void construct_network(int H, int W, int K);

int add_and(std::vector<int> Ns);

int add_or(std::vector<int> Ns);

int add_xor(std::vector<int> Ns);

int add_not(int N);

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const int MAX_N = 4e2 + 10;

pair<int, int> diag1[MAX_N], diag2[MAX_N];
int got1[MAX_N], got2[MAX_N];
vector<int> elements1[MAX_N], elements2[MAX_N];
int w, h;

int encode(int x, int y) {
    return x * w + y;
}

int generateDiagonals(int k) {
    for(int i = 0; i < MAX_N; i ++) {
        elements1[i].resize(0);
        elements2[i].resize(0);
    }
    for(int i = 0; i < h; i ++) {
        for(int j = 0; j < w; j ++) {
            elements1[i + j].push_back(encode(i, j));
            elements2[i - j + w - 1].push_back(encode(i, j));
        }
    }
    vector<int> finish, diag1, diag2, pref1, pref2;
    for(int i = 0; i < h + w - 1; i ++) {
        diag1.push_back(add_or(elements1[i]));
        diag2.push_back(add_or(elements2[i]));
        pref1.push_back(add_or(diag1));
        pref2.push_back(add_or(diag2));
        if(i >= k) {
            finish.push_back(add_and({diag1[i], pref1[i - k]}));
            finish.push_back(add_and({diag2[i], pref2[i - k]}));
        }
    }
    return add_or(finish);

}

void construct_network(int H, int W, int K) {
    h = H; w = W;
    if(h + w - 2 == K) {
        add_xor({generateDiagonals(K)});
    } else {
        add_xor({generateDiagonals(K), generateDiagonals(K + 1)});
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 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 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 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 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 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 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 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 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 2 ms 512 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 15 ms 1792 KB Output is correct
39 Correct 3 ms 640 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 9 ms 1152 KB Output is correct
42 Correct 8 ms 1024 KB Output is correct
43 Correct 16 ms 1792 KB Output is correct
44 Correct 15 ms 1792 KB Output is correct
45 Correct 15 ms 1792 KB Output is correct
46 Correct 15 ms 1664 KB Output is correct
47 Correct 8 ms 1152 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 12 ms 1408 KB Output is correct
9 Correct 11 ms 1280 KB Output is correct
10 Correct 11 ms 1280 KB Output is correct
11 Correct 11 ms 1280 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 10 ms 1280 KB Output is correct
15 Correct 10 ms 1152 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 10 ms 1280 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 32 ms 3320 KB Output is correct
21 Correct 31 ms 3320 KB Output is correct
22 Correct 33 ms 3320 KB Output is correct
23 Correct 16 ms 1920 KB Output is correct
24 Correct 32 ms 3440 KB Output is correct
25 Correct 31 ms 3320 KB Output is correct
26 Correct 18 ms 1896 KB Output is correct
27 Correct 57 ms 5876 KB Output is correct
28 Correct 58 ms 5876 KB Output is correct
29 Correct 56 ms 5752 KB Output is correct
30 Correct 57 ms 5752 KB Output is correct
31 Correct 29 ms 3320 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 5876 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 11 ms 1408 KB Output is correct
5 Correct 10 ms 1280 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 32 ms 3448 KB Output is correct
8 Correct 32 ms 3320 KB Output is correct
9 Correct 57 ms 5872 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct

Subtask #8
19.0 / 19.0

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