oj.uz

답안 #892913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892913 2023-12-26T07:20:36 Z Muhammad_Aneeq Vision Program (IOI19_vision) C++17
0 / 100
 1000 ms 109136 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<H;i++)
		for (int j=0;j<W;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

# 결과 실행 시간 메모리 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 #2
0 / 11.0

# 결과 실행 시간 메모리 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 #3
0 / 11.0

# 결과 실행 시간 메모리 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 #4
0 / 15.0

# 결과 실행 시간 메모리 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 #5
0 / 12.0

# 결과 실행 시간 메모리 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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 48 ms 8704 KB Output is correct
5 Correct 26 ms 5212 KB Output is correct
6 Correct 10 ms 2048 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 5 ms 1884 KB Output is correct
9 Correct 182 ms 25572 KB Output is correct
10 Correct 84 ms 14928 KB Output is correct
11 Correct 27 ms 4440 KB Output is correct
12 Correct 11 ms 348 KB Output is correct
13 Correct 0 ms 424 KB Output is correct
14 Correct 0 ms 428 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 15 ms 5176 KB Output is correct
21 Execution timed out 1044 ms 109136 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 10320 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 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 -