oj.uz

답안 #1040280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040280 2024-07-31T23:00:31 Z vjudge1 Speedrun (RMI21_speedrun) C++17
19 / 100
 92 ms 944 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);
}
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){
		cout<<i<<": ";
		imp(g[i]);
	}*/
	ll L=20;
	setHintLen(L);
	fore(i,0,n){
		if(SZ(g[i]))fore(j,0,10)sethint(i,j,g[i][0]>>j&1);
		if(SZ(g[i])>1)fore(j,0,10)sethint(i,j+10,g[i][1]>>j&1);
	}
}

void speedrun(int subtask, int n, int s) { /* your solution here */
	vector<ll>vis(n); s--;
	ll L=20;
	auto getset=[&](ll x){
		vector<ll>ret;
		ll mk=0;
		fore(i,0,10)mk|=ll(gethint(i))<<i;
		ret.pb(mk);
		mk=0;
		fore(i,0,10)mk|=ll(gethint(i+10))<<i;
		ret.pb(mk);
		// 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);
}

Compilation message

speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:44:5: warning: unused variable 'L' [-Wunused-variable]
   44 |  ll L=20;
      |     ^

Subtask #1
0.0 / 21.0

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

Subtask #2
0.0 / 8.0

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

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 944 KB Output is correct
2 Correct 92 ms 688 KB Output is correct
3 Correct 90 ms 940 KB Output is correct

Subtask #4
0.0 / 12.0

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

Subtask #5
0.0 / 40.0

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