제출 #307648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307648		azberjibiou	기지국 (IOI20_stations)	C++17	100 / 100	1199 ms	10688 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define fir first
#define sec second
#define pii pair<int, int>
using namespace std;
const int mxN=100010;
int N;
vector <int> v[mxN], down[mxN];
int ans[mxN];
bool Chk[mxN];
int typ[mxN];
int sub[mxN];
void dfs1(int num, int typn)
{
    Chk[num]=true;
    typ[num]=typn;
    for(int ele : v[num])
    {
        if(Chk[ele])    continue;
        dfs1(ele, 1-typn);
        sub[num]+=sub[ele];
        down[num].push_back(ele);
    }
}
void dfs2(int num, int str, int fin)
{
    if(typ[num]==0) ans[num]=str++;
    else    ans[num]=fin--;
    for(int ele : down[num])
    {
        dfs2(ele, str, str+sub[ele]-1);
        str+=sub[ele];
    }
}
std::vector<int> label(int n, int k, std::vector<int> a, std::vector<int> b) {
	vector<int> labels(n);
	N=n;
	for(int i=0;i<N;i++)    v[i].clear(), down[i].clear();
	for(int i=0;i<N;i++)    Chk[i]=false, typ[i]=0, sub[i]=1, ans[i]=-1;
	for(int i=0;i<N-1;i++)
    {
        v[a[i]].push_back(b[i]);
        v[b[i]].push_back(a[i]);
    }
    dfs1(1, 0);
    dfs2(1, 0, N-1);
	for (int i = 0; i < n; i++) {
		labels[i] = ans[i];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(c.size()==1) return c[0];
	if(s<c[0])
    {
        int str=s;
        for(int i=0;i<c.size()-1;i++)
        {
            if(str<=t && t<=c[i])   return c[i];
            str=c[i]+1;
        }
        return c.back();
    }
	else
    {
        int fin=s;
        for(int i=c.size()-1;i>0;i--)
        {
            if(t<=fin && t>=c[i])   return c[i];
            fin=c[i]-1;
        }
        return c[0];
    }
}

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

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

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