oj.uz

답안 #301044

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301044 2020-09-17T16:00:27 Z MickyOr Vision Program (IOI19_vision) C++17
14 / 100
 62 ms 6132 KB 
#include "vision.h"
#include <bits/stdc++.h>
#define fore(i, b, e) for (int i = b; i < (int)e; ++i)
#define pb push_back

using namespace std;

typedef vector<int> vi;

vector<vi> diagL(410), diagR(410);

vi getRes(int H, int W, int k, vector<vi> &diag) {
	vi res, v, pref;
	fore(i, 0, H+W-1) {
		v.pb(add_or(diag[i]));
		pref.pb(add_or(v));
		if (i > 0) {
			if (i >= k) {
				int tmp = add_xor({pref[i-1], pref[i-k]});
				res.pb( add_and({v[i], tmp}) );
			}
			else if (i == k-1) {
				res.pb( add_and({v[i], pref[i-1]}) );
			}
		}
	}
	return res;
}

// dist < k
int solve(int H, int W, int k) {
	vi resR, resL;
	resL = getRes(H, W, k, diagL);
	resR = getRes(H, W, k, diagR);
	int rL = add_or(resL);
	int rR = add_or(resR);
	return add_and({rL, rR});
}

void construct_network(int H, int W, int K) {
	fore(i, 0, H) {
		fore(j, 0, W) {
			diagL[i+j].pb(i*W + j);
			diagR[i-j+W-1].pb(i*W + j);
		}
	}
	add_xor({solve(H, W, K), solve(H, W, K+1)});
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 6004 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 7 ms 1024 KB Output is correct
4 Correct 12 ms 1408 KB Output is correct
5 Correct 11 ms 1280 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 33 ms 3444 KB Output is correct
8 Correct 33 ms 3444 KB Output is correct
9 Correct 62 ms 6132 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct

Subtask #8
0 / 19.0

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