oj.uz

답안 #514023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514023 2022-01-18T02:25:57 Z 8e7 길고양이 (JOI20_stray) C++17
5 / 100
 46 ms 15684 KB 
#include "Anthony.h"
#include <vector>
#include <bits/stdc++.h>
#define maxn 20005
#define pii pair<int, int>
using namespace std;
namespace {
	vector<pii> adj[maxn];
	int res[maxn];
	int arr[6] = {0, 0, 1, 0, 1, 1};
	const int inf = 8e7;
	void dfs(int n, int par, int ind, int prv) {
		int deg = adj[n].size() - (par == -1 ? 0 : 1);
		if (deg == 1) {
			for (auto [v, id]:adj[n]) {
				if (v != par) {
					res[id] = arr[ind];
					dfs(v, n, (ind+1)%6, res[id]);
				}
			}
		} else {
			for (auto [v, id]:adj[n]) {
				if (v != par) {
					res[id] = prv ^ 1;
					dfs(v, n, res[id] ? 5 : 1, res[id]);
				}
			}
		}
	}	
}; 

vector<int> Mark(int N, int M, int A, int B,
                      vector<int> U, vector<int> V) {
	for (int i = 0;i < M;i++) adj[U[i]].push_back({V[i], i}), adj[V[i]].push_back({U[i], i});
	vector<int> X(M);
	dfs(0, -1, 0, 0);	
	for (int i = 0;i < M;i++) X[i] = res[i];
	return X;
}

#include "Catherine.h"
#include <vector>
#include "assert.h"
using namespace std;

namespace {
	int A, B;
	bool type = 0;
	int prv = 0, step = 0, mask = 0;
	int check[6] = {12, 25, 18, 5, 11, 22};
};  

void Init(int A, int B) {
  ::A = A;
  ::B = B;
}

int Move(vector<int> y) {	
	int sum = y[0] + y[1];
	sum += (step ? 1 : 0);	
	if (sum > 2) {
		step++;
		if (y[0] == 0 || y[1] == 0) {
			return -1;
		} 
		if (step > 1) y[prv]++;
		prv = y[0] == 1 ? 0 : 1;
		return prv;
	} else {
		if (step) sum--;
		step++;
		if (sum == 1) {
			if (type && step == 4) {
				mask = mask * 2 + (y[0] == 1 ? 0 : 1);
				bool match = 0;
				for (int i = 0;i < 6;i++) {
					if (mask == check[i]) match = 1;
				}	
				if (match) return -1;
			}
			prv = y[0] == 1 ? 0 : 1;
			if (step < 4) mask = mask * 2 + prv;
			return prv;
		} else {
			if (sum == 0) return -1;
			prv = y[0] ? 0 : 1;
			type = 1;
			mask = (1 - prv) * 2 + prv;
			return prv;	
		}
	}
}
/*
11 10 2 6 6
0 2
0 3
0 4
3 5
5 7
5 8
7 10
4 6
6 9
9 1
*/

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 15684 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 15684 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13336 KB Output is correct
2 Correct 1 ms 996 KB Output is correct
3 Correct 27 ms 12596 KB Output is correct
4 Correct 40 ms 15032 KB Output is correct
5 Incorrect 37 ms 15016 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13336 KB Output is correct
2 Correct 1 ms 996 KB Output is correct
3 Correct 27 ms 12596 KB Output is correct
4 Correct 40 ms 15032 KB Output is correct
5 Incorrect 37 ms 15016 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1268 KB Output is correct
2 Correct 1 ms 1008 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 2 ms 1264 KB Output is correct
5 Correct 2 ms 1260 KB Output is correct
6 Correct 2 ms 1268 KB Output is correct
7 Correct 2 ms 1268 KB Output is correct
8 Correct 2 ms 1256 KB Output is correct
9 Correct 2 ms 1260 KB Output is correct
10 Correct 2 ms 1268 KB Output is correct
11 Correct 2 ms 1268 KB Output is correct
12 Correct 2 ms 1268 KB Output is correct
13 Correct 2 ms 1272 KB Output is correct
14 Correct 2 ms 1268 KB Output is correct
15 Correct 2 ms 1268 KB Output is correct
16 Correct 2 ms 1256 KB Output is correct
17 Correct 2 ms 1268 KB Output is correct
18 Correct 2 ms 1268 KB Output is correct
19 Correct 2 ms 1264 KB Output is correct
20 Correct 2 ms 1260 KB Output is correct
21 Correct 2 ms 1252 KB Output is correct
22 Correct 2 ms 1260 KB Output is correct
23 Correct 1 ms 1268 KB Output is correct
24 Correct 2 ms 1260 KB Output is correct
25 Correct 1 ms 1268 KB Output is correct
26 Correct 2 ms 1272 KB Output is correct
27 Correct 2 ms 1268 KB Output is correct
28 Correct 2 ms 1256 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 10996 KB Output is correct
2 Correct 36 ms 12056 KB Output is correct
3 Correct 1 ms 1000 KB Output is correct
4 Correct 25 ms 11120 KB Output is correct
5 Correct 41 ms 13448 KB Output is correct
6 Correct 43 ms 13384 KB Output is correct
7 Correct 34 ms 12576 KB Output is correct
8 Correct 31 ms 12692 KB Output is correct
9 Correct 39 ms 13544 KB Output is correct
10 Correct 38 ms 13588 KB Output is correct
11 Correct 39 ms 13592 KB Output is correct
12 Correct 36 ms 13576 KB Output is correct
13 Correct 37 ms 13428 KB Output is correct
14 Correct 43 ms 13412 KB Output is correct
15 Correct 46 ms 13512 KB Output is correct
16 Correct 40 ms 13520 KB Output is correct
17 Incorrect 32 ms 13224 KB Wrong Answer [6]
18 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 10956 KB Output is correct
2 Correct 38 ms 11864 KB Output is correct
3 Correct 0 ms 1000 KB Output is correct
4 Correct 26 ms 11056 KB Output is correct
5 Correct 38 ms 13532 KB Output is correct
6 Correct 41 ms 13460 KB Output is correct
7 Incorrect 30 ms 12572 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -