oj.uz

답안 #531785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
531785 2022-03-01T13:43:29 Z BorisBarca 꿈 (IOI13_dreaming) C++14
47 / 100
 113 ms 32092 KB 
/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline int ccw(pii a, pii b, pii c) {
	return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}


inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

#include "dreaming.h"

const int N = 1e5 + 10;

int a[N], b[N], t[N], idx, bst, d, dp[N], rj[N], sb[N];
vpi e[N];
vi comp[N];
bool bio[N];

void diam1(int node, int dad, int l){
	if (l > d){
		bst = node;
		d = l;
	}
	bio[node] = 1;
	comp[idx].PB(node);
	FORA(nxt, e[node]){
		if (!bio[nxt.X] && nxt.X != dad)
			diam1(nxt.X, node, l + nxt.Y);
	}
}

void diam2(int node, int dad, int l){
	if (l > d)
		d = l;
	bio[node] = 1;
	FORA(nxt, e[node]){
		if (!bio[nxt.X] && nxt.X != dad)
			diam2(nxt.X, node, l + nxt.Y);
	}
}

void max_lanac(int node, int dad){
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		max_lanac(nxt.X, node);
		dp[node] = max(dp[node], dp[nxt.X] + nxt.Y);
	}
}

int calc(int node, int dad, int up){
	multiset <int> ms;
	ms.INS(up);
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		ms.INS(dp[nxt.X] + nxt.Y);
	}
	int ret = INF;
	FORA(nxt, e[node]){
		if (nxt.X == dad)
			continue;
		ms.erase(ms.find(dp[nxt.X] + nxt.Y));
		ret = min(ret, calc(nxt.X, node, *ms.rbegin() + nxt.Y));
		ms.INS(dp[nxt.X] + nxt.Y);
	}
	ms.clear();

	rj[node] = max(dp[node], up);
	ret = min(ret, rj[node]);
	return ret;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]){
	REP(i, M){
		e[A[i]].PB({B[i], T[i]});
		e[B[i]].PB({A[i], T[i]});
	}

	int sol = 0;

	REP(i, N){
		if (bio[i])
			continue;
		bst = -1, d = -1;
		diam1(i, -1, 0);
		FORA(el, comp[idx])
			bio[el] = 0;
		diam2(bst, -1, 0);
		sol = max(sol, d);
		idx++;
	}

	vi ans;
	REP(i, idx){
		max_lanac(comp[i][0], -1);
		ans.PB(calc(comp[i][0], -1, 0));
	}

	sort(all(ans));
	reverse(all(ans));
	sol = max(sol, ans[0] + ans[1] + L);
	if (sz(ans) > 2){
		sol = max(sol, ans[0] + ans[2] + 2 * L);
	}
	return sol;
}

