oj.uz

답안 #297122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297122 2020-09-11T09:23:16 Z _7_7_ Vision Program (IOI19_vision) C++14
0 / 100
 14 ms 1628 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, a[N][N];
vi tmp;


void construct_network(int H, int W, int K) {
	h = H, w = W, k = K;
	int l = 0, r = h*w - 1, j = -1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		tmp.clear();
		for (int j = l; j <= mid; ++j)
			tmp.pb(j);
		
		if (add_or(tmp)) {
			j = mid;
			r = mid - 1;
		} else 
			l = mid + 1;
	}

	tmp.clear();
	for (int i = 0; i < h*w; ++i)
		tmp.pb(i);

	cerr << add_or(tmp) << endl;

	l = j + 1, r = h*w - 1;
	int j1 = -1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		tmp.clear();
		for (int j = l; j <= mid; ++j)
			tmp.pb(j);
		if (add_or(tmp)) {
			j1 = mid;
			r = mid - 1;
		} else 
			l = mid + 1;
	}

	cerr << j << ' ' << j1 << endl;


	int xa = j / w, ya = j % w;
	int xb = j1 / w, yb = j1 % w;

	tmp.clear();
	tmp.pb(j);
	if (abs(xa - xb) + abs(ya - yb) != k)
		tmp.pb(j1);	

	add_xor(tmp);			
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 1628 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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