oj.uz

답안 #306154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
306154 2020-09-24T17:06:04 Z SorahISA 기지국 (IOI20_stations) C++17
52.3244 / 100
 1013 ms 1132 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;

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

void dfs(int now, int lst) {
    lab[now] = tok++, sz[now] = 1;
    for (auto x : adj[now]) {
        if (x != lst) dfs(x, now), sz[now] += sz[x];
    }
}

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), sz.resize(n);
    tok = 0;
    
    for (int i = 0; i < n-1; ++i) {
        adj[u[i]].eb(v[i]), adj[v[i]].eb(u[i]);
    }
    dfs(0, -1);
    
    for (int i = 0; i < n; ++i) lab[i] = lab[i] * 1000 + sz[i] - 1;
    
    // cout << "lab : ";
    // for (int i = 0; i < n; ++i) cout << lab[i] << " \n"[i == n-1];
    
    return lab;
}

int find_next_station(int s, int t, vector<int> c) {
    // sort(ALL(c), [](auto a, auto b) {return a/1000 < b/1000;});
    // cout << "c : "; for (auto x : c) cout << x << " "; cout << "\n";
    if (s/1000 > t/1000 or s/1000 + s%1000 + 1 <= t/1000) return c[0];
    for (int i = 1; i < c.size(); ++i) {
        if (c[i]/1000 > t/1000) return c[i - 1];
    }
    return c.back();
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int i = 1; i < c.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 512 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=6003
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1510
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 553 ms 1024 KB Output is correct
2 Correct 469 ms 1024 KB Output is correct
3 Correct 925 ms 884 KB Output is correct
4 Correct 692 ms 880 KB Output is correct
5 Correct 657 ms 1024 KB Output is correct
6 Correct 530 ms 1024 KB Output is correct
7 Correct 535 ms 776 KB Output is correct
8 Correct 3 ms 880 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 800 ms 768 KB Output is correct
12 Correct 521 ms 1044 KB Output is correct
13 Correct 487 ms 1024 KB Output is correct
14 Correct 530 ms 820 KB Output is correct
15 Correct 60 ms 876 KB Output is correct
16 Correct 77 ms 768 KB Output is correct
17 Correct 106 ms 808 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 919 ms 768 KB Output is correct
2 Correct 690 ms 876 KB Output is correct
3 Correct 623 ms 768 KB Output is correct
4 Correct 3 ms 880 KB Output is correct
5 Correct 5 ms 880 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 612 ms 880 KB Output is correct
8 Correct 904 ms 880 KB Output is correct
9 Correct 679 ms 876 KB Output is correct
10 Correct 572 ms 768 KB Output is correct
11 Correct 6 ms 876 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 5 ms 768 KB Output is correct
14 Correct 4 ms 876 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 526 ms 768 KB Output is correct
17 Correct 497 ms 880 KB Output is correct
18 Correct 513 ms 876 KB Output is correct
19 Correct 528 ms 1040 KB Output is correct
20 Correct 500 ms 880 KB Output is correct

Subtask #5
26.3244 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 548 ms 1008 KB Partially correct
2 Partially correct 480 ms 1024 KB Partially correct
3 Correct 899 ms 768 KB Output is correct
4 Partially correct 670 ms 768 KB Partially correct
5 Partially correct 702 ms 884 KB Partially correct
6 Partially correct 443 ms 1024 KB Partially correct
7 Partially correct 491 ms 768 KB Partially correct
8 Partially correct 3 ms 884 KB Partially correct
9 Partially correct 5 ms 768 KB Partially correct
10 Partially correct 2 ms 768 KB Partially correct
11 Partially correct 578 ms 768 KB Partially correct
12 Partially correct 614 ms 816 KB Partially correct
13 Correct 1013 ms 876 KB Output is correct
14 Partially correct 775 ms 876 KB Partially correct
15 Partially correct 671 ms 884 KB Partially correct
16 Partially correct 591 ms 824 KB Partially correct
17 Partially correct 651 ms 888 KB Partially correct
18 Partially correct 494 ms 784 KB Partially correct
19 Partially correct 484 ms 1024 KB Partially correct
20 Partially correct 477 ms 768 KB Partially correct
21 Partially correct 60 ms 768 KB Partially correct
22 Partially correct 93 ms 964 KB Partially correct
23 Partially correct 114 ms 936 KB Partially correct
24 Partially correct 6 ms 768 KB Partially correct
25 Partially correct 7 ms 780 KB Partially correct
26 Partially correct 5 ms 880 KB Partially correct
27 Partially correct 4 ms 1004 KB Partially correct
28 Partially correct 2 ms 880 KB Partially correct
29 Partially correct 648 ms 1024 KB Partially correct
30 Partially correct 596 ms 1024 KB Partially correct
31 Partially correct 625 ms 1024 KB Partially correct
32 Partially correct 571 ms 768 KB Partially correct
33 Partially correct 560 ms 1008 KB Partially correct
34 Partially correct 457 ms 1024 KB Partially correct
35 Partially correct 613 ms 1008 KB Partially correct
36 Partially correct 630 ms 1024 KB Partially correct
37 Partially correct 577 ms 884 KB Partially correct
38 Partially correct 475 ms 768 KB Partially correct
39 Partially correct 477 ms 1024 KB Partially correct
40 Partially correct 482 ms 768 KB Partially correct
41 Partially correct 497 ms 888 KB Partially correct
42 Partially correct 83 ms 768 KB Partially correct
43 Partially correct 113 ms 936 KB Partially correct
44 Partially correct 127 ms 784 KB Partially correct
45 Partially correct 167 ms 768 KB Partially correct
46 Partially correct 302 ms 896 KB Partially correct
47 Partially correct 407 ms 784 KB Partially correct
48 Partially correct 82 ms 1024 KB Partially correct
49 Partially correct 80 ms 1024 KB Partially correct