oj.uz

답안 #768153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768153 2023-06-27T15:23:37 Z marvinthang Two Transportations (JOI19_transportations) C++17
100 / 100
 650 ms 48772 KB 
/*************************************
*    author: marvinthang             *
*    created: 27.06.2023 19:27:42    *
*************************************/

#include "Azer.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
		#include "debug.h"
#else
		#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
		#define DB(...) 23
		#define db(...) 23
		#define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

namespace {

	const int INF = MASK(20) - 1;

	int N, cnt, pu, last, pv, pdv;
	vector <bool> used;
	vector <int> dist;
	vector <vector <pair <int, int>>> adj;

	int find_min(void) {
		int u = -1;
		REP(i, N) if (!used[i] && (u == -1 || dist[i] < dist[u])) u = i;
		return u;
	}

	void dijkstra(int u) {
		used[u] = true;
		last = dist[u];
		for (auto [w, v]: adj[u]) minimize(dist[v], dist[u] + w);
	}

	void send_min(void) {
		int u = find_min();
		if (u == -1) return;
		pu = u;
		int x = min(dist[u] - last, 501);
		REP(i, 9) SendA(BIT(x, i));
	}

}  // namespace


void InitA(int N, int A, vector <int> U, vector <int> V, vector <int> C) {
	::N = N;
	cnt = pv = pdv = 0;
	used.resize(N);
	dist.assign(N, INF);
	adj.resize(N);
	REP(i, A) {
		adj[U[i]].emplace_back(C[i], V[i]);
		adj[V[i]].emplace_back(C[i], U[i]);
	}
	dist[0] = 0;
	dijkstra(0);
	send_min();
}

void ReceiveA(bool x) {
	if (cnt < 9) {
		if (x) pdv |= MASK(cnt);
		if (++cnt == 9) {
			pdv += last;
			if (dist[pu] <= pdv) {
				REP(i, 11) SendA(BIT(pu, i));
				dijkstra(pu);
				send_min();
				cnt = 0;
				pdv = 0;
			} else pv = 0;
		}
	} else {
		if (x) pv |= MASK(cnt - 9);
		if (++cnt == 20) {
			minimize(dist[pv], pdv);
			dijkstra(pv);
			send_min();
			cnt = 0;
			pdv = 0;
		}
	}
}

vector <int> Answer() {
	return dist;
}

/*************************************
*    author: marvinthang             *
*    created: 27.06.2023 19:28:31    *
*************************************/

#include "Baijan.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

namespace {

	const int INF = MASK(20) - 1;

	int N, cnt, pu, last, pv, pdv;
	vector <bool> used;
	vector <int> dist;
	vector <vector <pair <int, int>>> adj;

	int find_min(void) {
		int u = -1;
		REP(i, N) if (!used[i] && (u == -1 || dist[i] < dist[u])) u = i;
		return u;
	}

	void dijkstra(int u) {
		used[u] = true;
		last = dist[u];
		for (auto [w, v]: adj[u]) minimize(dist[v], dist[u] + w);
	}

	void send_min(void) {
		int u = find_min();
		if (u == -1) return;
		pu = u;
		int x = min(dist[u] - last, 501);
		REP(i, 9) SendB(BIT(x, i));
	}

}  // namespace

void InitB(int N, int B, vector <int> S, vector <int> T, vector <int> D) {
	::N = N;
	cnt = pv = pdv = 0;
	used.resize(N);
	dist.assign(N, INF);
	adj.resize(N);
	REP(i, B) {
		adj[S[i]].emplace_back(D[i], T[i]);
		adj[T[i]].emplace_back(D[i], S[i]);
	}
	dist[0] = 0;
	dijkstra(0);
	send_min();
}

