oj.uz

답안 #701770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701770 2023-02-22T05:24:49 Z Etherite Speedrun (RMI21_speedrun) C++17
0 / 100
 171 ms 804 KB 
#include <bits/stdc++.h>
#include "speedrun.h"

using namespace std;

void dfsHint(int curr, int par, vector<vector<int>> &adjHint, stack<int> &toAdd)
{
	for(int i = 9; i >= 0; i--) // set in big-endian
	{
		if(par & (1 << i)) setHint(curr, i + 1, 1);
		else setHint(curr, i + 1, 0);
	}

	for(int i = adjHint[curr].size() - 1; i >= 0; i--)
	{
		int next = adjHint[curr][i];
		if(next == par) continue;
		toAdd.push(next);
	}
	if(!toAdd.empty())
	{
		int second = toAdd.top();
		toAdd.pop();
		for(int i = 9; i >= 0; i--)
		{
			if(second & (1 << i)) setHint(curr, i + 11, 1);
			else setHint(curr, i + 11, 0);
		}
	}

	for(int next : adjHint[curr])
	{
		if(next == par) continue;
		dfsHint(next, curr, adjHint, toAdd);
	}
}

void assignHints(int subtask, int N, int A[], int B[]) 
{
	setHintLen(20);
	vector<vector<int>> adjHint(N + 1);
	for(int i = 1; i < N; i++)
	{
		adjHint[A[i]].push_back(B[i]);
		adjHint[B[i]].push_back(A[i]);
	}
	for(int i = 1; i <= N; i++) sort(adjHint[i].begin(), adjHint[i].end());
	stack<int> toAdd;
	dfsHint(1, 0, adjHint, toAdd);
}

int dfsSpeedrun(int curr, int par, vector<int> &vis)
{
	int child = 0;
	for(int i = 10; i < 20; i++) child += getHint(i + 1) * (1 << (i - 10));

	while(1)
	{
		bool canDescend = goTo(child);
		if(canDescend)
		{
			child = dfsSpeedrun(child, curr, vis);
		}
		else return child;
	}
}

void speedrun(int subtask, int N, int start) 
{
	if(N == 1) return;
	int l = getLength();
	
	int par = 0;
	for(int i = 0; i < 10; i++) par += getHint(i + 1) * (1 << i);

	vector<int> vis(N + 1);
	vis[start] = 1;
	dfsSpeedrun(start, par, vis);
}

Compilation message

speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:71:6: warning: unused variable 'l' [-Wunused-variable]
   71 |  int l = getLength();
      |      ^

Subtask #1
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 168 ms 720 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 143 ms 672 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 171 ms 784 KB Invalid node index to goTo
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 130 ms 804 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 169 ms 700 KB Solution didn't visit every node
2 Halted 0 ms 0 KB -