oj.uz

답안 #347206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347206 2021-01-12T11:16:39 Z blue 기지국 (IOI20_stations) C++17
0 / 100
 855 ms 864 KB 
#include "stations.h"
#include <vector>
using namespace std;

vector<int> edge[1000];
vector<int> subtree(1000, 0);
vector<int> res;

void dfs1(int u)
{
    subtree[u] = 1;
    for(int v: edge[u])
    {
        if(subtree[v]) continue;
        dfs1(v);
        subtree[u] += subtree[v];
    }
}

//               left/right, lower limit, upper limit
void dfs2(int u, bool flag, int a, int b)
{
    if(flag == 0)
    {
        res[u] = a;
        a++;
    }
    else
    {
        res[u] = b;
        b--;
    }
    for(int v: edge[u])
    {
        if(res[v] != -1) continue;
        dfs2(v, !flag, a, a + subtree[v] - 1);
        a += subtree[v];
    }
}

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
    for(int i = 0; i < n-1; i++)
    {
        edge[u[i]].push_back(v[i]);
        edge[v[i]].push_back(u[i]);
    }

    res = vector<int>(n, -1);

    dfs1(1);
    dfs2(1, 0, 0, n-1);

    return res;
}







int find_next_station(int s, int t, vector<int> c)
{
    if(s < c[0]) // s is a left label
    {
        if(t < s) return c.back();
        for(int i = 0; i < c.size(); i++) if(t <= c[i]) return c[i];
    }
    else //s is a right label
    {
        if(t > s) return c.front();
        for(int i = c.size() - 1; i >= 0; 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:68:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(int i = 0; i < c.size(); i++) if(t <= c[i]) return c[i];
      |                        ~~^~~~~~~~~~
stations.cpp:75:1: warning: control reaches end of non-void function [-Wreturn-type]
   75 | }
      | ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Invalid labels (duplicates values). scenario=2, label=6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 492 KB Invalid labels (duplicates values). scenario=3, label=458
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Invalid labels (duplicates values). scenario=1, label=38
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 855 ms 864 KB Output is correct
2 Incorrect 661 ms 756 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Invalid labels (duplicates values). scenario=1, label=26
2 Halted 0 ms 0 KB -