oj.uz

Submission #417005

# Submission time Handle Problem Language Result Execution time Memory
417005 2021-06-03T10:16:20 Z Kevin_Zhang_TW Vision Program (IOI19_vision) C++17
0 / 100
 30 ms 1872 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "vision.h"

const int MAX_N = 300010;

void construct_network(int H, int W, int K) {

	auto to_id = [&](pair<int,int> a) { 
		return a.first * W + a.second;
	};
	auto valid = [&](pair<int,int> a) {
		auto [i, j] = a;
		return i >= 0 && i < H && j >= 0 && j < H;
	};
	// I put self in it too
	auto dis_k_up = [&](int x, int y) {
		vector<int> res;
		auto upd = [&](int x, int y) {
			pair<int,int> a(x, y);
			if (valid(a)) res.pb(to_id(a));
		};
		for (int i = 0;i <= K;++i) {
			int j = K - i;
			upd(x-i, y+j);
			if (j) upd(x-i, y-j);
		}
		return res;
	};

	vector<int> res;
	for (int i = 0;i < H;++i) for (int j = 0;j < W;++j) {
		auto vec = dis_k_up(i, j);
		if (vec.empty()) continue;
		int a = add_or( vec );
		vector<int> ans {a, to_id(make_pair(i, j)) };
		res.pb(add_and(ans));
	}

	add_or(res);

//
//	std::vector<int> Ns;
//	Ns = {0, 1};
//	int a = add_and(Ns);
//	Ns = {0, a};
//	int b = add_or(Ns);
//	Ns = {0, 1, b};
//	int c = add_xor(Ns);
//	add_not(c);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 5 ms 712 KB Output is correct
4 Correct 17 ms 1596 KB Output is correct
5 Correct 30 ms 1872 KB Output is correct
6 Correct 19 ms 1668 KB Output is correct
7 Correct 9 ms 940 KB Output is correct
8 Correct 3 ms 588 KB Output is correct
9 Correct 12 ms 1224 KB Output is correct
10 Correct 10 ms 1052 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 412 KB Output is correct
19 Incorrect 3 ms 460 KB on inputs (0, 0), (197, 0), expected 0, but computed 1
20 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1096 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -