oj.uz

Submission #316489

# Submission time Handle Problem Language Result Execution time Memory
316489 2020-10-26T13:00:10 Z amunduzbaev Vision Program (IOI19_vision) C++14
0 / 100
 4 ms 1148 KB 
//#include "grader.cpp"
#define pb(a) push_back(a)
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 40005;
int d, h, w, used[N];
void fun(int xx,int yy){
	vector<int> v;
	v.pb(xx*h+yy);
	for(int i=0;i<=d;i++){
		int x = xx-i, y = yy-(d-i);
		if(x>=0 && x<h && y>=0 && y<w)
			v.push_back(x*h+y);
	}
	for(int i=0;i<d;i++){
		int x = xx-i, y = yy+(d-i);
		if(x>=0 && x<h && y>=0 && y<w)
			v.push_back(x*h+y);
	}
	for(int i=1;i<=d;i++){
		int x = xx+i, y = yy-(d-i);
		if(x>=0 && x<h && y>=0 && y<w)
			v.push_back(x*h+y);
	}
	for(int i=1;i<d;i++){
		int x = xx+i, y = yy+(d-i);
		if(x>=0 && x<h && y>=0 && y<w)
			v.push_back(x*h+y);
	}
	add_and(v);
}
void construct_network(int H, int W, int k) {
	d=k, h=H, w=W;
	for(int i=0;i<h;i++)
		for(int j=0;j<w;j++) fun(i,j);
	vector<int> v;
	for(int i=0;i<h*w;i++)
		v.pb(i+(w*h));
	add_or(v);
}

/*

2 3 3 
0 5
2 3

*/

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1148 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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