oj.uz

답안 #315687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315687 2020-10-23T16:36:06 Z Sorting 기지국 (IOI20_stations) C++17
0 / 100
 913 ms 1024 KB 
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1000 + 3;

vector<int> adj[N];

int dfs(int u, int p, int idx, vector<int> &labels){
    for(int to: adj[u]){
        if(to == p) continue;
        idx = dfs(to, u, idx, labels);
    }
    labels[u] = idx++;
    return idx;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
    for(int i = 0; i < n; ++i)
        adj[i].clear();

    for(int i = 0; i < n - 1; ++i){
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }

	vector<int> labels(n);
	dfs(0, -1, 0, labels);
	return labels;
}

int find_next_station(int s, int t, vector<int> c){
    for(int i = 0; i < c.size(); ++i)
        if(c[i] >= t)
            return c[i];
    return c.back();
}
/*
2
5 10
0 1
0 2
1 3
1 4
1
0 4 0
2 1
0 1
1
1 0 0
*/

Compilation message

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 563 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 458 ms 816 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 726 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 913 ms 768 KB Output is correct
2 Correct 677 ms 884 KB Output is correct
3 Incorrect 598 ms 888 KB Wrong query response.
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 530 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -