oj.uz

답안 #316590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316590 2020-10-26T18:49:11 Z amunduzbaev Vision Program (IOI19_vision) C++14
12 / 100
 3 ms 1124 KB 
//#include "grader.cpp"
#include "vision.h"
#include <bits/stdc++.h>
#define pb(a) push_back(a)
using namespace std;
const int N = 1e7+5;
int d, h, w, used[N], cnt=0;

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*w+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*w+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*w+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*w+y);
		}
	}
	if(v.size()){
		add_or(v);
		used[cnt]=xx*w+yy;
		cnt++;
	}
}	
void construct_network(int H, int W, int k) {

	d=k, h=H, w=W;

	if(min(h,w) == 1){
		h=max(h,w);
		int l=0;
		for(int i=0; i+k<h; i++){
			add_and({i,i+k});
			l++;
		}
		vector<int>v;
		for(int i=0;i<l;i++){
			v.pb(i+h);
		}
		add_or(v);
		return;
	}
	else if(max(h,w) <= 30){
		for(int i=0;i<h;i++)
			for(int j=0;j<w;j++) fun(i,j);
		int last = h*w;
		for(int i=0; i<cnt; i++){
			int cur = used[i], cur1 = i+last;
			vector<int> v;
			v.pb(cur);
			v.pb(cur1);
			add_and(v);
		}
		vector<int>v;
		for(int j=0; j<cnt; j++){
			int i=last+cnt+j;
			v.pb(i);
		}
		add_or(v);
	}
	if(k==1){
		int cur, cur1, size=0;
		for(int i=0;i<h;i++){
			for(int j=0;j<w-1;j++){
				vector<int> v;
				cur=i*w+j, cur1=i*w+j+1;
				v.pb(cur);
				v.pb(cur1);
				add_and(v);
				size++;
			}
		}
		for(int i=0;i<h-1;i++){
			for(int j=0;j<w;j++){
				vector<int> v;
				cur=i*w+j, cur1=(i+1)*w+j;
				v.pb(cur);
				v.pb(cur1);
				add_and(v);
				size++;
			}
		}
		vector<int>v;
		for(int i=w*h;i<w*h+size;i++){
			v.pb(i);
		}
		add_or(v);
	}
}

/*

2 3 3 
0 5
2 3

*/

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1124 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 0, but computed 1
6 Halted 0 ms 0 KB -