oj.uz

답안 #297669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297669 2020-09-11T17:42:40 Z _7_7_ Vision Program (IOI19_vision) C++14
26 / 100
 14 ms 2048 KB 
#include "vision.h"
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 212;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

int h, w, k, l[N << 1], r[N << 1];
vi gl[N << 1] , gr[N << 1], tmp;


bool in (int x, int y) {
	return x >= 0 && y >= 0 && x < h && y < w;
}

int f (int k) {
    vi vl, vr;
	for (int i = 0; i + k <= h + w - 2; ++i) {
		tmp.clear();
		for (int j = i; j <= i + k; ++j)
			tmp.pb(l[j]);
		int X = add_xor(tmp), O = add_or(tmp);
		vl.pb(add_xor({X, O}));

		tmp.clear();
		for (int j = i; j <= i + k; ++j)
			tmp.pb(r[j]);
		X = add_xor(tmp), O = add_or(tmp);
		vr.pb(add_xor({X, O}));
	}	

	return add_and({add_or(vl), add_or(vr)});
}

void construct_network(int H, int W, int K) {
	h = H, w = W, k = K;
	for (int i = 0; i < h; ++i)
		for (int j = 0; j < w; ++j) {
			gl[i + j].pb(i*w + j);   
			gr[i - j + w - 1].pb(i*w + j);
		}
 	
	for (int i = 0; i <= h + w - 2; ++i) {
		l[i] = add_or(gl[i]);
		r[i] = add_or(gr[i]);
	} 	    	
		
	vi V;
	V.pb(f(k));
	if (k)
		V.pb(f(k - 1));
	add_xor(V);	
}

Subtask #1
0 / 10.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 11 ms 1152 KB Output is correct
3 Correct 13 ms 1152 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 9 ms 1024 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 11 ms 1152 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 10 ms 1024 KB Output is correct
17 Correct 11 ms 1056 KB Output is correct
18 Correct 10 ms 1152 KB Output is correct
19 Correct 8 ms 896 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct

Subtask #6
0 / 8.0

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

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 2048 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 9 ms 1440 KB Output is correct
9 Correct 14 ms 2048 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #8
0 / 19.0

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