Submission #894327

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
894327	2023-12-28T05:44:40 Z	Faisal_Saqib	Vision Program (IOI19_vision)	C++17	12 / 100	7 ms	1496 KB

vision

#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 which_diagonal1[40001];
int dia=0;
int dia1=0;
int which_diagonal2[40001];
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;
	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+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));
				which_diagonal1[f(ci,cj)]=dia;
				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));
				which_diagonal1[f(ci,cj)]=dia;
				ci++;
				cj++;
			}
			index_of_diagonal1[dia]=add_or(element);
			dia++;
		}
	}
	int fff=check_distance_is_atmost_x(k);
	int fss=check_distance_is_atmost_x(k-1);
	int res_f=add_xor({fff,fss});
	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>=0 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>=0 and cj>=0)
			{
				element.push_back(f(ci,cj));
				ci--;
				cj--;
			}		
			index_of_diagonal2[dia1]=add_or(element);
			dia1++;	
		}
	}
	int fff1=check_distance_is_atmost_x1(k);
	int fss1=check_distance_is_atmost_x1(k-1);
	int res_f1=add_xor({fff,fss});
	add_or({res_f1,res_f});
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:138:6: warning: unused variable 'fff1' [-Wunused-variable]
  138 |  int fff1=check_distance_is_atmost_x1(k);
      |      ^~~~
vision.cpp:139:6: warning: unused variable 'fss1' [-Wunused-variable]
  139 |  int fss1=check_distance_is_atmost_x1(k-1);
      |      ^~~~

Subtask #1
0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	432 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Incorrect	344 KB	on inputs (0, 0), (1, 1), expected 1, but computed 0
7	Halted	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	432 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Incorrect	344 KB	on inputs (0, 0), (1, 1), expected 1, but computed 0
7	Halted	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	432 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Incorrect	344 KB	on inputs (0, 0), (1, 1), expected 1, but computed 0
7	Halted	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	432 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Incorrect	344 KB	on inputs (0, 0), (1, 1), expected 1, but computed 0
7	Halted	0 KB	-

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	604 KB	Output is correct
2	Correct	6 ms	1156 KB	Output is correct
3	Correct	6 ms	1200 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	6 ms	1116 KB	Output is correct
7	Correct	5 ms	860 KB	Output is correct
8	Correct	1 ms	492 KB	Output is correct
9	Correct	1 ms	676 KB	Output is correct
10	Correct	5 ms	1116 KB	Output is correct
11	Correct	6 ms	1112 KB	Output is correct
12	Correct	7 ms	1112 KB	Output is correct
13	Correct	5 ms	860 KB	Output is correct
14	Correct	1 ms	424 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	5 ms	1120 KB	Output is correct
17	Correct	6 ms	1116 KB	Output is correct
18	Correct	6 ms	1116 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	424 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct

Subtask #6
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Incorrect	1 ms	604 KB	on inputs (0, 0), (1, 1), expected 1, but computed 0
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	7 ms	1496 KB	on inputs (126, 120), (176, 169), expected 0, but computed 1
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	432 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Incorrect	344 KB	on inputs (0, 0), (1, 1), expected 1, but computed 0
7	Halted	0 KB	-