oj.uz

답안 #1040286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040286 2024-07-31T23:10:28 Z Edu175 Speedrun (RMI21_speedrun) C++17
33 / 100
 157 ms 1340 KB 
#include "speedrun.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,mxcont=b;i<mxcont;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto jfhg:v)cout<<jfhg<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;

void sethint(ll i, ll j, ll b){
	setHint(i+1,j+1,b);
}
bool gethint(ll j){
	return getHint(j+1);
}
bool go(ll x){
	return goTo(x+1);
}
const ll C=31;
void assignHints(int subtask, int n, int U[], int V[]) { /* your solution here */
	vector<ll> g[n];
	fore(i,1,n){
		U[i]--,V[i]--;
		g[U[i]].pb(V[i]);
		g[V[i]].pb(U[i]);
	}
	fore(i,0,n)sort(ALL(g[i]));
	/*fore(i,0,n){
		cout<<i<<": ";
		imp(g[i]);
	}*/
	setHintLen(316);
	fore(i,0,n){
		g[i].pb(1023);
		fore(j,0,min(C,(ll)SZ(g[i]))){
			fore(k,0,10)sethint(i,j*10+k,g[i][j]>>k&1);
		}
		sethint(i,315,(SZ(g[i])>C));
	}
}

void speedrun(int subtask, int n, int s) { /* your solution here */
	vector<ll>vis(n); s--;
	auto getset=[&](ll x){
		vector<ll>ret;
		fore(i,0,C){
			ll mk=0;
			fore(j,0,10)mk|=ll(gethint(i*10+j))<<j;
			if(mk==1023)break;
			ret.pb(mk);
		}
		if(gethint(315))fore(y,ret.back()+1,n)ret.pb(y);
		
		
		// cout<<"getset "<<x<<": "; imp(ret);
		return ret;
	};
	auto dfs=[&](ll x, auto &&dfs)->void{
		// if(!goTo(x))return 0;
		vis[x]=1;
		// cout<<"dfs "<<x<<"\n";
		for(auto y:getset(x))if(!vis[y]){
			if(go(y)){
				dfs(y,dfs);
				go(x);
			}
		}
	};
	dfs(s,dfs);
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 688 KB Output is correct
2 Correct 127 ms 1196 KB Output is correct
3 Correct 157 ms 1144 KB Output is correct
4 Correct 150 ms 864 KB Output is correct

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 936 KB Output is correct
2 Correct 152 ms 740 KB Output is correct
3 Correct 149 ms 1112 KB Output is correct
4 Correct 127 ms 1340 KB Output is correct
5 Correct 155 ms 1300 KB Output is correct
6 Correct 94 ms 688 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB The length is too large
2 Halted 0 ms 0 KB -