oj.uz

Submission #954958

# Submission time Handle Problem Language Result Execution time Memory
954958 2024-03-29T01:17:50 Z irmuun Stations (IOI20_stations) C++17
16 / 100
 652 ms 1604 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]);
    }
    int mx=0,root=0;
    for(int i=0;i<n;i++){
        if((int)adj[i].size()>mx){
            mx=(int)adj[i].size();
            root=i;
        }
    }
    int cur=0,g=0;
    function <void(int,int)> dfs=[&](int x,int p){
        l[x]=g*1000+cur;
        cur++;
        for(auto y:adj[x]){
            if(y!=p){
                dfs(y,x);
            }
        }
    };
    for(auto j:adj[root]){
        g++;
        cur=0;
        dfs(j,root);
    }
    return l;
}

int find_next_station(int s,int t,vector<int>c){
    if(s==0){
        int ans=c[0];
        for(int i:c){
            if(i/1000==t/1000){
                ans=i;
                break;
            }
        }
        return ans;
    }
    int g1=s/1000,g2=t/1000;
    if(g1!=g2){
        return c[0];
    }
    if(t<s) return c[0];
    return c.back();
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 572 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=2004
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 512 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=2, label=1001
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 928 KB Output is correct
2 Correct 292 ms 924 KB Output is correct
3 Correct 612 ms 692 KB Output is correct
4 Correct 451 ms 944 KB Output is correct
5 Correct 420 ms 684 KB Output is correct
6 Correct 310 ms 924 KB Output is correct
7 Correct 287 ms 936 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 768 KB Output is correct
11 Correct 396 ms 684 KB Output is correct
12 Correct 306 ms 1000 KB Output is correct
13 Correct 293 ms 1604 KB Output is correct
14 Correct 283 ms 852 KB Output is correct
15 Correct 31 ms 740 KB Output is correct
16 Correct 45 ms 824 KB Output is correct
17 Correct 57 ms 860 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 580 ms 684 KB Output is correct
2 Correct 439 ms 684 KB Output is correct
3 Correct 398 ms 684 KB Output is correct
4 Correct 1 ms 764 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 403 ms 688 KB Output is correct
8 Correct 652 ms 684 KB Output is correct
9 Correct 436 ms 684 KB Output is correct
10 Correct 387 ms 684 KB Output is correct
11 Incorrect 3 ms 764 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Partially correct 341 ms 936 KB Partially correct
2 Partially correct 284 ms 1168 KB Partially correct
3 Correct 599 ms 684 KB Output is correct
4 Partially correct 435 ms 684 KB Partially correct
5 Partially correct 386 ms 684 KB Partially correct
6 Partially correct 316 ms 924 KB Partially correct
7 Partially correct 307 ms 684 KB Partially correct
8 Partially correct 1 ms 764 KB Partially correct
9 Partially correct 2 ms 768 KB Partially correct
10 Partially correct 0 ms 772 KB Partially correct
11 Incorrect 317 ms 852 KB Wrong query response.
12 Halted 0 ms 0 KB -