| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311336 | mo_aladaili | 기지국 (IOI20_stations) | C++20 | 388 ms | 492 KiB |
#include "bits/stdc++.h"
using namespace std;
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
vector<vector<int>> adj(n);
for (int i = 0; i < n - 1; i++)
{
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int root = 0;
for (int i = 0; i < n; i++)
{
if (adj[i].size() > 2)
{
root = i;
break;
}
}
vector<int> lab(n, -1);
lab[root] = 0;
int nxt = 1;
for (int nei : adj[root])
{
lab[nei] = nxt++;
}
for (int st : adj[root])
{
int base = lab[st];
queue<pair<int, int>> q;
q.push({st, 1});
while (!q.empty())
{
auto [node, dist] = q.front();
q.pop();
for (int child : adj[node])
{
if (lab[child] != -1)
continue;
lab[child] = dist * 1000 + base;
q.push({child, dist + 1});
}
}
}
return lab;
}
int find_next_station(int s, int t, vector<int> c)
{
if (s == 0)
{
for (int x : c)
{
if (x == t % 1000)
return x;
}
}
for (int x : c)
{
if (x <= t && (x == 0 || (x % 1000 == t % 1000)))
{
return x;
}
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
