답안 #565133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565133 2022-05-20T10:39:02 Z luka1234 기지국 (IOI20_stations) C++14
100 / 100
849 ms 1272 KB
#include "stations.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
vector<int> g[1001];
int tin=0;
int lab[1001];
map<int,int> mp;
void dfs(int v,int e,bool b){
	tin++;
	if(b==0)
	   lab[v]=tin;
	for(int i:g[v]){
		if(i!=e){
			dfs(i,v,!b);
		}
	}
	tin++;
	if(b==1)
	   lab[v]=tin;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	vector<int> vec;
	for(int i=0;i<n;i++)
	    g[i].clear();
	for(int i=0;i<n-1;i++){
		g[v[i]].push_back(u[i]);
		g[u[i]].push_back(v[i]);
	}
	dfs(0,-1,0);
	for(int k=0;k<n;k++){
		vec.push_back(lab[k]);
	}
	sort(vec.begin(),vec.end());
	for(int k=0;k<n;k++){
		mp[vec[k]]=k;
	}
	for(int k=0;k<n;k++){
		lab[k]=mp[lab[k]];
		labels[k]=lab[k];
	}
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c){
	sort(c.begin(),c.end());
	int sz=c.size();
	if(sz==1)
	   return c[0];
	if(s>c[0]){
		int mn=c[1];
		int mx=s;
		if(!(t>=mn&&t<=mx))
		   return c[0];
		else{
			for(int k=sz-1;k>0;k--){
				if(t>=c[k]&&t<=mx)
				   return c[k];
			}
		}
	}
	else{
		int mn=s;
		int mx=c[sz-2];
		if(!(t>=mn&&t<=mx))
		   return c[sz-1];
		else{
			for(int k=0;k<sz-1;k++){
				if(t>=s&&t<=c[k])
				   return c[k];
			}
		}
	}
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:75:1: warning: control reaches end of non-void function [-Wreturn-type]
   75 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Correct 476 ms 792 KB Output is correct
2 Correct 424 ms 1000 KB Output is correct
3 Correct 837 ms 420 KB Output is correct
4 Correct 610 ms 416 KB Output is correct
5 Correct 500 ms 420 KB Output is correct
6 Correct 447 ms 1036 KB Output is correct
7 Correct 445 ms 660 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 7 ms 496 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 458 ms 1012 KB Output is correct
2 Correct 503 ms 648 KB Output is correct
3 Correct 766 ms 420 KB Output is correct
4 Correct 655 ms 528 KB Output is correct
5 Correct 644 ms 656 KB Output is correct
6 Correct 500 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 515 ms 800 KB Output is correct
2 Correct 424 ms 1028 KB Output is correct
3 Correct 844 ms 416 KB Output is correct
4 Correct 671 ms 420 KB Output is correct
5 Correct 527 ms 548 KB Output is correct
6 Correct 377 ms 1056 KB Output is correct
7 Correct 398 ms 732 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 4 ms 492 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 479 ms 420 KB Output is correct
12 Correct 437 ms 988 KB Output is correct
13 Correct 426 ms 1144 KB Output is correct
14 Correct 416 ms 540 KB Output is correct
15 Correct 58 ms 544 KB Output is correct
16 Correct 69 ms 828 KB Output is correct
17 Correct 103 ms 1156 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 849 ms 416 KB Output is correct
2 Correct 646 ms 416 KB Output is correct
3 Correct 559 ms 528 KB Output is correct
4 Correct 4 ms 500 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 0 ms 496 KB Output is correct
7 Correct 593 ms 532 KB Output is correct
8 Correct 845 ms 420 KB Output is correct
9 Correct 617 ms 416 KB Output is correct
10 Correct 567 ms 416 KB Output is correct
11 Correct 5 ms 500 KB Output is correct
12 Correct 4 ms 616 KB Output is correct
13 Correct 3 ms 492 KB Output is correct
14 Correct 3 ms 500 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 495 ms 532 KB Output is correct
17 Correct 492 ms 556 KB Output is correct
18 Correct 439 ms 532 KB Output is correct
19 Correct 470 ms 420 KB Output is correct
20 Correct 396 ms 528 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 454 ms 804 KB Output is correct
2 Correct 445 ms 1028 KB Output is correct
3 Correct 805 ms 416 KB Output is correct
4 Correct 609 ms 416 KB Output is correct
5 Correct 524 ms 416 KB Output is correct
6 Correct 391 ms 1036 KB Output is correct
7 Correct 412 ms 652 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 383 ms 1028 KB Output is correct
12 Correct 492 ms 668 KB Output is correct
13 Correct 823 ms 416 KB Output is correct
14 Correct 603 ms 420 KB Output is correct
15 Correct 550 ms 420 KB Output is correct
16 Correct 417 ms 528 KB Output is correct
17 Correct 441 ms 416 KB Output is correct
18 Correct 384 ms 1112 KB Output is correct
19 Correct 424 ms 1172 KB Output is correct
20 Correct 371 ms 544 KB Output is correct
21 Correct 54 ms 544 KB Output is correct
22 Correct 63 ms 788 KB Output is correct
23 Correct 93 ms 1056 KB Output is correct
24 Correct 5 ms 500 KB Output is correct
25 Correct 4 ms 500 KB Output is correct
26 Correct 4 ms 500 KB Output is correct
27 Correct 4 ms 612 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 403 ms 532 KB Output is correct
30 Correct 457 ms 532 KB Output is correct
31 Correct 471 ms 420 KB Output is correct
32 Correct 470 ms 420 KB Output is correct
33 Correct 446 ms 540 KB Output is correct
34 Correct 304 ms 1184 KB Output is correct
35 Correct 375 ms 1028 KB Output is correct
36 Correct 358 ms 1036 KB Output is correct
37 Correct 414 ms 1140 KB Output is correct
38 Correct 395 ms 1140 KB Output is correct
39 Correct 386 ms 1272 KB Output is correct
40 Correct 401 ms 1036 KB Output is correct
41 Correct 410 ms 1124 KB Output is correct
42 Correct 65 ms 956 KB Output is correct
43 Correct 96 ms 1184 KB Output is correct
44 Correct 123 ms 916 KB Output is correct
45 Correct 145 ms 1060 KB Output is correct
46 Correct 257 ms 836 KB Output is correct
47 Correct 261 ms 1044 KB Output is correct
48 Correct 60 ms 1136 KB Output is correct
49 Correct 54 ms 1216 KB Output is correct