oj.uz

답안 #38645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38645 2018-01-05T10:05:09 Z 14kg 게임 (IOI14_game) C++11
0 / 100
 0 ms 19580 KB 
#include "game.h"
#include <vector>
#include <queue>
#define N 1501

using namespace std;
int n, r[N][N], r_cnt[N];
int d[N];
vector<int> link[N];
queue<int> Q;

int d1_len, d1[N], d2_len, d2[N];

void initialize(int _n) {
	n = _n;
	for (int i = 1; i < n; i++) {
		r[i][i + 1] = r[i + 1][i] = 1;
		link[i].push_back(i + 1), link[i + 1].push_back(i);
		r_cnt[i]++, r_cnt[i + 1]++;
	}
}

int hasEdge(int x, int y) {
	int lev, empty_num1 = 0, empty_num2 = 0;

	x++, y++;
	if (r[x][y] == 0) {
		r[x][y] = r[y][x] = -2;
		r_cnt[x]++, r_cnt[y]++;
		return 0;
	}
	if (r[x][y] != 1) return r[x][y] > 0 ? 1 : 0;

	for (int i = 1; i <= n; i++) d[i] = 2;
	
	d[x] = 1, Q.push(x);
	while (!Q.empty()) {
		lev = Q.front(), Q.pop();

		for (auto i : link[lev])
			if (d[i] == 2 && i != y && (r[lev][i] == 1 || r[lev][i] == 2))
				d[i] = 1, Q.push(i);
	}

	// !!!
	d1_len = d2_len = 0;
	for (int i = 1; i <= n; i++)
		if (d[i] == 1) d1[++d1_len] = i;
		else d2[++d2_len] = i;

	for(int i=1; i<=d1_len && empty_num1==0; i++)
		if (r_cnt[d1[i]] < n - 1) {
			for (int j = 1; j <= d2_len && empty_num1==0; j++)
				if (r_cnt[d2[j]] < n - 1 && (d1[i] == x && d2[j] == y) == false && r[d1[i]][d2[j]] != -2) {
					empty_num1 = d1[i], empty_num2 = d2[j];
				}
		}

//	for (int i = 1; i <= n && (empty_num1 == 0 || empty_num2 == 0); i++)
//		if (d[i] == 1 && r_cnt[i] < n - 1 && (i == x && empty_num2 == y) == false && r[i][empty_num2] != -2) empty_num1 = i;
//		else if (d[i] == 2 && r_cnt[i] < n - 1 && (empty_num1 == x && i == y)==false && r[empty_num1][i] != -2) empty_num2 = i;

	if (empty_num1 && empty_num2) {
		int tx = empty_num1, ty = empty_num2;

		r[x][y] = r[y][x] = -2;
		r[tx][ty] = r[ty][tx] = 1;
		r_cnt[tx]++, r_cnt[ty]++;
		return 0;
	}
	else {
		r[x][y] = r[y][x] = 2;
		return 1;
	}
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 19580 KB Output is correct
2 Correct 0 ms 19580 KB Output is correct
3 Correct 0 ms 19580 KB Output is correct
4 Correct 0 ms 19580 KB Output is correct
5 Correct 0 ms 19580 KB Output is correct
6 Correct 0 ms 19580 KB Output is correct
7 Correct 0 ms 19580 KB Output is correct
8 Correct 0 ms 19580 KB Output is correct
9 Correct 0 ms 19580 KB Output is correct
10 Correct 0 ms 19580 KB Output is correct
11 Correct 0 ms 19580 KB Output is correct
12 Correct 0 ms 19580 KB Output is correct
13 Correct 0 ms 19580 KB Output is correct
14 Correct 0 ms 19580 KB Output is correct
15 Correct 0 ms 19580 KB Output is correct
16 Incorrect 0 ms 19580 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 19580 KB Output is correct
2 Correct 0 ms 19580 KB Output is correct
3 Correct 0 ms 19580 KB Output is correct
4 Correct 0 ms 19580 KB Output is correct
5 Correct 0 ms 19580 KB Output is correct
6 Correct 0 ms 19580 KB Output is correct
7 Correct 0 ms 19580 KB Output is correct
8 Correct 0 ms 19580 KB Output is correct
9 Correct 0 ms 19580 KB Output is correct
10 Correct 0 ms 19580 KB Output is correct
11 Correct 0 ms 19580 KB Output is correct
12 Correct 0 ms 19580 KB Output is correct
13 Correct 0 ms 19580 KB Output is correct
14 Correct 0 ms 19580 KB Output is correct
15 Correct 0 ms 19580 KB Output is correct
16 Incorrect 0 ms 19580 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 19580 KB Output is correct
2 Correct 0 ms 19580 KB Output is correct
3 Correct 0 ms 19580 KB Output is correct
4 Correct 0 ms 19580 KB Output is correct
5 Correct 0 ms 19580 KB Output is correct
6 Correct 0 ms 19580 KB Output is correct
7 Correct 0 ms 19580 KB Output is correct
8 Correct 0 ms 19580 KB Output is correct
9 Correct 0 ms 19580 KB Output is correct
10 Correct 0 ms 19580 KB Output is correct
11 Correct 0 ms 19580 KB Output is correct
12 Correct 0 ms 19580 KB Output is correct
13 Correct 0 ms 19580 KB Output is correct
14 Correct 0 ms 19580 KB Output is correct
15 Correct 0 ms 19580 KB Output is correct
16 Incorrect 0 ms 19580 KB Output isn't correct
17 Halted 0 ms 0 KB -