제출 #956867

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
956867		12345678	Stations (IOI20_stations)	C++17	100 / 100	601 ms	1712 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=2e3+5;
int in[nx], out[nx], lvl[nx], cnt, pa, t1;
vector<int> res, d[nx];
vector<pair<int, int>> mp[nx];

void dfs(int u, int p)
{
    in[u]=++cnt;
    lvl[u]=lvl[p]+1;
    for (auto v:d[u]) if (v!=p) dfs(v, u);
    out[u]=++cnt;
    if (lvl[u]%2) mp[in[u]].push_back({u, 0});
    else mp[out[u]].push_back({u, 1});
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    cnt=-1;
    t1=0;
    for (int i=0; i<n; i++) d[i].clear();
    for (int i=0; i<2000; i++) mp[i].clear();
    res.resize(n);
    for (int i=0; i<n-1; i++) d[u[i]].push_back(v[i]), d[v[i]].push_back(u[i]);
    lvl[0]=0;
    dfs(0, 0);
    for (int i=0; i<2000; i++)
    {
        if (!mp[i].empty())
        {
            for (auto [x, y]:mp[i]) res[x]=t1;
            t1++;
        }
    }
	return res;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if (c.size()==1) return c[0];
    if (s<c[0])
    {
        if (s==0) for (auto x:c) if (t<=x) return x;
        pa=c.back();
        for (int i=0; i<c.size()-1; i++) if (s<=t&&t<=c[i]) return c[i];
        return pa;
    }
    else
    {
        pa=c.front();
        for (int i=c.size()-1; i>0; i--) if (c[i]<=t&&t<=s) return c[i];
        return pa;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 61 / 61