oj.uz

Submission #894432

# Submission time Handle Problem Language Result Execution time Memory
894432 2023-12-28T09:24:21 Z Faisal_Saqib Vision Program (IOI19_vision) C++17
100 / 100
 39 ms 4440 KB 
#include <vector>
#include <string>
#include <map>
using namespace std;
 
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);
int h,w,k;
int dia=0,xor1=0;
int dia1=0,xor2=0;
int index_of_diagonal1[401];
int index_of_diagonal2[401];
int f(int i,int j)
{
	return (i*w)+j;
}
int check_distance_is_atmost_x(int x)
{
	// check subarray of length x+1
	vector<int> dp={xor1};
	for(int di=0;(di+x)<dia;di++)
	{
		vector<int> cur;
		for(int j=0;j<=x;j++)
			cur.push_back(index_of_diagonal1[di+j]);
		dp.push_back(add_xor({add_xor(cur),add_or(cur)}));
	}
	// Ask xor and or
	// if xor==0 and or==1 then distance is atmost 
	// if(dp.size()==0)
	// {
	// 	cout<<"size of dp is "<<0<<endl;
	// 	exit(-100);
	// }
	return add_or(dp);
}
int check_distance_is_atmost_x1(int x)
{
	// // check subarray of length x+1
	// {
	// 	vector<int> dp;
	// 	for(int di=0;(di)<dia1;di++)
	// 		dp.push_back(di);
	// 	if(add_xor(dp))
	// }
	vector<int> dp={xor2};
	for(int di=0;(di+x)<dia1;di++)
	{
		vector<int> cur;
		for(int j=0;j<=x;j++)
			cur.push_back(index_of_diagonal2[di+j]);
		dp.push_back(add_xor({add_xor(cur),add_or(cur)}));
	}
	// Ask xor and or
	// if xor==0 and or==1 then distance is atmost 
	return add_or(dp);
}
void construct_network(int H, int W, int K)
{
	h=H;
	w=W;
	k=K;
	for(int j=0;j<1;j++)
	{
		for(int i=h-1;i>=0;i--)
		{
			vector<int> element;
			int ci=i;
			int cj=j;
			while(ci<h and cj<w)
			{
				element.push_back(f(ci,cj));
				ci++;
				cj++;
			}
			index_of_diagonal1[dia]=add_or(element);
			dia++;
		}
	}
	for(int i=0;i<1;i++)
	{
		for(int j=1;j<w;j++)
		{
			int ci=i;
			int cj=j;
			vector<int> element;
			while(ci<h and cj<w)
			{
				element.push_back(f(ci,cj));
				ci++;
				cj++;
			}
			index_of_diagonal1[dia]=add_or(element);
			dia++;
		}
	}
	{
		vector<int> ship;
		for(int i=0;i<dia;i++)
		{
			ship.push_back(index_of_diagonal1[i]);
		}
		xor1=add_xor(ship);
	}
	int fff=check_distance_is_atmost_x(k);
	int fss=check_distance_is_atmost_x(k-1);
	dia1=0;
	for(int i=0;i<1;i++)
	{
		for(int j=0;j<w;j++)
		{
			int ci=i;
			int cj=j;
			vector<int> element;
			while(ci<h and cj>=0)
			{
				element.push_back(f(ci,cj));
				ci++;
				cj--;
			}		
			index_of_diagonal2[dia1]=add_or(element);
			dia1++;	
		}
	}
	for(int j=w-1;j<w;j++)
	{
		for(int i=1;i<h;i++)
		{
			int ci=i;
			int cj=j;
			vector<int> element;
			while(ci<h and cj>=0)
			{
				element.push_back(f(ci,cj));
				ci++;
				cj--;
			}		
			index_of_diagonal2[dia1]=add_or(element);
			dia1++;
		}
	}
	{
		vector<int> ship;
		for(int i=0;i<dia1;i++)
		{
			ship.push_back(index_of_diagonal2[i]);
		}
		xor2=add_xor(ship);
	}
	int fff1=check_distance_is_atmost_x1(k);
	int fss1=check_distance_is_atmost_x1(k-1);
	// We check mx<=k that is
	add_and({add_and({fff,fff1}),add_not(add_and({fss,fss1}))});
	// add_or({add_and({fff,add_not(fss)}),add_and({fff1,add_not(fss1)})});
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
12 Correct 0 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 1 ms 604 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 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 1 ms 348 KB Output is correct
12 Correct 0 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 1 ms 604 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 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 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 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 1 ms 348 KB Output is correct
12 Correct 0 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 1 ms 604 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 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 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 0 ms 428 KB Output is correct
32 Correct 1 ms 348 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 348 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

# Verdict Execution time Memory 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 1 ms 348 KB Output is correct
12 Correct 0 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 1 ms 604 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 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 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 0 ms 428 KB Output is correct
32 Correct 1 ms 348 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 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 8 ms 1204 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 4 ms 860 KB Output is correct
44 Correct 8 ms 1368 KB Output is correct
45 Correct 9 ms 1372 KB Output is correct
46 Correct 8 ms 1048 KB Output is correct
47 Correct 2 ms 600 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 8 ms 1112 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 6 ms 868 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct
11 Correct 7 ms 1216 KB Output is correct
12 Correct 9 ms 1112 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 6 ms 1112 KB Output is correct
17 Correct 7 ms 1216 KB Output is correct
18 Correct 7 ms 1112 KB Output is correct
19 Correct 5 ms 860 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct
11 Correct 5 ms 856 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 6 ms 1116 KB Output is correct
15 Correct 7 ms 856 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 7 ms 1116 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 5 ms 984 KB Output is correct
21 Correct 18 ms 2396 KB Output is correct
22 Correct 17 ms 2396 KB Output is correct
23 Correct 4 ms 856 KB Output is correct
24 Correct 6 ms 984 KB Output is correct
25 Correct 19 ms 2644 KB Output is correct
26 Correct 4 ms 856 KB Output is correct
27 Correct 9 ms 1496 KB Output is correct
28 Correct 28 ms 3788 KB Output is correct
29 Correct 34 ms 4432 KB Output is correct
30 Correct 28 ms 3492 KB Output is correct
31 Correct 8 ms 1112 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1496 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 5 ms 984 KB Output is correct
8 Correct 5 ms 908 KB Output is correct
9 Correct 9 ms 1588 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 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 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 1 ms 348 KB Output is correct
12 Correct 0 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 1 ms 604 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 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 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 0 ms 428 KB Output is correct
32 Correct 1 ms 348 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 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 8 ms 1204 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 4 ms 860 KB Output is correct
44 Correct 8 ms 1368 KB Output is correct
45 Correct 9 ms 1372 KB Output is correct
46 Correct 8 ms 1048 KB Output is correct
47 Correct 2 ms 600 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 8 ms 1112 KB Output is correct
50 Correct 7 ms 1116 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 2 ms 604 KB Output is correct
53 Correct 7 ms 1116 KB Output is correct
54 Correct 6 ms 868 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 6 ms 1116 KB Output is correct
58 Correct 7 ms 1216 KB Output is correct
59 Correct 9 ms 1112 KB Output is correct
60 Correct 6 ms 856 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 6 ms 1112 KB Output is correct
64 Correct 7 ms 1216 KB Output is correct
65 Correct 7 ms 1112 KB Output is correct
66 Correct 5 ms 860 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 348 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 2 ms 600 KB Output is correct
73 Correct 3 ms 604 KB Output is correct
74 Correct 4 ms 860 KB Output is correct
75 Correct 3 ms 604 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 7 ms 860 KB Output is correct
79 Correct 7 ms 1116 KB Output is correct
80 Correct 5 ms 856 KB Output is correct
81 Correct 2 ms 344 KB Output is correct
82 Correct 2 ms 600 KB Output is correct
83 Correct 6 ms 1116 KB Output is correct
84 Correct 7 ms 856 KB Output is correct
85 Correct 0 ms 504 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 7 ms 1116 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 5 ms 984 KB Output is correct
90 Correct 18 ms 2396 KB Output is correct
91 Correct 17 ms 2396 KB Output is correct
92 Correct 4 ms 856 KB Output is correct
93 Correct 6 ms 984 KB Output is correct
94 Correct 19 ms 2644 KB Output is correct
95 Correct 4 ms 856 KB Output is correct
96 Correct 9 ms 1496 KB Output is correct
97 Correct 28 ms 3788 KB Output is correct
98 Correct 34 ms 4432 KB Output is correct
99 Correct 28 ms 3492 KB Output is correct
100 Correct 8 ms 1112 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 9 ms 1496 KB Output is correct
104 Correct 0 ms 344 KB Output is correct
105 Correct 2 ms 604 KB Output is correct
106 Correct 2 ms 604 KB Output is correct
107 Correct 2 ms 604 KB Output is correct
108 Correct 1 ms 600 KB Output is correct
109 Correct 5 ms 984 KB Output is correct
110 Correct 5 ms 908 KB Output is correct
111 Correct 9 ms 1588 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 28 ms 3792 KB Output is correct
115 Correct 1 ms 348 KB Output is correct
116 Correct 2 ms 604 KB Output is correct
117 Correct 12 ms 1628 KB Output is correct
118 Correct 13 ms 1880 KB Output is correct
119 Correct 33 ms 4432 KB Output is correct
120 Correct 35 ms 4436 KB Output is correct
121 Correct 39 ms 4440 KB Output is correct
122 Correct 33 ms 4400 KB Output is correct
123 Correct 9 ms 1572 KB Output is correct
124 Correct 28 ms 3800 KB Output is correct
125 Correct 35 ms 4436 KB Output is correct
126 Correct 34 ms 4436 KB Output is correct
127 Correct 27 ms 3524 KB Output is correct
128 Correct 9 ms 1116 KB Output is correct