Submission #311966

# Submission time Handle Problem Language Result Execution time Memory
311966 2020-10-12T05:11:42 Z htc001 Stations (IOI20_stations) C++14
0 / 100
868 ms 1024 KB
#include<bits/stdc++.h>
#include<cassert>
#include "stations.h"
using namespace std;

const int N=1005;
int tme,m;
vector<int> lab;
vector<int> nei[N];
map<int,int> mp;

void dfs(int x,int p,int lv){
	++tme;
	if(lv){
		lab[x-1]=tme;
		mp[tme];
	}
	for(int i=0;i<int(nei[x].size());i++){
		int to=nei[x][i];
		if(to!=p) dfs(to,x,lv^1);
	}
	++tme;
	if(!lv){
		lab[x-1]=tme;
		mp[tme];
	}
}

vector<int> label(int n,int k,vector<int> u,vector<int> v){
	mp.clear();
	lab.clear();
	lab.resize(n);
	tme=0;m=0;
	for(int i=1;i<=n;i++) nei[i].clear();
	for(int i=0;i<n-1;i++){
		u[i]++;v[i]++;
//		printf("%d %d\n",u[i],v[i]);
		nei[u[i]].push_back(v[i]);
		nei[v[i]].push_back(u[i]);
	}
	dfs(1,-1,0);
	for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++) it->second=m++;
	for(int i=0;i<n;i++) lab[i]=mp[lab[i]];
	return lab;
}

int find_next_station(int s,int t,vector<int> c){
	sort(c.begin(),c.end());
	assert(s<c[0]||s>c[int(c.size())-1]);
	if(s<c[0]){
		if(t>s) return *lower_bound(c.begin(),c.end(),t);
		else return c[int(c.size())-1];
	}else{
		if(t<s) return *(lower_bound(c.begin(),c.end(),t+1)-1);
		else return c[0];
	}
}
# Verdict Execution time Memory Grader output
1 Incorrect 528 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 453 ms 772 KB Wrong query response.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 556 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 868 ms 876 KB Output is correct
2 Correct 686 ms 768 KB Output is correct
3 Incorrect 591 ms 872 KB Wrong query response.
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 552 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -