oj.uz

답안 #304957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304957 2020-09-22T09:23:12 Z Wu_Ren 기지국 (IOI20_stations) C++14
0 / 100
 997 ms 1036 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
struct lab{
	vector<int>ans;
	int head[1010],o,cnt;
	struct edge{
		int to,link;
	}e[2010];
	void add_edge(int u,int v){
		e[++o].to=v,e[o].link=head[u],head[u]=o;
		e[++o].to=u,e[o].link=head[v],head[v]=o;
	}
	void dfs(int u,int pre,int dep){
		if(dep&1) ans[u]=cnt++;
		for(int i=head[u];i;i=e[i].link){
			if(e[i].to==pre) continue;
			dfs(e[i].to,u,dep+1);
		}
		if(!(dep&1)) ans[u]=cnt++;
	}
	vector<int> label(int n,int k,vector<int>u,vector<int>v){
		for(int i=0;i<n;i++) head[i]=0;cnt=o=0;
		ans.resize(n);
		for(int i=0;i<n-1;i++) add_edge(u[i],v[i]);
		dfs(0,-1,1);
		return ans;
	}
}Wu_Ren;

vector<int> label(int n,int k,vector<int>u,vector<int>v){
	return Wu_Ren.label(n,k,u,v);
}

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

Compilation message

stations.cpp: In member function 'std::vector<int> lab::label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:23:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   23 |   for(int i=0;i<n;i++) head[i]=0;cnt=o=0;
      |   ^~~
stations.cpp:23:34: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   23 |   for(int i=0;i<n;i++) head[i]=0;cnt=o=0;
      |                                  ^~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 683 ms 992 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 554 ms 896 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 778 ms 1036 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 997 ms 916 KB Output is correct
2 Correct 646 ms 640 KB Output is correct
3 Incorrect 764 ms 760 KB Wrong query response.
4 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 939 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -