oj.uz

Submission #311946

# Submission time Handle Problem Language Result Execution time Memory
311946 2020-10-12T03:42:44 Z htc001 Stations (IOI20_stations) C++14
0 / 100
 892 ms 1384 KB 
#include<bits/stdc++.h>
#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]++;
		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());
	if(s<c[0]){
		if(t>s) return *lower_bound(c.begin(),c.end(),s);
		else return c[int(c.size())-1];
	}else{
		if(t<s) return *(lower_bound(c.begin(),c.end(),s+1)-1);
		else return c[0];
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 555 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 468 ms 1024 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 550 ms 1280 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 892 ms 1000 KB Output is correct
2 Incorrect 656 ms 872 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 533 ms 1384 KB Wrong query response.
2 Halted 0 ms 0 KB -