void ReceiveB(bool x) {
	if (cnt < 9) {
		if (x) pdv |= MASK(cnt);
		if (++cnt == 9) {
			pdv += last;
			if (dist[pu] < pdv) {
				REP(i, 11) SendB(BIT(pu, i));
				dijkstra(pu);
				send_min();
				cnt = 0;
				pdv = 0;
			} else pv = 0;
		}
	} else {
		if (x) pv |= MASK(cnt - 9);
		if (++cnt == 20) {
			minimize(dist[pv], pdv);
			dijkstra(pv);
			send_min();
			cnt = 0;
			pdv = 0;
		}
	}
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 792 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 472 ms 788 KB Output is correct
4 Correct 464 ms 10196 KB Output is correct
5 Correct 24 ms 656 KB Output is correct
6 Correct 471 ms 2200 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 400 KB Output is correct
2 Correct 469 ms 740 KB Output is correct
3 Correct 351 ms 796 KB Output is correct
4 Correct 645 ms 27496 KB Output is correct
5 Correct 418 ms 24152 KB Output is correct
6 Correct 79 ms 528 KB Output is correct
7 Correct 515 ms 24092 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 728 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 371 ms 656 KB Output is correct
4 Correct 461 ms 748 KB Output is correct
5 Correct 399 ms 752 KB Output is correct
6 Correct 441 ms 724 KB Output is correct
7 Correct 461 ms 744 KB Output is correct
8 Correct 471 ms 664 KB Output is correct
9 Correct 436 ms 788 KB Output is correct
10 Correct 281 ms 788 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 656 KB Output is correct
2 Correct 188 ms 648 KB Output is correct
3 Correct 296 ms 13332 KB Output is correct
4 Correct 176 ms 656 KB Output is correct
5 Correct 223 ms 10000 KB Output is correct
6 Correct 208 ms 656 KB Output is correct
7 Correct 184 ms 656 KB Output is correct
8 Correct 222 ms 656 KB Output is correct
9 Correct 307 ms 18208 KB Output is correct
10 Correct 280 ms 18100 KB Output is correct
11 Correct 394 ms 35392 KB Output is correct
12 Correct 308 ms 30772 KB Output is correct
13 Correct 213 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 656 KB Output is correct
2 Correct 188 ms 648 KB Output is correct
3 Correct 296 ms 13332 KB Output is correct
4 Correct 176 ms 656 KB Output is correct
5 Correct 223 ms 10000 KB Output is correct
6 Correct 208 ms 656 KB Output is correct
7 Correct 184 ms 656 KB Output is correct
8 Correct 222 ms 656 KB Output is correct
9 Correct 307 ms 18208 KB Output is correct
10 Correct 280 ms 18100 KB Output is correct
11 Correct 394 ms 35392 KB Output is correct
12 Correct 308 ms 30772 KB Output is correct
13 Correct 213 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 215 ms 672 KB Output is correct
16 Correct 208 ms 528 KB Output is correct
17 Correct 218 ms 528 KB Output is correct
18 Correct 277 ms 10048 KB Output is correct
19 Correct 276 ms 696 KB Output is correct
20 Correct 287 ms 10224 KB Output is correct
21 Correct 270 ms 696 KB Output is correct
22 Correct 249 ms 656 KB Output is correct
23 Correct 402 ms 22048 KB Output is correct
24 Correct 319 ms 22084 KB Output is correct
25 Correct 432 ms 43640 KB Output is correct
26 Correct 429 ms 36380 KB Output is correct
27 Correct 249 ms 656 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 656 KB Output is correct
2 Correct 188 ms 648 KB Output is correct
3 Correct 296 ms 13332 KB Output is correct
4 Correct 176 ms 656 KB Output is correct
5 Correct 223 ms 10000 KB Output is correct
6 Correct 208 ms 656 KB Output is correct
7 Correct 184 ms 656 KB Output is correct
8 Correct 222 ms 656 KB Output is correct
9 Correct 307 ms 18208 KB Output is correct
10 Correct 280 ms 18100 KB Output is correct
11 Correct 394 ms 35392 KB Output is correct
12 Correct 308 ms 30772 KB Output is correct
13 Correct 213 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 215 ms 672 KB Output is correct
16 Correct 208 ms 528 KB Output is correct
17 Correct 218 ms 528 KB Output is correct
18 Correct 277 ms 10048 KB Output is correct
19 Correct 276 ms 696 KB Output is correct
20 Correct 287 ms 10224 KB Output is correct
21 Correct 270 ms 696 KB Output is correct
22 Correct 249 ms 656 KB Output is correct
23 Correct 402 ms 22048 KB Output is correct
24 Correct 319 ms 22084 KB Output is correct
25 Correct 432 ms 43640 KB Output is correct
26 Correct 429 ms 36380 KB Output is correct
27 Correct 249 ms 656 KB Output is correct
28 Correct 215 ms 692 KB Output is correct
29 Correct 203 ms 656 KB Output is correct
30 Correct 325 ms 23968 KB Output is correct
31 Correct 278 ms 656 KB Output is correct
32 Correct 403 ms 20992 KB Output is correct
33 Correct 246 ms 724 KB Output is correct
34 Correct 318 ms 748 KB Output is correct
35 Correct 280 ms 748 KB Output is correct
36 Correct 434 ms 24592 KB Output is correct
37 Correct 394 ms 24652 KB Output is correct
38 Correct 567 ms 48772 KB Output is correct
39 Correct 499 ms 44028 KB Output is correct
40 Correct 290 ms 912 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 792 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 472 ms 788 KB Output is correct
4 Correct 464 ms 10196 KB Output is correct
5 Correct 24 ms 656 KB Output is correct
6 Correct 471 ms 2200 KB Output is correct
7 Correct 1 ms 400 KB Output is correct
8 Correct 469 ms 740 KB Output is correct
9 Correct 351 ms 796 KB Output is correct
10 Correct 645 ms 27496 KB Output is correct
11 Correct 418 ms 24152 KB Output is correct
12 Correct 79 ms 528 KB Output is correct
13 Correct 515 ms 24092 KB Output is correct
14 Correct 410 ms 728 KB Output is correct
15 Correct 2 ms 400 KB Output is correct
16 Correct 371 ms 656 KB Output is correct
17 Correct 461 ms 748 KB Output is correct
18 Correct 399 ms 752 KB Output is correct
19 Correct 441 ms 724 KB Output is correct
20 Correct 461 ms 744 KB Output is correct
21 Correct 471 ms 664 KB Output is correct
22 Correct 436 ms 788 KB Output is correct
23 Correct 281 ms 788 KB Output is correct
24 Correct 183 ms 656 KB Output is correct
25 Correct 188 ms 648 KB Output is correct
26 Correct 296 ms 13332 KB Output is correct
27 Correct 176 ms 656 KB Output is correct
28 Correct 223 ms 10000 KB Output is correct
29 Correct 208 ms 656 KB Output is correct
30 Correct 184 ms 656 KB Output is correct
31 Correct 222 ms 656 KB Output is correct
32 Correct 307 ms 18208 KB Output is correct
33 Correct 280 ms 18100 KB Output is correct
34 Correct 394 ms 35392 KB Output is correct
35 Correct 308 ms 30772 KB Output is correct
36 Correct 213 ms 656 KB Output is correct
37 Correct 0 ms 400 KB Output is correct
38 Correct 215 ms 672 KB Output is correct
39 Correct 208 ms 528 KB Output is correct
40 Correct 218 ms 528 KB Output is correct
41 Correct 277 ms 10048 KB Output is correct
42 Correct 276 ms 696 KB Output is correct
43 Correct 287 ms 10224 KB Output is correct
44 Correct 270 ms 696 KB Output is correct
45 Correct 249 ms 656 KB Output is correct
46 Correct 402 ms 22048 KB Output is correct
47 Correct 319 ms 22084 KB Output is correct
48 Correct 432 ms 43640 KB Output is correct
49 Correct 429 ms 36380 KB Output is correct
50 Correct 249 ms 656 KB Output is correct
51 Correct 215 ms 692 KB Output is correct
52 Correct 203 ms 656 KB Output is correct
53 Correct 325 ms 23968 KB Output is correct
54 Correct 278 ms 656 KB Output is correct
55 Correct 403 ms 20992 KB Output is correct
56 Correct 246 ms 724 KB Output is correct
57 Correct 318 ms 748 KB Output is correct
58 Correct 280 ms 748 KB Output is correct
59 Correct 434 ms 24592 KB Output is correct
60 Correct 394 ms 24652 KB Output is correct
61 Correct 567 ms 48772 KB Output is correct
62 Correct 499 ms 44028 KB Output is correct
63 Correct 290 ms 912 KB Output is correct
64 Correct 478 ms 968 KB Output is correct
65 Correct 605 ms 26572 KB Output is correct
66 Correct 526 ms 23344 KB Output is correct
67 Correct 374 ms 844 KB Output is correct
68 Correct 450 ms 936 KB Output is correct
69 Correct 509 ms 47652 KB Output is correct
70 Correct 650 ms 39380 KB Output is correct
71 Correct 360 ms 4956 KB Output is correct
72 Correct 457 ms 1168 KB Output is correct