oj.uz

답안 #430092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430092 2021-06-16T11:24:27 Z yanire 기지국 (IOI20_stations) C++17
8 / 100
 1281 ms 592 KB 
#include <bits/stdc++.h>
using namespace std;
#include "stations.h"
#define fin(i,s,n) for(auto i = s; i < n; ++i)
#define fine(i,s,n) for(auto i = s; i <= n; ++i)
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
using ii = pair<int,int>;
using vi = vector<int>;
using vii = vector<ii>;
template<class T> ostream& operator<<(ostream& os, vector<T> v) {
	if(v.empty()) return os << "[]";
	os << '[' << v[0];
	fin(i,1,int(v.size())) os << ',' << v[i];
	return os << ']';
}
const int maxn = 1005;
vi l;
int lid = 0;
vi g[maxn];
void dfs(int u) {
	if(l[u]!=-1) return;
	l[u] = lid++;
	for(int v : g[u]) dfs(v);
}
vi label(int n, int k, vi u, vi v) {
	l = vi(n,-1),lid = 0;
	fin(i,0,n) g[i].clear();
	fin(i,0,n-1) g[u[i]].pb(v[i]),g[v[i]].pb(u[i]);
	// fin(i,0,n) if(g[i].size()==1) { dfs(i); break; }
	iota(all(l),0);
	return l;
}
int dir(int a, int b){ 
	if(a==b) return 0;
	return b>a?1:-1;
}
bool anc(int u, int v) {
	while(v>=u) {
		if(u==v) return 1;
		v = (v-1)/2;
	}
	return 0;
}
int find_next_station(int s, int t, vi c) {
	if(anc(s,t)) {
		vi ops;
		for(int v : c) if(anc(v,t)) ops.pb(v);
		if(ops.empty()) return c[0];
		return *max_element(all(ops));
	}
	for(int v : c) if(anc(v,s)) return v;
	return c[0];
}

Subtask #1
0 / 5.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 724 ms 568 KB Output is correct
2 Correct 689 ms 548 KB Output is correct
3 Correct 1128 ms 400 KB Output is correct
4 Correct 804 ms 400 KB Output is correct
5 Correct 820 ms 400 KB Output is correct
6 Correct 584 ms 508 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 61.0

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