oj.uz

답안 #434214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434214 2021-06-20T18:32:07 Z Kanaifu 기지국 (IOI20_stations) C++14
0 / 100
 3000 ms 2097156 KB 
#include <bits/stdc++.h>
#include "stations.h"
//#include "stub.cpp"

using namespace std;
#define pb push_back

vector <int> adj[1001];
int in[1001], out[1001];
int cnt = -1;

void dfs (int node, int last)
{
    cnt++;
    in[node] = cnt;
    for (auto next : adj[node])
    {
        if (next==last)
        {
            continue;
        }
        dfs(next, node);
    }
    out[node] = cnt;
}

bool check(int lab1, int lab2)
{
    int cur_in = lab1/1000;
    int cur_out = lab1%1000;
    int des_in = lab2/1000;
    int des_out = lab2%1000;
    if (cur_in < des_in and des_in <= cur_out)
    {
        return true;
    }
    else
    {
        return false;
    }
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
    vector <int> labels;
	for (int i = 0; i < n-1; i++)
    {
		adj[u[i]].pb(v[i]);
        adj[v[i]].pb(u[i]);
	}
	dfs(0, -1);
	for (int i=0; i<n; i++)
    {
        labels.pb(in[i]*1000 + out[i]);
    }
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c)
{
    if (check(s, t))
    {
        for (int child : c)
        {
            if (child==t)
            {
                return child;
            }
            if (check(child, s))
            {
                continue;
            }
            if (check(child, t))
            {
                return child;
            }
        }
    }
    else
    {
        for (int child : c)
        {
            if (child==t)
            {
                return child;
            }
            if (check(child, s))
            {
                return child;
            }
        }
    }
    return c[0];
}

/*
1
5 10
0 1
1 2
1 3
2 4
2
2 0 1
1 3 3

*/

Compilation message

stations.cpp: In function 'bool check(int, int)':
stations.cpp:32:9: warning: unused variable 'des_out' [-Wunused-variable]
   32 |     int des_out = lab2%1000;
      |         ^~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2081 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3053 ms 412 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1554 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1006 ms 512 KB Output is correct
2 Runtime error 1173 ms 2097156 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2747 ms 2097156 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -