oj.uz

Submission #923413

# Submission time Handle Problem Language Result Execution time Memory
923413 2024-02-07T07:45:18 Z shoryu386 Speedrun (RMI21_speedrun) C++17
60 / 100
 3500 ms 4112 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;

#define WEIRD -23145

int nn;
inline void setDetails(){
	if (nextt[cur] != WEIRD) return;
	
	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);
		}
	}
}

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

inline void returnToRoot(){
	setDetails();
	
	int steps = 0;
	while (cur != 1){
		assertGoTo(par[cur]);
		cur = par[cur];
		setDetails();
		
		assert(cur >= 1 && cur <= nn);
	}
}

vector<int> moves[1007];
inline 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;
	nn = N;
	
	for (int x = 0; x < 1007; x++) par[x] = WEIRD;
	for (int x = 0; x < 1007; x++) nextt[x] = WEIRD;
	
	returnToRoot();
	vector<int> inorder;
	inorder.push_back(1);
	
	int ptr = 0;
	int nodeCount = 1;
	
	for (int z = 0; z < N-1; z++){
		int nextnode = nextt[inorder.back()];
		if (nextnode == 0) break;
		
		trace(inorder[ptr]);
		while (!goTo(nextnode)){
			ptr++;
			trace(inorder[ptr]);
			assert(ptr < inorder.size());
		}
		
		nodeCount++;
		inorder.push_back(nextnode);
		
		cur = nextnode;
		
		moves[cur] = moves[inorder[ptr]];
		moves[cur].push_back(cur);
		
		setDetails();
	}
	
	
}

Compilation message

speedrun.cpp: In function 'void returnToRoot()':
speedrun.cpp:102:6: warning: unused variable 'steps' [-Wunused-variable]
  102 |  int steps = 0;
      |      ^~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from speedrun.cpp:4:
speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:145:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |    assert(ptr < inorder.size());
      |           ~~~~^~~~~~~~~~~~~~~~

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 1920 KB Output is correct
2 Execution timed out 3513 ms 4112 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1900 KB Output is correct
2 Correct 56 ms 1936 KB Output is correct

Subtask #3
0.0 / 19.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 764 ms 2832 KB Output is correct
2 Correct 256 ms 1984 KB Output is correct
3 Correct 99 ms 2200 KB Output is correct
4 Correct 3121 ms 3604 KB Output is correct
5 Correct 554 ms 2560 KB Output is correct
6 Correct 64 ms 1920 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 2272 KB Output is correct
2 Correct 287 ms 2244 KB Output is correct
3 Correct 104 ms 2184 KB Output is correct
4 Correct 2815 ms 3224 KB Output is correct
5 Correct 127 ms 1660 KB Output is correct
6 Correct 644 ms 2812 KB Output is correct
7 Correct 55 ms 2200 KB Output is correct