oj.uz

답안 #979507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979507 2024-05-11T06:55:19 Z yhkhoo Vision Program (IOI19_vision) C++17
0 / 100
 9 ms 1752 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

void construct_network(int H, int W, int K){
	if(H*W == 2){
		add_or({0, 1});
		return;
	}
	int d = H+W-1, mhw = min(H, W);
	int hw = add_and({0, 1, 2});
	vector<int> d1v;
	d1v.reserve(d);
	for(int i=0; i<d; i++){
		vector<int> cur;
		for(int j=0; j<mhw; j++){
			int ch = j, cw = i-j;
			if(ch > -1 && ch < H && cw > -1 && cw < W){
				cur.pb(cw + ch*W);
			}
		}
		d1v.pb(add_or(cur));
	}
	vector<int> d2v;
	d2v.reserve(d);
	for(int i=0; i<d; i++){
		vector<int> cur;
		for(int j=0; j<mhw; j++){
			int ch = j, cw = W-1-i+j;
			if(ch > -1 && ch < H && cw > -1 && cw < W){
				cur.pb(cw + ch*W);
			}
		}
		d2v.pb(add_or(cur));
	}
	vector<int> k1v, k2v, j1v, j2v;
	vector<int> pro;
	for(int i=0; i<K; i++){
		pro.pb(d1v[i]);
	}
	for(int j=K; j<d; j++){
		pro.pb(d1v[j]);
		k1v.pb(add_and({add_or(pro), add_not(add_xor(pro))}));
		pro.erase(pro.begin());
	}
	pro.clear();
	for(int i=0; i<K; i++){
		pro.pb(d2v[i]);
	}
	for(int j=K; j<d; j++){
		pro.pb(d2v[j]);
		k2v.pb(add_and({add_or(pro), add_not(add_xor(pro))}));
		pro.erase(pro.begin());
		
	}
	pro.clear();
	for(int i=0; i<K-1; i++){
		pro.pb(d1v[i]);
	}
	for(int j=K-1; j<d; j++){
		pro.pb(d1v[j]);
		j1v.pb(add_and({add_or(pro), add_not(add_xor(pro))}));
		pro.erase(pro.begin());
		
	}
	pro.clear();
	for(int i=0; i<K-1; i++){
		pro.pb(d2v[i]);
	}
	for(int j=K-1; j<d; j++){
		pro.pb(d2v[j]);
		j2v.pb(add_and({add_or(pro), add_not(add_xor(pro))}));
		pro.erase(pro.begin());
		
	}
	pro.clear();
	int k1 = add_or(k1v), k2 = add_or(k2v), j1, j2;
	if(K!=1){
		j1 = add_or(j1v), j2 = add_or(j2v);
	}
	else{
		j1 = hw, j2 = hw;
	}
	int nc = add_and({add_not(k1), add_not(k2)}), c1 = add_and({k1, add_not(j1)}), c2 = add_and({k2, add_not(j2)});
	cerr << nc << ' ' << c1 << ' ' << c2 << '\n';
	add_and({add_not(nc), add_or({c1, c2})});
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 7 ms 1116 KB Output is correct
3 Correct 7 ms 1112 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 436 KB WA in grader: Instruction with no inputs
6 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 436 KB Output is correct
3 Incorrect 0 ms 344 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Incorrect 0 ms 348 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -