oj.uz

Submission #923341

# Submission time Handle Problem Language Result Execution time Memory
923341 2024-02-07T06:43:09 Z shoryu386 Speedrun (RMI21_speedrun) C++17
60 / 100
 3500 ms 5256 KB 
#include "speedrun.h"
#include <bits/stdc++.h>
using namespace std;


bool vis[1007];
int parset[1007];
vector<int> adj[1007];
vector<int> dorder[1007];
int n;
void dfs(int x, int p, int d){
	vis[x] = 1;
	parset[x] = p;
	dorder[d].push_back(x);
	for (auto y : adj[x]){
		if (!vis[y]){
			dfs(y, x, d+1);
		}
	}
}

void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
	
	setHintLen(20);
	
	for (int x = 1; x < N; x++){
		adj[A[x]].push_back(B[x]);
		adj[B[x]].push_back(A[x]);
	}
	
	//let root be 1 always
	dfs(1, 0, 0);
	
	vector<int> inorder;
	for (int x = 0; x <= N; x++){
		for (auto y : dorder[x]){
			inorder.push_back(y);
		}
	}
	
	//data 1 is par
	//data 2 is next
	
	int next[N+1];
	for (int x = 0; x < N-1; x++){
		next[ inorder[x] ] = inorder[x+1];
	}
	next[inorder[N-1]] = inorder[0];
	
	//encryption
	for (int x = 1; x <= N; x++){
		for (int z = 0; z <= 9; z++){
			if (parset[x] & (1<<z)){
				setHint(x, z+1, 1);
			}
		}
		
		for (int z = 0; z <= 9; z++){
			if (next[x] & (1<<z)){
				setHint(x, z+11, 1);
			}
		}
	}
	
	return;
}

int par[1007];
int nextt[1007];
int cur;

void setDetails(){
	par[cur] = 0; nextt[cur] = 0;
	
	for (int z = 0; z <= 9; z++){
		if (getHint(z+1)){
			par[cur] += (1<<z);
		}
	}
	for (int z = 0; z <= 9; z++){
		if (getHint(z+11)){
			nextt[cur] += (1<<z);
		}
	}
}

void assertGoTo(int x){
	assert(goTo(x));
}

void returnToRoot(){
	setDetails();
	if (cur == 1){
		return;
	}
	assertGoTo(par[cur]);
	
	cur = par[cur];
	returnToRoot();
}

vector<int> moves[1007];
void trace(int x){
	returnToRoot();
	
	for (auto z : moves[x]){
		assertGoTo(z);
		cur = z;
	}
	return;
}

void speedrun(int subtask, int N, int start) { /* your solution here */
	cur = start;
	
	returnToRoot();
	vector<int> inorder;
	inorder.push_back(1);
	
	int ptr = 0;
	int nodeCount = 1;
	
	while (nodeCount < N){
		int nextnode = nextt[inorder.back()];
		
		if (nextnode == 0) break;
		
		cerr << nextnode << ' ' << ptr << ' ' << inorder[ptr] << '\n';
		
		trace(inorder[ptr]);
		if (goTo(nextnode)){
			nodeCount++;
			inorder.push_back(nextnode);
			
			cur = nextnode;
			
			moves[cur] = moves[inorder[ptr]];
			moves[cur].push_back(cur);
			cerr << "To reach " << cur << ": ";
			for (int z : moves[cur]) cerr << z << ' ';
			cerr << '\n';
			
			setDetails();
		}
		else{
			ptr++;
		}
	}
	
}

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 2056 KB Output is correct
2 Execution timed out 3530 ms 5256 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 1928 KB Output is correct
2 Correct 70 ms 2436 KB Output is correct

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3538 ms 4476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 2788 KB Output is correct
2 Correct 315 ms 2032 KB Output is correct
3 Correct 126 ms 2436 KB Output is correct
4 Correct 3083 ms 3756 KB Output is correct
5 Correct 456 ms 2944 KB Output is correct
6 Correct 81 ms 2168 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 3096 KB Output is correct
2 Correct 296 ms 2316 KB Output is correct
3 Correct 134 ms 2220 KB Output is correct
4 Correct 2660 ms 3912 KB Output is correct
5 Correct 137 ms 2436 KB Output is correct
6 Correct 496 ms 2440 KB Output is correct
7 Correct 74 ms 2176 KB Output is correct