oj.uz

답안 #294879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294879 2020-09-09T10:16:55 Z egekabas Vision Program (IOI19_vision) C++14
0 / 100
 24 ms 3580 KB 
#include "vision.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int sel[200*200+5];
vector<int> g[200*200+5];
vector<pii> dir{{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
void construct_network(int H, int W, int K){
	vector<int> finalcomp;
	for(int i = 0; i < H; ++i)
		for(int j = 0; j < W; ++j){
			for(int k = 0; k <= K; ++k)
				for(auto u : dir){
					int i1 = i + u.ff*k;
					int j1 = j + u.ss*(K-k);
					if(i1 >= 0 && i1 < H && j1 >= 0 && j1 < W)
						g[i*W+j].pb(i1*W+j1);
				}
			finalcomp.pb(add_and({i*W+j, add_or(g[i*W+j])}));
		}
	add_or(finalcomp);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Incorrect 1 ms 1280 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Incorrect 1 ms 1280 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Incorrect 1 ms 1280 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Incorrect 1 ms 1280 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1348 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Incorrect 1 ms 1280 KB WA in grader: Instruction with no inputs
4 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 10 ms 2044 KB Output is correct
4 Correct 24 ms 3580 KB Output is correct
5 Correct 16 ms 2812 KB Output is correct
6 Incorrect 2 ms 1408 KB WA in grader: Instruction with no inputs
7 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Incorrect 1 ms 1280 KB WA in grader: Instruction with no inputs
3 Halted 0 ms 0 KB -