oj.uz

답안 #1073783

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073783 2024-08-24T20:56:49 Z thatsgonzalez 기지국 (IOI20_stations) C++14
0 / 100
 647 ms 684 KB 
#include "stations.h"
#include <vector>

#include <bits/stdc++.h>
using namespace std;


#define pb push_back



int dfs(int node, int p, vector<vector<int>> &g, vector<int> &sub_tree){

	for(auto &x: g[node]){
		if(x == p) continue;

		sub_tree[node]+=dfs(x,node,g,sub_tree);

	}

	return sub_tree[node]=sub_tree[node]+1;

}

void calc_labels(int node, int p, int t, int mn, vector<vector<int>> &g, vector<int> &sub_tree, vector<int> &labels){
	if(t){
		labels[node] = mn+sub_tree[node]-1;
	}
	else{
		labels[node] = mn; mn++;
	}

	for(auto &x: g[node]){
		if(x == p) continue;
		int turno = t^1;
		calc_labels(x,node,turno,mn,g,sub_tree,labels);
	}


}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	
	vector<int> sub_tree(n,0);
	vector<vector<int>> g(n);
	vector<int> labels(n);

	for(int i = 0; i<n-1; i++){
		g[u[i]].pb(v[i]);
		g[v[i]].pb(u[i]);
	}


	dfs(0,-1,g,sub_tree);
	calc_labels(0,-1,1,1,g,sub_tree,labels);


	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	
	if(c[0]>s){
		int l = s;
		for(int i = 0; i<c.size()-1; i++){
			if(t>=l and t<=c[i]){
				return c[i];
			}
			else l = c[i]+1;
		}
		return c.back();
	}
	else{
		int r = s;
		for(int i = c.size()-1; i; i--){
			if(t>=c[i] and t<=r) return c[i];
			else r = c[i]-1;
		}
		return c[0];
	}

}

Compilation message

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

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 647 ms 684 KB Output is correct
2 Incorrect 0 ms 344 KB Invalid labels (duplicates values). scenario=1, label=1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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