제출 #372842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372842		Ozy	기지국 (IOI20_stations)	C++17	0 / 100	3067 ms	2097156 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli int
#define debug(a) cout << #a << ' ' << a << endl

lli cont,tam;
vector<lli> hijos[1002],res;

void llena(lli pos, lli padre, lli pp) {

    if (pp == 1) res[pos] = cont++;

    for (auto h : hijos[pos]) {
        if (h == padre) continue;

        if (pp == 1) llena(h,pos,0);
        else llena(h,pos,1);
    }

    if (pp == 0) res[pos] = cont++;

}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {

	res.resize(n);
	rep(i,0,n-2) {
        hijos[u[i]].push_back(v[i]);
        hijos[v[i]].push_back(u[i]);
	}
	cont = 0;
	llena(0,-1,1);

	return res;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int ini,fin;

	ini = c[0];
	fin = c[c.size()-1];

	if (ini > s) {

        if (t < s) return fin;
        if (t > fin) return fin;
        for (auto h : c) {
            if (t <= h && t >= s) return h;
        }

	}
	else {
        if (t > s) return ini;
        if (t < ini) return ini;

        tam = c.size()-1;
        repa(i,tam,0) {
            if (t >= c[i] && t <= c[i]) return c[i];
        }
	}

}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:65:1: warning: control reaches end of non-void function [-Wreturn-type]
   65 | }
      | ^

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