oj.uz

답안 #445216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445216 2021-07-16T22:26:58 Z flappybird 길고양이 (JOI20_stray) C++14
5 / 100
 66 ms 21396 KB 
#include "Anthony.h"
#include <vector>
using namespace std;
typedef int ll;
#define MAX 101010

namespace {
	vector<ll> adj[MAX], num[MAX], depth, deg;
	vector<ll> ret;
	ll asdf[6] = { 1, 1, 0, 1, 0, 0 };
	void dfs(ll x = 0, ll p = -1, ll d = 1, ll str = 0) {
		depth[x] = d;
		ll i;
		for (i = 0; i < (int)adj[x].size(); i++) {
			if (adj[x][i] == p) continue;
			if (deg[adj[x][i]] == 2) {
				while (d != asdf[str % 6]) str++;
				ret[num[x][i]] = asdf[str % 6];
				dfs(adj[x][i], x, !asdf[str % 6], str + 1);
			}
			else {
				ret[num[x][i]] = d;
				dfs(adj[x][i], x, !d);
			}
		}
	}
}  // namespace

std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
	ret.resize(M);
	deg.resize(N);
	ll i;
	for (i = 0; i < M; i++) adj[U[i]].push_back(V[i]);
	for (i = 0; i < M; i++) num[U[i]].push_back(i);
	for (i = 0; i < M; i++) adj[V[i]].push_back(U[i]);
	for (i = 0; i < M; i++) num[V[i]].push_back(i);
	for (i = 0; i < M; i++) deg[U[i]]++, deg[V[i]]++;
	depth.resize(N);
	dfs();
	return ret;
}

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;

namespace {

int A, B;
int variable_example = 0;
ll pv;
ll str;
ll last;
string up[6], down[6];

bool chk(string s) {
	for (ll i = 0; i < 6; i++) {
		if (s == up[i]) return true;
	}
	return false;
}

string s;

}  // namespace

void Init(int A, int B) {
	::A = A;
	::B = B;
	pv = -1;
	str = 0;
	last = 0;
	up[0] = "00101";
	up[1] = "01011";
	up[2] = "10110";
	up[3] = "01100";
	up[4] = "11001";
	up[5] = "10010";
}

int Move(std::vector<int> y) {
	if (pv != -1) {
		if ((y[0] + y[1] + 1) != 2) {
			str = 0;
			s.clear();
			last = 1;
			y[pv]++;
			if (y[0] == 1) {
				if (pv == 0) return -1;
				else return pv = 0;
			}
			else {
				if (pv == 1) return -1;
				else return pv = 1;
			}
		}
		else {
			if (!last) {
				str++;
				ll nxt;
				if (y[0]) nxt = 0;
				else nxt = 1;
				s.push_back(nxt + 48);
				if (str == 5) {
					if (chk(s)) {
						last = 1;
						str = 0;
						s.clear();
						return pv = nxt;
					}
					else {
						last = 1;
						str = 0;
						s.clear();
						return -1;
					}
				}
				else {
					return pv = nxt;
				}
			}
			else {
				if (y[0]) return pv = 0;
				else return pv = 1;
			}
		}
	}
	else {
		if ((y[0] + y[1]) != 2) {
			last = 1;
			if (y[0] == 1) return pv = 0;
			else return pv = 1;
		}
		else {
			if (y[0] == 2) {
				s.push_back('0');
				s.push_back('0');
				str += 2;
				return pv = 0;
			}
			else if (y[1] == 2) {
				s.push_back('1');
				s.push_back('1');
				str += 2;
				return pv = 1;
			}
			else {
				s.push_back('0');
				s.push_back('1');
				str += 2;
				return pv = 1;
			}
		}
	}
}

Compilation message

Catherine.cpp:9:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    9 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 18752 KB Output is correct
2 Correct 3 ms 5240 KB Output is correct
3 Correct 39 ms 17860 KB Output is correct
4 Correct 63 ms 21396 KB Output is correct
5 Incorrect 56 ms 21372 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 18752 KB Output is correct
2 Correct 3 ms 5240 KB Output is correct
3 Correct 39 ms 17860 KB Output is correct
4 Correct 63 ms 21396 KB Output is correct
5 Incorrect 56 ms 21372 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5624 KB Output is correct
2 Correct 3 ms 5232 KB Output is correct
3 Correct 4 ms 5620 KB Output is correct
4 Correct 5 ms 5584 KB Output is correct
5 Correct 4 ms 5620 KB Output is correct
6 Correct 5 ms 5620 KB Output is correct
7 Correct 4 ms 5620 KB Output is correct
8 Correct 4 ms 5572 KB Output is correct
9 Correct 5 ms 5624 KB Output is correct
10 Correct 4 ms 5632 KB Output is correct
11 Correct 4 ms 5620 KB Output is correct
12 Correct 4 ms 5620 KB Output is correct
13 Correct 4 ms 5568 KB Output is correct
14 Correct 4 ms 5628 KB Output is correct
15 Correct 4 ms 5620 KB Output is correct
16 Correct 4 ms 5620 KB Output is correct
17 Correct 4 ms 5620 KB Output is correct
18 Correct 4 ms 5580 KB Output is correct
19 Correct 4 ms 5620 KB Output is correct
20 Correct 4 ms 5620 KB Output is correct
21 Correct 4 ms 5620 KB Output is correct
22 Correct 4 ms 5620 KB Output is correct
23 Correct 4 ms 5628 KB Output is correct
24 Correct 5 ms 5704 KB Output is correct
25 Correct 4 ms 5620 KB Output is correct
26 Correct 5 ms 5628 KB Output is correct
27 Correct 4 ms 5620 KB Output is correct
28 Correct 4 ms 5632 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 16304 KB Output is correct
2 Correct 47 ms 17888 KB Output is correct
3 Correct 3 ms 5240 KB Output is correct
4 Correct 44 ms 16404 KB Output is correct
5 Correct 57 ms 19704 KB Output is correct
6 Correct 66 ms 19604 KB Output is correct
7 Incorrect 41 ms 18788 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 16136 KB Output is correct
2 Correct 47 ms 17764 KB Output is correct
3 Correct 3 ms 5240 KB Output is correct
4 Correct 38 ms 16432 KB Output is correct
5 Correct 61 ms 19656 KB Output is correct
6 Correct 56 ms 19708 KB Output is correct
7 Incorrect 43 ms 18772 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -