oj.uz

답안 #824591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824591 2023-08-14T08:04:42 Z vjudge1 Vision Program (IOI19_vision) C++17
26 / 100
 9 ms 1488 KB 
#include<bits/stdc++.h>
#include "vision.h"

using namespace std;

vector<int> rows;
vector<int> cols;

int f(int k) {
	vector<int> w;
	for(int i = 0; i < (int)rows.size() - k; i++) {
		vector<int> v;
		for(int j = 0; j <= k; j++) v.push_back(rows[i + j]);
		int t1 = add_or(v);
		int t2 = add_xor(v);
		w.push_back(add_xor({t1, t2}));
	}
	int t1 = add_or(w);
	w.clear();
	for(int i = 0; i < (int)cols.size() - k; i++) {
		vector<int> v;
		for(int j = 0; j <= k; j++) v.push_back(cols[i + j]);
		int t1 = add_or(v);
		int t2 = add_xor(v);
		w.push_back(add_xor({t1, t2}));
	}
	int t2 = add_or(w);
	return add_and({t1, t2});
}

void construct_network(int H, int W, int K) {
	for(int x = 0; x <= H + W - 2; x++) {
		vector<int> v;
		for(int i = 0; i <= x; i++) {
			int j = x - i;
			if(i < H && j < W) 
				v.push_back(i * W + j);
		}
		if(v.empty()) continue;
		rows.push_back(add_or(v));
	}
	for(int y = -W + 1; y <= H - 1; y++) {
		vector<int> v; 
		for(int i = 0; i < H; i++) {
			int j = i - y;
			if(j < W && j >= 0) 	
				v.push_back(i * W + j);
		}
		if(v.empty()) continue;
		cols.push_back(add_or(v));
	}
	int t1 = f(K), t2 = f(K - 1);
	t2 = add_not(t2);
	add_and({t1, t2});
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 7 ms 1040 KB Output is correct
3 Correct 8 ms 948 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 6 ms 872 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 8 ms 1052 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 6 ms 980 KB Output is correct
17 Correct 7 ms 980 KB Output is correct
18 Correct 7 ms 980 KB Output is correct
19 Correct 5 ms 852 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #6
0 / 8.0

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

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1488 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 5 ms 976 KB Output is correct
8 Correct 5 ms 976 KB Output is correct
9 Correct 9 ms 1488 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
0 / 19.0

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