oj.uz

Submission #301025

# Submission time Handle Problem Language Result Execution time Memory
301025 2020-09-17T15:55:39 Z MickyOr Vision Program (IOI19_vision) C++17
12 / 100
 59 ms 6004 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.back(), tmp}) );
			}
			else {
				res.pb( add_and({v.back(), 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_or({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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1280 KB Output is correct
2 Correct 13 ms 1280 KB Output is correct
3 Correct 11 ms 1280 KB Output is correct
4 Correct 11 ms 1152 KB Output is correct
5 Correct 11 ms 1280 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 11 ms 1280 KB Output is correct
8 Correct 12 ms 1152 KB Output is correct
9 Correct 11 ms 1408 KB Output is correct
10 Correct 11 ms 1280 KB Output is correct
11 Correct 11 ms 1280 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 11 ms 1280 KB Output is correct
14 Correct 10 ms 1280 KB Output is correct
15 Correct 12 ms 1280 KB Output is correct
16 Correct 11 ms 1280 KB Output is correct
17 Correct 11 ms 1280 KB Output is correct
18 Correct 11 ms 1280 KB Output is correct
19 Correct 11 ms 1280 KB Output is correct
20 Correct 11 ms 1280 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 7 ms 1024 KB Output is correct
4 Incorrect 9 ms 896 KB on inputs (0, 0), (3, 28), expected 1, but computed 0
5 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 6004 KB on inputs (126, 120), (176, 169), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -