oj.uz

답안 #341679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341679 2020-12-30T12:13:15 Z ogibogi2004 기지국 (IOI20_stations) C++14
0 / 100
 950 ms 1104 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 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;
		dfs(v,u);
	}
	out_time[u]=time;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	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);
	for (int i = 0; i < n; i++) {
		if(in_time[i]*1000+out_time[i]<=k)labels[i] = in_time[i]*1000+out_time[i];
		else labels[i]=in_time[i];
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	int in_s=s/1000,out_s=s%1000;
	int in_t=t/1000,out_t=t%1000;
	if(out_t<in_s||in_t>out_s)
	{
		for(auto xd:c)
		{
			int in1=xd/1000,out1=xd%1000;
			if(in1<=in_s&&out1>=out_s)
			{
				return xd;
			}
		}
	}
	else
	{
		for(auto xd:c)
		{
			int in1=xd/1000,out1=xd%1000;
			if(in1<=in_t&&out1>=out_t)
			{
				return xd;
			}
		}
	}
	return 0;
}

Compilation message

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

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 950 ms 736 KB Output is correct
2 Incorrect 796 ms 736 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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