#include <iostream>
#include <vector>
using namespace std;
const int N1 = 1005;
vector<int> nei[N1];
int d[N1], num[N1];
bool seen[N1];
void dfs1(int u, int p = -1, int cur = 0){
num[u] = cur;
for (int i : nei[u])
if (i != p)
dfs1(i, u, cur+1);
}
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 (t){
for (int i=0;i<n;i++)
lab[i] = i+1;
return lab;
}
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;
}
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){
int cur;
for (int i=0;i<n;i++)
if (d[i] == 1)
cur = i;
dfs1(cur);
for (int i=0;i<n;i++)
lab[i] = num[i];
return lab;
}
return lab;
}
int ver;
bool dfs(int u, int s, int t, int p = -1){
if (u == t)
return 1;
seen[u] = 1;
for (int i : nei[u]){
if (seen[i])
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(), seen[i] = 0;
// if (lab[0] > 1e8){
// for (int i=0;i<n;i++)
// if (lab[i] == s){
// s = i;
// break;
// }
// for (int i=0;i<n;i++)
// if (lab[i] == t){
// t = i;
// break;
// }
// 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;
// ver = -1;
// bool b = dfs(s, s, t);
// if (ver == -1)
// return lab[0];
// return lab[ver];
// }
bool tt = true, t2 = true;
for (int i=0;i<n;i++){
tt &= lab[i] == i+1;
if (lab[i] > n)
t2 = false;
}
// if (tt and lab[0] == 1){
// if (s < t){
// for (int i=1;i<=30;i++)
// if ((t>>i) == s)
// return (t >> (i-1));
// return s / 2;
// }
// else{
// return s / 2;
// }
// }
if (t2){
if (s > t)
return s - 1;
return s + 1;
}
}
Compilation message
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:139:1: warning: control reaches end of non-void function [-Wreturn-type]
139 | }
| ^
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:56:7: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
56 | dfs1(cur);
| ~~~~^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
600 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
276 ms |
944 KB |
Wrong query response. |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
600 KB |
Invalid labels (duplicates values). scenario=1, label=0 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
570 ms |
684 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
Invalid labels (duplicates values). scenario=2, label=1 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
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 |
- |
