제출 #308576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308576		Peacher29	Stations (IOI20_stations)	C++14	0 / 100	1027 ms	1000 KiB

stations

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

using namespace std;

class pont{
public:
	vector<int> v;
	int id;
	bool volt = 0;
	bool mely;
	void dfs(bool mely);
};

vector<pont> p;

int dd = -1;

void pont::dfs(bool mely){
	if(!volt){
		this->mely=mely;
		volt=1;
		if(mely)
		id=++dd;
		for(int i : v){
			p[i].dfs(!mely);
		}
		if(!mely)
		id=++dd;
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	dd=-1;
	p.clear();
	p.resize(n);
	for(int i=0;i<n-1;i++){
		p[u[i]].v.push_back(v[i]);
		p[v[i]].v.push_back(u[i]);
	}
	p[0].dfs(0);
	vector<int> er(n);
	for(int i=0;i<n;i++){
		er[i] = p[i].mely*2000+p[i].id;
	}
	return er;
}

bool contains(int mi, int mit){
	return mi/2000 <= mit/2000 && mit%2000 <= mi%2000;
}

int find_next_station(int s, int t, vector<int> c) {
	sort(c.begin(), c.end());
	for(int i : c){
		if(i==t) return t;
	}
	if(s/2000){
		if(t%2000<s%2000 || (c.size()>1 && c[c.size()-2]%2000 < t%2000)){
			return c.back();
		} else {
			for(int i=0;i<c.size(); i++){
				if(t%2000>c[i]%2000){
					return c[i-1];
				}
			}
			exit(255);
		}
	} else {
		if(s%2000<t%2000 || (c[0]%2000 > t%2000)){
			return c[0];
		} else {
			for(int i=0;i<c.size(); i++){
				if(t%2000<c[i]%2000){
					return c[i-1];
				}
			}
			exit(255);
		}

	}
}

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

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

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