oj.uz

Submission #943456

# Submission time Handle Problem Language Result Execution time Memory
943456 2024-03-11T13:33:43 Z djs100201 Vision Program (IOI19_vision) C++17
100 / 100
 25 ms 5240 KB 
#include<bits/stdc++.h>
#include "vision.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using PP = pair<ll, P>;
const ll n_ =2024+100, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353;
ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k;
ll gcd(ll x,ll y){
	if(!y)return x;
	return gcd(y,x%y);
}
int idx[n_][n_];
void construct_network(int H, int W, int K) {
	vector<int> Ns;
    for(int i=0;i<H;i++)
        for(int j=0;j<W;j++)idx[i][j]=base++;
    //0 1 2 3 .. W-1
    //
    vector<int>N(H),M(W);
    for(int i=0;i<H;i++){
        N[i]=base++;
        for(int j=0;j<W;j++)Ns.push_back(W*i+j);
        add_or(Ns);
        Ns.clear();
    }
    for(int i=0;i<W;i++){
        M[i]=base++;
        for(int j=0;j<H;j++)Ns.push_back(idx[j][i]);
        add_or(Ns);
        Ns.clear();
    }
    vector<int>N2(9,-1),M2(9,-1),C(9,-1),res(9,-1);
    for(int i=0;i<9;i++){
        a=(1ll<<i);
        vector<int>T;
        for(int j=0;j+a<H;j++){
            vector<int>T2;
            for(int k=j+a;k<H;k++){
                int dif=k-j;
                if(dif&a){
                    T2.push_back(N[k]);
                }
            }
            if(T2.empty())continue;
            int x=base++;
            add_or(T2);
            Ns={N[j],x};
            T.push_back(base++);
            add_and(Ns);
            Ns.clear();
        }
        if(T.empty())continue;
        N2[i]=base++;
        add_or(T);
    }
    for(int i=0;i<9;i++){
        a=(1ll<<i);
        vector<int>T;
        for(int j=0;j+a<W;j++){
            vector<int>T2;
            for(int k=j+a;k<W;k++){
                int dif=k-j;
                if(dif&a)T2.push_back(M[k]);
            }
            int x=base++;
            add_or(T2);
            Ns={M[j],x};
            T.push_back(base++);
            add_and(Ns);
            Ns.clear();
        }
        if(T.empty())continue;
        M2[i]=base++;
        add_or(T);
    }
    if(H>=2 && W>=2){
        res[0]=base++;
        add_xor({N2[0],M2[0]});
        C[1]=base++;
        add_and({N2[0],M2[0]});
        for(int i=1;i<9;i++){
            if(N2[i]==-1 && M2[i]==-1){
                res[i]=C[i];
                break;
            }
            if(N2[i]==-1){
                res[i]=base++;
                add_xor({M2[i],C[i]});
                C[i+1]=base++;
                add_and({M2[i],C[i]});
            }
            else if(M2[i]==-1){
                res[i]=base++;
                add_xor({N2[i],C[i]});
                C[i+1]=base++;
                add_and({N2[i],C[i]});
            }
            else{
                res[i]=base++;
                add_xor({N2[i],M2[i],C[i]});
                a=base++;
                add_and({N2[i],C[i]});
                b=base++;
                add_and({M2[i],C[i]});
                c=base++;
                add_and({N2[i],M2[i]});
                C[i+1]=base++;
                add_or({(int)a,(int)b,(int)c});
            }
        }
    }
    else if(H==1){
        for(int i=0;i<9;i++){
            res[i]=M2[i];
        }
    }
    else if(W==1){
        for(int i=0;i<9;i++){
            res[i]=N2[i];
        }
    }
    vector<int>fin;
    for(int i=0;i<9;i++){
        if(res[i]==-1)continue;
        //cout<<i<<' '<<res[i]<<' '<<B[res[i]]<<endl;
        a=(1<<i);
        if(!(K&a)){
            add_not(res[i]);
            res[i]=base++;
        }
        fin.push_back(res[i]);
    }
    add_and(fin);
    //cout<<res[0]<<' '<<B[res[0]]<<endl; 
 
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 436 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 436 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 1 ms 448 KB Output is correct
27 Correct 0 ms 444 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 436 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 1 ms 448 KB Output is correct
27 Correct 0 ms 444 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 1 ms 444 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 436 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 1 ms 448 KB Output is correct
27 Correct 0 ms 444 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 1 ms 444 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 6 ms 3164 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 2764 KB Output is correct
41 Correct 4 ms 2908 KB Output is correct
42 Correct 4 ms 2908 KB Output is correct
43 Correct 5 ms 3164 KB Output is correct
44 Correct 6 ms 3164 KB Output is correct
45 Correct 6 ms 3164 KB Output is correct
46 Correct 6 ms 3164 KB Output is correct
47 Correct 6 ms 3112 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1112 KB Output is correct
2 Correct 7 ms 1304 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 7 ms 1368 KB Output is correct
5 Correct 7 ms 3164 KB Output is correct
6 Correct 7 ms 3164 KB Output is correct
7 Correct 7 ms 3160 KB Output is correct
8 Correct 7 ms 3124 KB Output is correct
9 Correct 7 ms 1112 KB Output is correct
10 Correct 7 ms 1112 KB Output is correct
11 Correct 7 ms 1116 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 7 ms 1116 KB Output is correct
15 Correct 7 ms 3164 KB Output is correct
16 Correct 7 ms 3160 KB Output is correct
17 Correct 8 ms 3164 KB Output is correct
18 Correct 7 ms 3164 KB Output is correct
19 Correct 7 ms 3160 KB Output is correct
20 Correct 7 ms 3164 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 2908 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 3 ms 2652 KB Output is correct
6 Correct 3 ms 2904 KB Output is correct
7 Correct 3 ms 2652 KB Output is correct
8 Correct 5 ms 3164 KB Output is correct
9 Correct 5 ms 3160 KB Output is correct
10 Correct 5 ms 3160 KB Output is correct
11 Correct 5 ms 3160 KB Output is correct
12 Correct 5 ms 3164 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 7 ms 1360 KB Output is correct
15 Correct 7 ms 1116 KB Output is correct
16 Correct 7 ms 1112 KB Output is correct
17 Correct 7 ms 3316 KB Output is correct
18 Correct 7 ms 3164 KB Output is correct
19 Correct 7 ms 3164 KB Output is correct
20 Correct 12 ms 4056 KB Output is correct
21 Correct 12 ms 4056 KB Output is correct
22 Correct 12 ms 4056 KB Output is correct
23 Correct 12 ms 4056 KB Output is correct
24 Correct 12 ms 4052 KB Output is correct
25 Correct 12 ms 4056 KB Output is correct
26 Correct 12 ms 4056 KB Output is correct
27 Correct 25 ms 5080 KB Output is correct
28 Correct 21 ms 4876 KB Output is correct
29 Correct 19 ms 4860 KB Output is correct
30 Correct 20 ms 4920 KB Output is correct
31 Correct 19 ms 5072 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 5080 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 5 ms 3164 KB Output is correct
5 Correct 7 ms 1112 KB Output is correct
6 Correct 7 ms 3160 KB Output is correct
7 Correct 12 ms 4056 KB Output is correct
8 Correct 12 ms 4056 KB Output is correct
9 Correct 19 ms 4892 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 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 436 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 1 ms 448 KB Output is correct
27 Correct 0 ms 444 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 1 ms 444 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 6 ms 3164 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 2764 KB Output is correct
41 Correct 4 ms 2908 KB Output is correct
42 Correct 4 ms 2908 KB Output is correct
43 Correct 5 ms 3164 KB Output is correct
44 Correct 6 ms 3164 KB Output is correct
45 Correct 6 ms 3164 KB Output is correct
46 Correct 6 ms 3164 KB Output is correct
47 Correct 6 ms 3112 KB Output is correct
48 Correct 7 ms 1112 KB Output is correct
49 Correct 7 ms 1304 KB Output is correct
50 Correct 7 ms 1116 KB Output is correct
51 Correct 7 ms 1368 KB Output is correct
52 Correct 7 ms 3164 KB Output is correct
53 Correct 7 ms 3164 KB Output is correct
54 Correct 7 ms 3160 KB Output is correct
55 Correct 7 ms 3124 KB Output is correct
56 Correct 7 ms 1112 KB Output is correct
57 Correct 7 ms 1112 KB Output is correct
58 Correct 7 ms 1116 KB Output is correct
59 Correct 7 ms 1116 KB Output is correct
60 Correct 7 ms 1116 KB Output is correct
61 Correct 7 ms 1116 KB Output is correct
62 Correct 7 ms 3164 KB Output is correct
63 Correct 7 ms 3160 KB Output is correct
64 Correct 8 ms 3164 KB Output is correct
65 Correct 7 ms 3164 KB Output is correct
66 Correct 7 ms 3160 KB Output is correct
67 Correct 7 ms 3164 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 4 ms 2908 KB Output is correct
73 Correct 3 ms 2652 KB Output is correct
74 Correct 3 ms 2652 KB Output is correct
75 Correct 3 ms 2904 KB Output is correct
76 Correct 3 ms 2652 KB Output is correct
77 Correct 5 ms 3164 KB Output is correct
78 Correct 5 ms 3160 KB Output is correct
79 Correct 5 ms 3160 KB Output is correct
80 Correct 5 ms 3160 KB Output is correct
81 Correct 5 ms 3164 KB Output is correct
82 Correct 7 ms 1116 KB Output is correct
83 Correct 7 ms 1360 KB Output is correct
84 Correct 7 ms 1116 KB Output is correct
85 Correct 7 ms 1112 KB Output is correct
86 Correct 7 ms 3316 KB Output is correct
87 Correct 7 ms 3164 KB Output is correct
88 Correct 7 ms 3164 KB Output is correct
89 Correct 12 ms 4056 KB Output is correct
90 Correct 12 ms 4056 KB Output is correct
91 Correct 12 ms 4056 KB Output is correct
92 Correct 12 ms 4056 KB Output is correct
93 Correct 12 ms 4052 KB Output is correct
94 Correct 12 ms 4056 KB Output is correct
95 Correct 12 ms 4056 KB Output is correct
96 Correct 25 ms 5080 KB Output is correct
97 Correct 21 ms 4876 KB Output is correct
98 Correct 19 ms 4860 KB Output is correct
99 Correct 20 ms 4920 KB Output is correct
100 Correct 19 ms 5072 KB Output is correct
101 Correct 0 ms 344 KB Output is correct
102 Correct 1 ms 344 KB Output is correct
103 Correct 22 ms 5080 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 3 ms 2652 KB Output is correct
106 Correct 5 ms 3164 KB Output is correct
107 Correct 7 ms 1112 KB Output is correct
108 Correct 7 ms 3160 KB Output is correct
109 Correct 12 ms 4056 KB Output is correct
110 Correct 12 ms 4056 KB Output is correct
111 Correct 19 ms 4892 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 20 ms 4900 KB Output is correct
115 Correct 6 ms 1116 KB Output is correct
116 Correct 7 ms 3164 KB Output is correct
117 Correct 12 ms 4024 KB Output is correct
118 Correct 12 ms 4056 KB Output is correct
119 Correct 25 ms 4900 KB Output is correct
120 Correct 19 ms 5080 KB Output is correct
121 Correct 23 ms 5240 KB Output is correct
122 Correct 19 ms 5076 KB Output is correct
123 Correct 22 ms 4880 KB Output is correct
124 Correct 19 ms 5080 KB Output is correct
125 Correct 20 ms 5068 KB Output is correct
126 Correct 19 ms 5076 KB Output is correct
127 Correct 22 ms 4912 KB Output is correct
128 Correct 19 ms 5080 KB Output is correct