oj.uz

답안 #682700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682700 2023-01-16T20:03:26 Z APROHACK Vision Program (IOI19_vision) C++14
8 / 100
 1 ms 304 KB 
#include "vision.h"
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
int h, w, k;
bool valid(int x, int y){
	return (x < h && y < w && x >= 0 &&  y >= 0);
}
int coordenadasAPosicion (int x, int y){
	return x*w + y;
}


void construct_network(int H, int W, int K) {
	h = H, w = W, k = K;
	int cuenta = 0;
	vector<int>toOr;

	for(int i = 0 ; i < H ; i ++){
		for(int j = 0 ; j < W ; j ++){
			if(i>0 || j>0)continue;
			if(valid(i, j)){
				vector<int>toXor;
				//cout << "Esto fue para " << i << " " << j << endl;
				for(int abajo = k ; abajo > -k ; abajo--){
					
					if(valid(i+abajo, j+k-abs(abajo))){
						//cout << "valid = " << i+abajo << ", " << j+k-abs(abajo)<<endl;
						toXor.pb(coordenadasAPosicion(i+abajo, j+k-abs(abajo)));
						//add_and({coordenadasAPosicion(i, j), coordenadasAPosicion(i+abajo, j+k-abs(abajo))});
						//cuenta ++;
					}
				}
				
				if(toXor.empty())continue;
				toXor.pb(coordenadasAPosicion(i, j));
				add_xor(toXor);
				add_not({H*W+cuenta});
				//cout << "analising " << H*W+cuenta << endl;
				cuenta+=2;
				add_and({H*W+cuenta-1, coordenadasAPosicion(i, j)});
				//cout << "and to position" << H*W+cuenta-1 << endl;
				cuenta++;
				toOr.pb({H*W+cuenta-1});

				

			}
		}
	}
	add_or(toOr);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 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 1 ms 212 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 1 ms 212 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 1 ms 212 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 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 296 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 292 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 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 1 ms 212 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -