oj.uz

Submission #418565

# Submission time Handle Problem Language Result Execution time Memory
418565 2021-06-05T14:00:28 Z wiwiho Vision Program (IOI19_vision) C++14
100 / 100
 49 ms 4676 KB 
#include "vision.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int h, w, k;
int getid(int x, int y){
    return x * w + y;
}

void construct_network(int H, int W, int K){
    h = H; w = W; k = K;

    vector<int> l1(h + w - 1), l2(h + w - 1);
    for(int i = 0; i <= h + w - 2; i++){
        vector<int> q;
        for(int x = 0; x < h; x++){
            int y = i - x;
            if(0 <= y && y < w) q.eb(getid(x, y));
        }
        l1[i] = add_or(q);
    }
    for(int i = -w + 1; i <= h - 1; i++){
        vector<int> q;
        for(int x = 0; x < h; x++){
            int y = x - i;
            if(0 <= y && y < w) q.eb(getid(x, y));
        }
        l2[i + w - 1] = add_or(q);
    }

    vector<int> large;

    for(int i = 0; i + k + 1 <= h + w - 2; i++){
        vector<int> q1, q2;
        for(int j = 0; j <= i; j++) q1.eb(l1[j]);
        for(int j = i + k + 1; j <= h + w - 2; j++) q2.eb(l1[j]);
//        cerr << "large1 " << i << "\n";
//        printv(q1, cerr);
//        printv(q2, cerr);
        int r1 = add_or(q1), r2 = add_or(q2);
        large.eb(add_and({r1, r2}));
    }

    for(int i = -w + 1; i + k + 1 <= h - 1; i++){
        vector<int> q1, q2;
        for(int j = -w + 1; j <= i; j++) q1.eb(l2[j + w - 1]);
        for(int j = i + k + 1; j <= h - 1; j++) q2.eb(l2[j + w - 1]);
//        cerr << "large2 " << i << "\n";
//        printv(q1, cerr);
//        printv(q2, cerr);
        int r1 = add_or(q1), r2 = add_or(q2);
        large.eb(add_and({r1, r2}));
    }

    vector<int> small;

    for(int i = 0; i + k <= h + w - 2; i++){
//        cerr << "small1 " << i << "\n";
//        printv(q1, cerr);
//        printv(q2, cerr);
        small.eb(add_and({l1[i], l1[i + k]}));
    }

    for(int i = -w + 1; i + k <= h - 1; i++){
//        cerr << "small2 " << i << "\n";
//        printv(q1, cerr);
//        printv(q2, cerr);
        small.eb(add_and({l2[i + w - 1], l2[i + k + w - 1]}));
    }

    if(large.empty()){
        add_or(small);
        return;
    }

    int rl = add_not(add_or(large)), rs = add_or(small);
    add_and({rl, rs});
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 9 ms 972 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 7 ms 844 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 13 ms 1356 KB Output is correct
44 Correct 9 ms 972 KB Output is correct
45 Correct 6 ms 716 KB Output is correct
46 Correct 4 ms 460 KB Output is correct
47 Correct 3 ms 460 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1060 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 10 ms 972 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 10 ms 1060 KB Output is correct
10 Correct 6 ms 716 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 12 ms 972 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 4 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 5 ms 716 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 1032 KB Output is correct
9 Correct 8 ms 904 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 4 ms 460 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 10 ms 1004 KB Output is correct
14 Correct 6 ms 716 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 10 ms 972 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 26 ms 2620 KB Output is correct
21 Correct 15 ms 1612 KB Output is correct
22 Correct 10 ms 972 KB Output is correct
23 Correct 5 ms 588 KB Output is correct
24 Correct 27 ms 2652 KB Output is correct
25 Correct 11 ms 1240 KB Output is correct
26 Correct 5 ms 588 KB Output is correct
27 Correct 47 ms 4492 KB Output is correct
28 Correct 31 ms 3008 KB Output is correct
29 Correct 20 ms 2052 KB Output is correct
30 Correct 13 ms 1356 KB Output is correct
31 Correct 10 ms 1100 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 4676 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 5 ms 716 KB Output is correct
4 Correct 12 ms 1076 KB Output is correct
5 Correct 10 ms 972 KB Output is correct
6 Correct 10 ms 972 KB Output is correct
7 Correct 26 ms 2632 KB Output is correct
8 Correct 27 ms 2568 KB Output is correct
9 Correct 47 ms 4420 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 9 ms 972 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 7 ms 844 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 13 ms 1356 KB Output is correct
44 Correct 9 ms 972 KB Output is correct
45 Correct 6 ms 716 KB Output is correct
46 Correct 4 ms 460 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 10 ms 1060 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 10 ms 972 KB Output is correct
53 Correct 6 ms 588 KB Output is correct
54 Correct 2 ms 332 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 10 ms 1060 KB Output is correct
57 Correct 6 ms 716 KB Output is correct
58 Correct 4 ms 460 KB Output is correct
59 Correct 3 ms 460 KB Output is correct
60 Correct 2 ms 332 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 12 ms 972 KB Output is correct
63 Correct 6 ms 716 KB Output is correct
64 Correct 3 ms 460 KB Output is correct
65 Correct 4 ms 460 KB Output is correct
66 Correct 2 ms 332 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Correct 0 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 5 ms 716 KB Output is correct
73 Correct 4 ms 588 KB Output is correct
74 Correct 3 ms 460 KB Output is correct
75 Correct 2 ms 332 KB Output is correct
76 Correct 1 ms 332 KB Output is correct
77 Correct 10 ms 1032 KB Output is correct
78 Correct 8 ms 904 KB Output is correct
79 Correct 4 ms 588 KB Output is correct
80 Correct 4 ms 460 KB Output is correct
81 Correct 2 ms 332 KB Output is correct
82 Correct 10 ms 1004 KB Output is correct
83 Correct 6 ms 716 KB Output is correct
84 Correct 2 ms 332 KB Output is correct
85 Correct 1 ms 204 KB Output is correct
86 Correct 10 ms 972 KB Output is correct
87 Correct 3 ms 460 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 26 ms 2620 KB Output is correct
90 Correct 15 ms 1612 KB Output is correct
91 Correct 10 ms 972 KB Output is correct
92 Correct 5 ms 588 KB Output is correct
93 Correct 27 ms 2652 KB Output is correct
94 Correct 11 ms 1240 KB Output is correct
95 Correct 5 ms 588 KB Output is correct
96 Correct 47 ms 4492 KB Output is correct
97 Correct 31 ms 3008 KB Output is correct
98 Correct 20 ms 2052 KB Output is correct
99 Correct 13 ms 1356 KB Output is correct
100 Correct 10 ms 1100 KB Output is correct
101 Correct 0 ms 204 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 49 ms 4676 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 5 ms 716 KB Output is correct
106 Correct 12 ms 1076 KB Output is correct
107 Correct 10 ms 972 KB Output is correct
108 Correct 10 ms 972 KB Output is correct
109 Correct 26 ms 2632 KB Output is correct
110 Correct 27 ms 2568 KB Output is correct
111 Correct 47 ms 4420 KB Output is correct
112 Correct 0 ms 204 KB Output is correct
113 Correct 0 ms 204 KB Output is correct
114 Correct 31 ms 2972 KB Output is correct
115 Correct 1 ms 204 KB Output is correct
116 Correct 10 ms 1072 KB Output is correct
117 Correct 6 ms 716 KB Output is correct
118 Correct 20 ms 2032 KB Output is correct
119 Correct 20 ms 2004 KB Output is correct
120 Correct 20 ms 1996 KB Output is correct
121 Correct 20 ms 1972 KB Output is correct
122 Correct 19 ms 2020 KB Output is correct
123 Correct 48 ms 4488 KB Output is correct
124 Correct 31 ms 3036 KB Output is correct
125 Correct 20 ms 1972 KB Output is correct
126 Correct 20 ms 2000 KB Output is correct
127 Correct 13 ms 1308 KB Output is correct
128 Correct 10 ms 1100 KB Output is correct