oj.uz

Submission #954952

# Submission time Handle Problem Language Result Execution time Memory
954952 2024-03-29T00:44:00 Z irmuun Stations (IOI20_stations) C++17
5 / 100
 593 ms 1192 KB 
#include<bits/stdc++.h>
#include "stations.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

vector<int>label(int n,int k,vector<int>u,vector<int>v){
    vector<int>l(n);
    vector<int>adj[n];
    for(int i=0;i<n-1;i++){
        adj[u[i]].pb(v[i]);
        adj[v[i]].pb(u[i]);
    }
    vector<int>ord;
    function <void(int,int)> dfs=[&](int x,int p){
        ord.pb(x);
        for(auto y:adj[x]){
            if(y!=p){
                dfs(y,x);
            }
        }
    };
    for(int i=0;i<n;i++){
        if(adj[i].size()==1){
            dfs(i,-1);
            break;
        }
    }
    for(int i=0;i<n;i++){
        l[ord[i]]=i;
    }
    return l;
}

int find_next_station(int s,int t,vector<int>c){
    if(t<s) return c[0];
    return c.back();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 780 KB Output is correct
2 Correct 266 ms 936 KB Output is correct
3 Correct 555 ms 684 KB Output is correct
4 Correct 384 ms 684 KB Output is correct
5 Correct 361 ms 684 KB Output is correct
6 Correct 308 ms 936 KB Output is correct
7 Correct 279 ms 684 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 1 ms 1180 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 269 ms 856 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 684 KB Output is correct
2 Correct 257 ms 1104 KB Output is correct
3 Correct 574 ms 940 KB Output is correct
4 Correct 439 ms 940 KB Output is correct
5 Correct 391 ms 684 KB Output is correct
6 Correct 277 ms 1108 KB Output is correct
7 Correct 309 ms 684 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 4 ms 772 KB Output is correct
10 Correct 1 ms 764 KB Output is correct
11 Incorrect 378 ms 684 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 592 ms 684 KB Output is correct
2 Correct 455 ms 684 KB Output is correct
3 Correct 377 ms 684 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 0 ms 764 KB Output is correct
7 Incorrect 397 ms 684 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 1116 KB Output is correct
2 Correct 286 ms 932 KB Output is correct
3 Correct 593 ms 684 KB Output is correct
4 Correct 395 ms 684 KB Output is correct
5 Correct 348 ms 684 KB Output is correct
6 Correct 311 ms 1192 KB Output is correct
7 Correct 284 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 0 ms 764 KB Output is correct
11 Incorrect 280 ms 856 KB Wrong query response.
12 Halted 0 ms 0 KB -