oj.uz

Submission #768116

# Submission time Handle Problem Language Result Execution time Memory
768116 2023-06-27T13:23:57 Z 3RR0R404 Stations (IOI20_stations) C++14
0 / 100
 670 ms 14032 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> child(1000,0);
int l=0;
set<int> visited;
vector<int> L;
int dfs(int node,int d,vector<vector<int>> adj)
{
    visited.insert(node);
    L[node] = l;
    l++;
    for(auto p: adj[node])
    {
        if(visited.find(p)!=visited.end())
        {
            continue;
        }
        child[d] += dfs(p,l,adj);
    }
    return child[d]+1;
}
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]);
    }
    L.resize(n,0);

    dfs(0,0,adj);
    return L;
}
int find_next_station(int s, int t, vector<int> c)
{
    sort(c.begin(),c.end());
    if(s+child[s]<t)
    {
        return c[0];
    }
    if(s>t)
    {
        return c[0];
    }
    return *(upper_bound(c.begin(),c.end(),t)-1);
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 670 ms 496 KB Output is correct
2 Incorrect 574 ms 420 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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