oj.uz

Submission #764847

# Submission time Handle Problem Language Result Execution time Memory
764847 2023-06-24T05:40:58 Z vjudge1 Speedrun (RMI21_speedrun) C++17
0 / 100
 1 ms 592 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
const int MAXN=1e3+5;
vector<vector<int> > g(MAXN);
void setHintLen(int l);
void setHint(int i, int j, bool b);
int getLength();
bool getHint(int j);
bool goTo(int x);
void assignHints(int subtask, int N, int A[], int B[]) {
	for(int i=1; i<=N; i++) {
		g[A[i]].push_back(B[i]);
		g[B[i]].push_back(A[i]);
	}
	if(subtask==3) {
		for(int i=1; i<=N; i++)g[i].clear();
		setHintLen(20);
		vector<int> us(N+1, 0), pr(N+1, 0);
		queue<int> q;
		q.push(1);
		us[1]=1;
		while(!q.empty()) {
			int v=q.front();
			q.pop();
			for(int j=1; j<=10; j++) {
				setHint(v, j, (pr[v] & (1<<(j-1) ) ? 1 : 0) );
			}
			int cnt=0;
			for(auto to : g[v]) {
				if(!us[to]) {
					pr[to]=v;
					q.push(to);
					cnt++;
					if(cnt==2) {
						for(int j=11; j<=20; j++) {
							setHint(v, j, (to&(1<<(j-11)) ? 1 : 0));
						}
					}else {
						for(int j=1; j<=10; j++) {
							setHint(v, j, (to & (1<<(j-1) ) ? 1 : 0) );
						}
					}
					us[to]=1;
				}
			}
		}
	}
}
int Us[MAXN];
void dfs(int v, int p) {
	Us[v]=1;
	int x=0, y=0;
	for(int j=1; j<=10; j++) {
		if(getHint(j))x+=(1<<(j-1));
	}
	for(int j=11; j<=20; j++) {
		if(getHint(j))y+=(1<<(j-11));
	}
	if(x>0 && !Us[x]) {
		bool ok=goTo(x);
		if(ok)dfs(x, v);
		else {
			cout << "ne\n";
			exit(0);
		}
	}
	if(y>0 && !Us[y]) {
		bool ok=goTo(y);
		if(ok)dfs(y, v);
		else {
			cout << "ne\n";
			exit(0);
		}
	}
	if(p!=v)goTo(p);
}
void speedrun(int subtask, int N, int start) {
	if(subtask==3) {
		for(int i=1; i<=N; i++)Us[i]=0;
		int l=getLength();
		dfs(start, start);
	}
}

Compilation message

speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:82:7: warning: unused variable 'l' [-Wunused-variable]
   82 |   int l=getLength();
      |       ^

Subtask #1
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -