oj.uz

Submission #1080045

# Submission time Handle Problem Language Result Execution time Memory
1080045 2024-08-29T06:34:35 Z Jawad_Akbar_JJ Stations (IOI20_stations) C++17
0 / 100
 2 ms 940 KB 
#include <iostream>
#include <vector>

using namespace std;
const int N1 = 1005;
vector<int> nei[N1];
int d[N1];

vector<int> label(int n, int k, vector<int> u, vector<int> v){
	bool t = 1;
	for (int i=0;i<n-1;i++){
		nei[u[i]].push_back(v[i]);
		nei[v[i]].push_back(u[i]);
		d[u[i]]++;
		d[v[i]]++;
		t &= min(u[i], v[i]) == i / 2;
		t &= max(u[i], v[i]) == i+1;
	}
	vector<int> lab(n, 0);
	if (k == 1e9){
		for (int i=0;i<n-1;i++){
			lab[u[i]] += (1<<v[i]);
			lab[v[i]] += (1<<u[i]);
		}
		lab[0] += 1e8;
		return lab;
	}
	// if (t){
	// 	for (int i=0;i<n;i++)
	// 		lab[i] = i+1;
	// 	return lab;
	// }

	// int mx = 0, mn = 0;
	// for (int i=0;i<n;i++){
	// 	if (d[i] > d[mx])
	// 		mx = i;
	// 	if (d[i] < d[mn])
	// 		mn = i;
	// }

	// if (d[mx] <= 2){
	// }

	return lab;

}

int ver;

bool dfs(int u, int s, int t, int p = -1){
	if (u == t)
		return 1;
	for (int i : nei[u]){
		if (i == p)
			continue;
		bool b = dfs(i, s, t, u);
		if (b and u == s)
			ver = i;
		if (b)
			return 1;
	}
	return 0;
}

int find_next_station(int s, int t, vector<int> lab){
	int n = lab.size();

	for (int i=0;i<n;i++)
		nei[i].clear();

	if (lab[0] > 1e8){
		lab[0] -= 1e8;
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++)
				if ((1<<j) & lab[i])
					nei[i].push_back(j);
		}
		lab[0] += 1e8;
		dfs(s, s, t);
		return lab[ver];
	}
	
	// bool tt = true;
	// for (int i=0;i<n;i++)
	// 	tt &= lab[i] == i+1;

	// if (tt){
	// 	if (lab[s] < lab[t]){
	// 		for (int i=1;i<=30;i++)
	// 			if ((lab[t]>>i) == lab[s])
	// 				return lab[s] * 2 + ((lab[t] & (1<<(i-1))) == 0);
	// 		return lab[s] / 2;
	// 	}
	// 	else{
	// 		return lab[s] / 2;
	// 	}
	// }
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:99:1: warning: control reaches end of non-void function [-Wreturn-type]
   99 | }
      | ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 852 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Invalid labels (duplicates values). scenario=0, label=0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Invalid labels (values out of range). scenario=1, k=1000000000, vertex=1, label=-2147483644
2 Halted 0 ms 0 KB -