oj.uz

Submission #316515

# Submission time Handle Problem Language Result Execution time Memory
316515 2020-10-26T13:48:00 Z amunduzbaev Vision Program (IOI19_vision) C++14
0 / 100
 3 ms 1020 KB 
//#include "grader.cpp"
#include "vision.h"
#include <bits/stdc++.h>
#define pb(a) push_back(a)
using namespace std;

int d, h, w;

void fun(int xx,int yy){
	vector<int> v;
	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.pb(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.pb(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.pb(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.pb(x*h+y);
		}
	}
	add_or(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);
	int last = h*w;
	int i;
	for(i=0; i<last; i++){
		int cur = i, cur1 = i+last;
		vector<int> v;
		v.pb(cur);
		v.pb(cur1);
		add_and(v);
	}
	i+=last;
	vector<int>v;
	for(int j=0; j<last; j++){
		int cur=j+i;
		v.push_back(cur);
	}
	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 WA in grader: Instruction with no inputs
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 WA in grader: Instruction with no inputs
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 WA in grader: Instruction with no inputs
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 WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Incorrect 1 ms 256 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 1 ms 384 KB WA in grader: Invalid index
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1020 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 WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -