oj.uz

Submission #306099

# Submission time Handle Problem Language Result Execution time Memory
306099 2020-09-24T13:58:43 Z SorahISA Stations (IOI20_stations) C++17
5 / 100
 1148 ms 1048 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

const int maxn = 1000 + 5;

int lstvis = 0;
vector<int> adj[maxn], lab;

void dfs(int now, int lst) {
    // cout << lab[now] << " ";
    for (auto x : adj[now]) {
        if (x != lst) lab[x] = lab[now] + 1, lstvis = x, dfs(x, now);
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    for (int i = 0; i < maxn; ++i) adj[i].clear();
    lab.resize(n);
    
    for (int i = 0; i < n-1; ++i) {
        adj[u[i]].eb(v[i]), adj[v[i]].eb(u[i]);
    }
    dfs(0, -1), lab[lstvis] = 0, dfs(lstvis, -1);
    
	return lab;
}

int find_next_station(int s, int t, vector<int> c) {
    return s > t ? c.front() : c.back();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 772 KB Output is correct
2 Correct 489 ms 768 KB Output is correct
3 Correct 873 ms 768 KB Output is correct
4 Correct 634 ms 876 KB Output is correct
5 Correct 580 ms 768 KB Output is correct
6 Correct 451 ms 768 KB Output is correct
7 Correct 463 ms 768 KB Output is correct
8 Correct 2 ms 876 KB Output is correct
9 Correct 4 ms 884 KB Output is correct
10 Correct 2 ms 768 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 526 ms 1024 KB Output is correct
2 Correct 468 ms 1024 KB Output is correct
3 Correct 860 ms 1032 KB Output is correct
4 Correct 669 ms 876 KB Output is correct
5 Correct 635 ms 1048 KB Output is correct
6 Correct 454 ms 768 KB Output is correct
7 Correct 549 ms 768 KB Output is correct
8 Correct 4 ms 880 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Incorrect 1 ms 384 KB Invalid labels (duplicates values). scenario=1, label=2
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1148 ms 768 KB Output is correct
2 Correct 676 ms 1008 KB Output is correct
3 Correct 765 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Incorrect 1 ms 388 KB Invalid labels (duplicates values). scenario=0, label=2
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 1024 KB Output is correct
2 Correct 651 ms 1024 KB Output is correct
3 Correct 1073 ms 768 KB Output is correct
4 Correct 687 ms 768 KB Output is correct
5 Correct 622 ms 768 KB Output is correct
6 Correct 505 ms 768 KB Output is correct
7 Correct 453 ms 768 KB Output is correct
8 Correct 3 ms 876 KB Output is correct
9 Correct 5 ms 876 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Incorrect 5 ms 384 KB Invalid labels (duplicates values). scenario=0, label=10
12 Halted 0 ms 0 KB -