Submission #536991

#	Time	Username	Problem	Language	Result	Execution time	Memory
536991		zaneyu	Speedrun (RMI21_speedrun)	C++14	100 / 100	196 ms	936 KiB

speedrun

#include "speedrun.h"
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define MNTO(x,y) x=min(x,y)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ll long long
#define ld long double
#define sz(x) (int)x.size()
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define unq(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const int maxn=2e3+5;
using namespace std;
vector<int> v[maxn];
vector<int> vv;
void dfs(int u,int p){
	REP(j,10) setHint(u,j+1,(p&(1<<j))>>j);
	if(u>1){
		v[u].erase(find(ALL(v[u]),p));
	}
	vv.pb(u);
	REP(j,sz(v[u])){
		int x=v[u][j];
		int nxt=u;
		dfs(x,u);
	}
}
void assignHints(int subtask, int n, int A[], int B[]) {
	setHintLen(20);
	REP1(i,n-1){
		v[A[i]].pb(B[i]);
		v[B[i]].pb(A[i]);
	}
	dfs(1,1023);
	REP(i,n-1){
		REP(j,10) setHint(vv[i],j+11,(vv[i+1]&(1<<j))>>j);
	}
}
void speedrun(int subtask, int n, int start) {
	while(start!=1){
		int p=0;
		REP(j,10) p=(p<<1)+getHint(10-j);
		goTo(p);
		start=p;
	}
	REP(i,n-1){
		int nxt=0;
		REP(j,10) nxt=(nxt<<1)+getHint(20-j);
		while(!goTo(nxt)){
			int p=0;
			REP(j,10) p=(p<<1)+getHint(10-j);
			goTo(p);
		}
	}
}

Compilation message (stderr)

speedrun.cpp: In function 'void dfs(int, int)':
speedrun.cpp:24:7: warning: unused variable 'nxt' [-Wunused-variable]
   24 |   int nxt=u;
      |       ^~~

• Subtask 1: 21 / 21
• Subtask 2: 8 / 8
• Subtask 3: 19 / 19
• Subtask 4: 12 / 12
• Subtask 5: 40 / 40