oj.uz

답안 #876303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876303 2023-11-21T14:09:47 Z vjudge1 기지국 (IOI20_stations) C++17
100 / 100
 537 ms 1548 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> ke[1001],ve,V;
int t,tin[1001],tout[1001],d[1001];
void dfs(int u, int p){
    tin[u]=++t;
    for (int v:ke[u])
        if (v!=p){
            d[v]=d[u]+1;
            dfs(v,u);
        }
    tout[u]=++t;
}
vector <int> label(int n, int k, vector <int> u, vector <int> v){
    V.clear();
    ve.clear();
	for (int i=0;i<n-1;i++){
        ke[u[i]].push_back(v[i]);
        ke[v[i]].push_back(u[i]);
	}
	dfs(0,0);
	for (int i=0;i<n;i++)
        if (d[i]%2==0)
            V.push_back(tin[i]);
        else
            V.push_back(tout[i]);
    sort(V.begin(),V.end());
    for (int i=0;i<n;i++){
        int val=(d[i]%2?tout[i]:tin[i]);
        ve.push_back(lower_bound(V.begin(),V.end(),val)-V.begin()+1);
    }
    for (int i=0;i<n;i++)
        ke[i].clear();
    t=0;
	return ve;
}
 
int find_next_station(int s, int t, vector <int> c){
    for (int i:c)
        if (i==t)
            return i;
    if (c.size()==1)
        return c[0];
    if (s<c[0]){
        int tout=c[c.size()-2];
        if (t>tout||t<s)
            return c.back();
        c.pop_back();
        for (int i:c)
            if (t<i)
                return i;
    }
    if (t<c[1]||t>s)
        return c[0];
    for (int i=c.size()-1;i;i--)
        if (t>c[i])
            return c[i];
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:59:1: warning: control reaches end of non-void function [-Wreturn-type]
   59 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 944 KB Output is correct
2 Correct 278 ms 940 KB Output is correct
3 Correct 514 ms 936 KB Output is correct
4 Correct 391 ms 688 KB Output is correct
5 Correct 333 ms 684 KB Output is correct
6 Correct 259 ms 928 KB Output is correct
7 Correct 262 ms 684 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 0 ms 768 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 888 KB Output is correct
2 Correct 297 ms 820 KB Output is correct
3 Correct 537 ms 684 KB Output is correct
4 Correct 378 ms 684 KB Output is correct
5 Correct 360 ms 684 KB Output is correct
6 Correct 269 ms 684 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 319 ms 940 KB Output is correct
2 Correct 255 ms 944 KB Output is correct
3 Correct 525 ms 684 KB Output is correct
4 Correct 373 ms 684 KB Output is correct
5 Correct 333 ms 684 KB Output is correct
6 Correct 262 ms 936 KB Output is correct
7 Correct 269 ms 684 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 0 ms 768 KB Output is correct
11 Correct 357 ms 828 KB Output is correct
12 Correct 272 ms 1052 KB Output is correct
13 Correct 242 ms 1548 KB Output is correct
14 Correct 225 ms 684 KB Output is correct
15 Correct 29 ms 768 KB Output is correct
16 Correct 36 ms 932 KB Output is correct
17 Correct 55 ms 936 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 496 ms 684 KB Output is correct
2 Correct 354 ms 684 KB Output is correct
3 Correct 346 ms 684 KB Output is correct
4 Correct 1 ms 764 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 0 ms 1200 KB Output is correct
7 Correct 331 ms 800 KB Output is correct
8 Correct 517 ms 940 KB Output is correct
9 Correct 407 ms 684 KB Output is correct
10 Correct 318 ms 684 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 2 ms 768 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 0 ms 1272 KB Output is correct
16 Correct 282 ms 940 KB Output is correct
17 Correct 277 ms 684 KB Output is correct
18 Correct 285 ms 940 KB Output is correct
19 Correct 300 ms 684 KB Output is correct
20 Correct 274 ms 684 KB Output is correct

Subtask #5
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 932 KB Output is correct
2 Correct 244 ms 936 KB Output is correct
3 Correct 499 ms 684 KB Output is correct
4 Correct 393 ms 684 KB Output is correct
5 Correct 347 ms 684 KB Output is correct
6 Correct 256 ms 940 KB Output is correct
7 Correct 254 ms 684 KB Output is correct
8 Correct 1 ms 764 KB Output is correct
9 Correct 2 ms 804 KB Output is correct
10 Correct 0 ms 764 KB Output is correct
11 Correct 267 ms 880 KB Output is correct
12 Correct 324 ms 852 KB Output is correct
13 Correct 501 ms 684 KB Output is correct
14 Correct 367 ms 684 KB Output is correct
15 Correct 319 ms 684 KB Output is correct
16 Correct 270 ms 684 KB Output is correct
17 Correct 351 ms 684 KB Output is correct
18 Correct 258 ms 1168 KB Output is correct
19 Correct 294 ms 1300 KB Output is correct
20 Correct 219 ms 684 KB Output is correct
21 Correct 27 ms 768 KB Output is correct
22 Correct 38 ms 940 KB Output is correct
23 Correct 54 ms 956 KB Output is correct
24 Correct 2 ms 764 KB Output is correct
25 Correct 4 ms 768 KB Output is correct
26 Correct 2 ms 768 KB Output is correct
27 Correct 1 ms 764 KB Output is correct
28 Correct 0 ms 768 KB Output is correct
29 Correct 297 ms 940 KB Output is correct
30 Correct 289 ms 684 KB Output is correct
31 Correct 284 ms 684 KB Output is correct
32 Correct 290 ms 684 KB Output is correct
33 Correct 318 ms 684 KB Output is correct
34 Correct 181 ms 924 KB Output is correct
35 Correct 260 ms 1516 KB Output is correct
36 Correct 253 ms 940 KB Output is correct
37 Correct 255 ms 1276 KB Output is correct
38 Correct 278 ms 1168 KB Output is correct
39 Correct 262 ms 1288 KB Output is correct
40 Correct 252 ms 1168 KB Output is correct
41 Correct 276 ms 1164 KB Output is correct
42 Correct 36 ms 876 KB Output is correct
43 Correct 55 ms 1164 KB Output is correct
44 Correct 77 ms 904 KB Output is correct
45 Correct 96 ms 900 KB Output is correct
46 Correct 175 ms 1064 KB Output is correct
47 Correct 163 ms 908 KB Output is correct
48 Correct 35 ms 932 KB Output is correct
49 Correct 28 ms 1408 KB Output is correct