oj.uz

Submission #892914

# Submission time Handle Problem Language Result Execution time Memory
892914 2023-12-26T07:21:14 Z Muhammad_Aneeq Vision Program (IOI19_vision) C++17
8 / 100
 1 ms 504 KB 
#include <vector>
#include <map>
#include "vision.h"
using namespace std;
int h,w;
int ind;
map<pair<int,int>,bool>d;
vector<int>g;
void check(int i,int j,int k,int l)
{
	if (i<0||i>=h||j<0||j>=w)
		return;
	int x=i*w+j;
	if (d[{x,k*w+l}]==1)
		return;
	d[{x,k*w+l}]=d[{k*w+l,x}]=1;
	g.push_back(x);
}
void check1(vector<int>z)
{
	add_or(z);
}
void construct_network(int H,int W,int K)
{
	h=H;w=W;
	ind = H*W;
	for (int i=0;i<=0;i++)
		for (int j=0;j<=0;j++)
		{
			g={};
			for (int k=0;k<=K;k++)
			{
				check(i+k,j+K-k,i,j);check(i+k,j-K+k,i,j);check(i-k,j-K+k,i,j);check(i-k,j+K-k,i,j);
			}
			if (g.size()&&i==0&&j==0)
			{
				ind+=2;
				add_and({add_or(g),i*w+j});
			}
		}
	vector<int>z;
	for (int i=H*W+1;i<ind;i+=2)
		z.push_back(i);
	check1(z);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 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 384 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 0 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 0 ms 348 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 500 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 504 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 420 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 428 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -