oj.uz

답안 #341710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341710 2020-12-30T14:14:04 Z ogibogi2004 기지국 (IOI20_stations) C++14
15 / 100
 1065 ms 1376 KB 
#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define time afds
const int MAXN=1024;
vector<int>g[MAXN];
int depth[MAXN];
int in_time[MAXN],out_time[MAXN],time=-1;
void dfs(int u,int par)
{
	in_time[u]=++time;
	for(auto v:g[u])
	{
		if(v==par)continue;
		depth[v]=depth[u]+1;
		dfs(v,u);
	}
	out_time[u]=++time;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	time=-1;
	memset(depth,-1,sizeof(depth));
	for(int i=0;i<=n;i++)g[i].clear();
	for(int i=0;i<u.size();i++)
	{
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}
	dfs(0,-1);
	set<int>l;
	map<int,int>mp;
	for (int i = 0; i < n; i++) {
		if(depth[i]%2==0)
		{
			labels[i]=in_time[i];
		}
		else labels[i]=out_time[i];
		l.insert(labels[i]);
	}
	int cnt=0;
	for(auto xd:l)
	{
		mp[xd]=cnt;++cnt;
	}
	for(int i=0;i<n;i++)
	{
		labels[i]=mp[labels[i]];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if(c.size()==1)return c[0];
	if(s<c[0])
	{
		int in_s=s;
		int out_s=c[c.size()-1]-1;
		if(t<in_s||t>out_s)return c[c.size()-1];
		else
		{
			int in1=s+1,out1;
			for(int i=0;i<c.size();i++)
			{
				out1=c[i];
				if(t>=in1&&t<=out1)return c[i];
				in1=out1+1;
			}
		}
	}
	else
	{
		int out_s=s;
		int in_s=c[0]+1;
		int in1,out1=out_s-1;
		//cout<<s<<" "<<t<<" "<<in_s<<" "<<out_s<<endl;
		if(t<in_s||t>out_s)return c[0];
		for(int i=c.size()-1;i>0;i--)
		{
			in1=c[i];
			if(t>=in1&&t<=out1)return c[i];
			out1=in1-1;
		}
	}
	return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 554 ms 1244 KB Output is correct
2 Correct 487 ms 992 KB Output is correct
3 Correct 939 ms 864 KB Output is correct
4 Correct 688 ms 900 KB Output is correct
5 Correct 595 ms 940 KB Output is correct
6 Correct 493 ms 1036 KB Output is correct
7 Correct 477 ms 992 KB Output is correct
8 Correct 3 ms 940 KB Output is correct
9 Correct 5 ms 736 KB Output is correct
10 Correct 2 ms 776 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 545 ms 864 KB Output is correct
2 Correct 460 ms 992 KB Output is correct
3 Correct 970 ms 940 KB Output is correct
4 Correct 695 ms 1120 KB Output is correct
5 Correct 594 ms 864 KB Output is correct
6 Correct 433 ms 864 KB Output is correct
7 Correct 481 ms 1008 KB Output is correct
8 Correct 3 ms 940 KB Output is correct
9 Correct 5 ms 864 KB Output is correct
10 Correct 2 ms 940 KB Output is correct
11 Correct 711 ms 864 KB Output is correct
12 Correct 432 ms 1300 KB Output is correct
13 Incorrect 503 ms 1264 KB Wrong query response.
14 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1065 ms 992 KB Output is correct
2 Correct 729 ms 940 KB Output is correct
3 Correct 578 ms 948 KB Output is correct
4 Correct 3 ms 864 KB Output is correct
5 Correct 5 ms 948 KB Output is correct
6 Correct 2 ms 864 KB Output is correct
7 Correct 732 ms 940 KB Output is correct
8 Correct 899 ms 864 KB Output is correct
9 Correct 776 ms 992 KB Output is correct
10 Correct 677 ms 940 KB Output is correct
11 Correct 6 ms 736 KB Output is correct
12 Correct 7 ms 736 KB Output is correct
13 Correct 5 ms 948 KB Output is correct
14 Correct 5 ms 736 KB Output is correct
15 Correct 2 ms 864 KB Output is correct
16 Correct 542 ms 1016 KB Output is correct
17 Correct 495 ms 736 KB Output is correct
18 Correct 597 ms 864 KB Output is correct
19 Correct 566 ms 864 KB Output is correct
20 Correct 607 ms 940 KB Output is correct

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 1376 KB Output is correct
2 Correct 468 ms 864 KB Output is correct
3 Correct 964 ms 940 KB Output is correct
4 Correct 723 ms 940 KB Output is correct
5 Correct 578 ms 940 KB Output is correct
6 Correct 432 ms 864 KB Output is correct
7 Correct 440 ms 992 KB Output is correct
8 Correct 2 ms 864 KB Output is correct
9 Correct 5 ms 736 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Incorrect 458 ms 992 KB Wrong query response.
12 Halted 0 ms 0 KB -