oj.uz

답안 #350175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
350175 2021-01-19T03:53:38 Z amunduzbaev 기지국 (IOI20_stations) C++14
0 / 100
 3000 ms 2097156 KB 
#include "stations.h"
 
#ifndef EVAL
#include "stub.cpp"
#endif
 
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define all(x) x.begin(), x.end()
 
const int NN = 1e3+5;
 
vector<int> edges[NN];
int tim;
vector<int> val;
 
void dfs(int u, int t, int p){
	if(t) val[u] = ++tim;
	for(auto x:edges[u]) if(x != p) dfs(x, t^1, u);
	if(!t) val[u] = ++tim;
}
 
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for(int i=0;i<n-1;i++){
		edges[u[i]].pb(v[i]);
		edges[v[i]].pb(u[i]);
	}
	val.resize(n);
	tim = -1;
	dfs(0, 1, -1);
	return val;
}
 
int find_next_station(int s, int t, vector<int> c){
	return 0;
  sort(all(c));
	if(s < c[0]){
		int p = c[sz(c)-1];
		if(t >= p || t < s) return p;
      	int i = 0;
      	while(c[i] < t && i < sz(c)-1) i++;
		return c[i];
	}
	else{
		int p = c[0];
		if(t > s || t < c[1]) return p; 
		int i = sz(c)-1;
		while(c[i] > t && i > 0) i--;
		return c[i];
	}
	
}
/*

1
5 10
0 1
1 2
2 3
3 4
3
1 3 
1 4 
0 1

1
5 10
0 1
1 2
1 3
2 4
2
0 2
1 3
 
*/

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1319 ms 2097156 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3031 ms 516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1422 ms 2097156 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2280 ms 2097156 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -