oj.uz

답안 #1070296

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070296 2024-08-22T12:55:53 Z Gray Vision Program (IOI19_vision) C++17
0 / 100
 15 ms 2520 KB 
#include "vision.h"
#include<bits/stdc++.h>

using namespace std;
#define ll int
#define ff first
#define ss second
#define ln "\n"
#define ld long double

ll h, w, k;
ll encode(ll i, ll j){
	return i*w+j;
}
pair<ll,ll> decode(ll x){
	return {x/w, x%w};
}
vector<pair<ll, ll>> mult = {{1, 1}, {-1, -1}, {-1, 1}, {1, -1}};
void construct_network(int H, int W, int K) {
	h=H; w=W; k=K;
	vector<ll> fs;
	for (ll i=0; i<h; i++){
		for (ll j=0; j<w; j++){
			if ((i+j)%2) continue;
			vector<ll> qry;
			for (ll ri=0; ri<=k; ri++){
				ll rj = k-ri;
				for (auto mch:mult){
					ll ni = i+mch.ff*ri, nj = j+mch.ss*rj;
					if (ni>=0 and ni<h and nj>=0 and nj<w){
						qry.push_back(encode(ni, nj));
					}
				}
			}
			if (!qry.size()) continue;
			fs.push_back(add_and({add_or(qry), encode(i, j)}));
		}
	}
	add_or(fs);
}

Subtask #1
0 / 10.0

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

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB on inputs (0, 1), (0, 101), expected 1, but computed 0
4 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 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 5 ms 1116 KB Output is correct
5 Correct 4 ms 796 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 4 ms 1020 KB Output is correct
9 Correct 15 ms 2520 KB Output is correct
10 Correct 9 ms 1752 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 3 ms 1492 KB WA in grader: Too many instructions
21 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1240 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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