oj.uz

답안 #361743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
361743 2021-01-31T13:47:02 Z ryansee 기지국 (IOI20_stations) C++14
5 / 100
 1103 ms 1056 KB 
#include "stations.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)

vector<int> label(int n, int k, vector<int> U, vector<int> V) {
	vector<vector<int>> v(n, vector<int>());
	FOR(i,0,n-2) {
		v[U[i]].eb(V[i]), v[V[i]].eb(U[i]);
	}
	vector<int> nodes, C(n, 0);
	assert(nodes.empty());
	function<void(int,int)>dfs=[&](int x,int p){
		nodes.eb(x);
		for(auto i:v[x]) if(i^p) dfs(i, x);
	};
	FOR(i,0,n-1) if(siz(v[i])==1) { dfs(i, i); break; }
	FOR(i,0,n-1) C[nodes[i]]=i;
	return C;
}

int find_next_station(int s, int t, vector<int> c) {
	if(siz(c)==1) return c[0];
	if(s > t) {
		return *min_element(all(c));
	} else {
		return *max_element(all(c));
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 600 ms 968 KB Output is correct
2 Correct 548 ms 884 KB Output is correct
3 Correct 1103 ms 736 KB Output is correct
4 Correct 688 ms 864 KB Output is correct
5 Correct 747 ms 864 KB Output is correct
6 Correct 451 ms 1012 KB Output is correct
7 Correct 506 ms 884 KB Output is correct
8 Correct 3 ms 864 KB Output is correct
9 Correct 4 ms 864 KB Output is correct
10 Correct 2 ms 756 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 607 ms 964 KB Output is correct
2 Correct 591 ms 884 KB Output is correct
3 Correct 880 ms 896 KB Output is correct
4 Correct 722 ms 1012 KB Output is correct
5 Correct 665 ms 736 KB Output is correct
6 Correct 548 ms 964 KB Output is correct
7 Correct 565 ms 968 KB Output is correct
8 Correct 3 ms 904 KB Output is correct
9 Correct 4 ms 756 KB Output is correct
10 Correct 2 ms 864 KB Output is correct
11 Incorrect 743 ms 872 KB Wrong query response.
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1077 ms 872 KB Output is correct
2 Correct 761 ms 660 KB Output is correct
3 Correct 733 ms 756 KB Output is correct
4 Correct 3 ms 992 KB Output is correct
5 Correct 5 ms 736 KB Output is correct
6 Correct 2 ms 736 KB Output is correct
7 Incorrect 691 ms 1056 KB Wrong query response.
8 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 644 ms 960 KB Output is correct
2 Correct 461 ms 964 KB Output is correct
3 Correct 925 ms 736 KB Output is correct
4 Correct 665 ms 884 KB Output is correct
5 Correct 651 ms 864 KB Output is correct
6 Correct 601 ms 956 KB Output is correct
7 Correct 552 ms 968 KB Output is correct
8 Correct 3 ms 736 KB Output is correct
9 Correct 5 ms 756 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Incorrect 459 ms 1012 KB Wrong query response.
12 Halted 0 ms 0 KB -