void local(){
	int n, m, l; cin >> n >> m >> l;
	REP(i, m)
		cin >> a[i] >> b[i] >> t[i];
	cout << travelTime(n, m, l, a, b, t) << '\n';
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 21064 KB Output is correct
2 Correct 62 ms 20328 KB Output is correct
3 Correct 44 ms 19484 KB Output is correct
4 Correct 10 ms 7328 KB Output is correct
5 Correct 11 ms 6204 KB Output is correct
6 Correct 22 ms 8516 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 38 ms 11508 KB Output is correct
9 Correct 44 ms 16328 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 58 ms 16140 KB Output is correct
12 Correct 72 ms 18592 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5036 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 2 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5036 KB Output is correct
23 Correct 4 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 21064 KB Output is correct
2 Correct 62 ms 20328 KB Output is correct
3 Correct 44 ms 19484 KB Output is correct
4 Correct 10 ms 7328 KB Output is correct
5 Correct 11 ms 6204 KB Output is correct
6 Correct 22 ms 8516 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 38 ms 11508 KB Output is correct
9 Correct 44 ms 16328 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 58 ms 16140 KB Output is correct
12 Correct 72 ms 18592 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5036 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 2 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 2 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 2 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 3 ms 4940 KB Output is correct
30 Correct 4 ms 4940 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 3 ms 5036 KB Output is correct
36 Correct 4 ms 4940 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 77 ms 21060 KB Output is correct
40 Correct 87 ms 20288 KB Output is correct
41 Correct 44 ms 19520 KB Output is correct
42 Correct 10 ms 7348 KB Output is correct
43 Correct 3 ms 4940 KB Output is correct
44 Correct 3 ms 4940 KB Output is correct
45 Correct 2 ms 4940 KB Output is correct
46 Correct 3 ms 4940 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 3 ms 4940 KB Output is correct
49 Correct 3 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 2 ms 4940 KB Output is correct
53 Correct 3 ms 4928 KB Output is correct
54 Correct 3 ms 4940 KB Output is correct
55 Correct 3 ms 4940 KB Output is correct
56 Correct 3 ms 4940 KB Output is correct
57 Correct 92 ms 11456 KB Output is correct
58 Correct 78 ms 11608 KB Output is correct
59 Correct 78 ms 11564 KB Output is correct
60 Correct 104 ms 11716 KB Output is correct
61 Correct 84 ms 11380 KB Output is correct
62 Correct 80 ms 11304 KB Output is correct
63 Correct 81 ms 11128 KB Output is correct
64 Correct 88 ms 11132 KB Output is correct
65 Correct 88 ms 11140 KB Output is correct
66 Correct 90 ms 11200 KB Output is correct
67 Correct 88 ms 11584 KB Output is correct
68 Correct 82 ms 11600 KB Output is correct
69 Correct 85 ms 11616 KB Output is correct
70 Correct 82 ms 11536 KB Output is correct
71 Correct 3 ms 4940 KB Output is correct
72 Correct 5 ms 5196 KB Output is correct
73 Correct 5 ms 5196 KB Output is correct
74 Correct 4 ms 5196 KB Output is correct
75 Correct 5 ms 5196 KB Output is correct
76 Correct 5 ms 5196 KB Output is correct
77 Correct 4 ms 5196 KB Output is correct
78 Correct 5 ms 5196 KB Output is correct
79 Correct 5 ms 5144 KB Output is correct
80 Correct 82 ms 11452 KB Output is correct
81 Correct 84 ms 11560 KB Output is correct
82 Correct 85 ms 11328 KB Output is correct
83 Correct 92 ms 11392 KB Output is correct
84 Correct 5 ms 5196 KB Output is correct
85 Correct 4 ms 5184 KB Output is correct
86 Correct 4 ms 5216 KB Output is correct
87 Correct 4 ms 5196 KB Output is correct
88 Correct 4 ms 5196 KB Output is correct
89 Correct 4 ms 5140 KB Output is correct
90 Correct 5 ms 5196 KB Output is correct
91 Correct 4 ms 5196 KB Output is correct
92 Correct 4 ms 5196 KB Output is correct
93 Correct 4 ms 5196 KB Output is correct
94 Correct 3 ms 4940 KB Output is correct
95 Correct 3 ms 4940 KB Output is correct
96 Correct 3 ms 5024 KB Output is correct
97 Correct 3 ms 4940 KB Output is correct
98 Correct 2 ms 4940 KB Output is correct
99 Correct 3 ms 4940 KB Output is correct
100 Correct 3 ms 4940 KB Output is correct
101 Correct 3 ms 4940 KB Output is correct
102 Correct 3 ms 4940 KB Output is correct
103 Correct 3 ms 4940 KB Output is correct
104 Correct 9 ms 6092 KB Output is correct
105 Correct 17 ms 8532 KB Output is correct
106 Correct 3 ms 5068 KB Output is correct
107 Correct 30 ms 11428 KB Output is correct
108 Correct 43 ms 16308 KB Output is correct
109 Correct 3 ms 5068 KB Output is correct
110 Correct 61 ms 16056 KB Output is correct
111 Correct 78 ms 18624 KB Output is correct
112 Correct 3 ms 5068 KB Output is correct
113 Correct 113 ms 32092 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 10412 KB Output is correct
2 Incorrect 36 ms 10412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5036 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 2 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5036 KB Output is correct
23 Correct 4 ms 4940 KB Output is correct
24 Correct 3 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 5 ms 5068 KB Output is correct
27 Correct 4 ms 5068 KB Output is correct
28 Correct 4 ms 5196 KB Output is correct
29 Correct 4 ms 5068 KB Output is correct
30 Correct 6 ms 5068 KB Output is correct
31 Correct 5 ms 5196 KB Output is correct
32 Incorrect 3 ms 5068 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 21064 KB Output is correct
2 Correct 62 ms 20328 KB Output is correct
3 Correct 44 ms 19484 KB Output is correct
4 Correct 10 ms 7328 KB Output is correct
5 Correct 11 ms 6204 KB Output is correct
6 Correct 22 ms 8516 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 38 ms 11508 KB Output is correct
9 Correct 44 ms 16328 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 58 ms 16140 KB Output is correct
12 Correct 72 ms 18592 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5036 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 2 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 2 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 4940 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 2 ms 4940 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 3 ms 4940 KB Output is correct
30 Correct 4 ms 4940 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 3 ms 5036 KB Output is correct
36 Correct 4 ms 4940 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 77 ms 21060 KB Output is correct
40 Correct 87 ms 20288 KB Output is correct
41 Correct 44 ms 19520 KB Output is correct
42 Correct 10 ms 7348 KB Output is correct
43 Correct 3 ms 4940 KB Output is correct
44 Correct 3 ms 4940 KB Output is correct
45 Correct 2 ms 4940 KB Output is correct
46 Correct 3 ms 4940 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 3 ms 4940 KB Output is correct
49 Correct 3 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 2 ms 4940 KB Output is correct
53 Correct 3 ms 4928 KB Output is correct
54 Correct 3 ms 4940 KB Output is correct
55 Correct 3 ms 4940 KB Output is correct
56 Correct 3 ms 4940 KB Output is correct
57 Correct 92 ms 11456 KB Output is correct
58 Correct 78 ms 11608 KB Output is correct
59 Correct 78 ms 11564 KB Output is correct
60 Correct 104 ms 11716 KB Output is correct
61 Correct 84 ms 11380 KB Output is correct
62 Correct 80 ms 11304 KB Output is correct
63 Correct 81 ms 11128 KB Output is correct
64 Correct 88 ms 11132 KB Output is correct
65 Correct 88 ms 11140 KB Output is correct
66 Correct 90 ms 11200 KB Output is correct
67 Correct 88 ms 11584 KB Output is correct
68 Correct 82 ms 11600 KB Output is correct
69 Correct 85 ms 11616 KB Output is correct
70 Correct 82 ms 11536 KB Output is correct
71 Correct 3 ms 4940 KB Output is correct
72 Correct 5 ms 5196 KB Output is correct
73 Correct 5 ms 5196 KB Output is correct
74 Correct 4 ms 5196 KB Output is correct
75 Correct 5 ms 5196 KB Output is correct
76 Correct 5 ms 5196 KB Output is correct
77 Correct 4 ms 5196 KB Output is correct
78 Correct 5 ms 5196 KB Output is correct
79 Correct 5 ms 5144 KB Output is correct
80 Correct 82 ms 11452 KB Output is correct
81 Correct 84 ms 11560 KB Output is correct
82 Correct 85 ms 11328 KB Output is correct
83 Correct 92 ms 11392 KB Output is correct
84 Correct 5 ms 5196 KB Output is correct
85 Correct 4 ms 5184 KB Output is correct
86 Correct 4 ms 5216 KB Output is correct
87 Correct 4 ms 5196 KB Output is correct
88 Correct 4 ms 5196 KB Output is correct
89 Correct 4 ms 5140 KB Output is correct
90 Correct 5 ms 5196 KB Output is correct
91 Correct 4 ms 5196 KB Output is correct
92 Correct 4 ms 5196 KB Output is correct
93 Correct 4 ms 5196 KB Output is correct
94 Correct 3 ms 4940 KB Output is correct
95 Correct 3 ms 4940 KB Output is correct
96 Correct 3 ms 5024 KB Output is correct
97 Correct 3 ms 4940 KB Output is correct
98 Correct 2 ms 4940 KB Output is correct
99 Correct 3 ms 4940 KB Output is correct
100 Correct 3 ms 4940 KB Output is correct
101 Correct 3 ms 4940 KB Output is correct
102 Correct 3 ms 4940 KB Output is correct
103 Correct 3 ms 4940 KB Output is correct
104 Correct 9 ms 6092 KB Output is correct
105 Correct 17 ms 8532 KB Output is correct
106 Correct 3 ms 5068 KB Output is correct
107 Correct 30 ms 11428 KB Output is correct
108 Correct 43 ms 16308 KB Output is correct
109 Correct 3 ms 5068 KB Output is correct
110 Correct 61 ms 16056 KB Output is correct
111 Correct 78 ms 18624 KB Output is correct
112 Correct 3 ms 5068 KB Output is correct
113 Correct 113 ms 32092 KB Output is correct
114 Correct 32 ms 10412 KB Output is correct
115 Incorrect 36 ms 10412 KB Output isn't correct
116 Halted 0 ms 0 KB -