oj.uz

Submission #965909

# Submission time Handle Problem Language Result Execution time Memory
965909 2024-04-19T07:50:53 Z Gromp15 Swapping Cities (APIO20_swap) C++17
13 / 100
 137 ms 31084 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define db double
#define ll long long
#define ar array
template<typename T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

struct dsu {
	vector<vector<int>> adj;
	vector<int> deg, p, sub, tin, tout;
	vector<bool> mark;
	int who;
	dsu() {}
	dsu(int n, int m) : adj(n + m), deg(n), p(n + m), who(n), sub(n + m), tin(n + m), tout(n + m), mark(n + m) {
		iota(all(p), 0);
	}
	int get(int v) {
		return v == p[v] ? v : p[v] = get(p[v]);
	}
	void add(int x, int y) {
		int ox = x, oy = y;
		x = get(x), y = get(y);
		p[x] = who, p[y] = who;
		if (deg[ox] == 0) sub[who] += -1;
		else if (deg[ox] == 1) sub[who] += 1;
		if (deg[oy] == 0) sub[who] += -1;
		else if (deg[oy] == 1) sub[who] += 1;
		deg[ox]++, deg[oy]++;
		if (deg[ox] > 2 || deg[oy] > 2) mark[who] = 1;
		adj[who].emplace_back(x);
		if (x != y) adj[who].emplace_back(y);
		who++;
	}
	void process(int sx) {
		int timer = 0;
		auto dfs = [&](auto&& s, int v, int p) -> void {
			tin[v] = timer++;
			for (int u : adj[v]) if (u != p) {
				s(s, u, v);
				sub[v] += sub[u];
				mark[v] = mark[v] || mark[u];
			}
			tout[v] = timer - 1;
		};
		dfs(dfs, sx, -1);
	}
	bool anc(int x, int y) {
		return tin[x] <= tin[y] && tout[y] <= tout[x];
	}
};
const int INF = 1e9;
vector<vector<ar<int, 3>>> adj;
vector<int> weights;
int n, m;
dsu d;

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N, m = M;
	adj.resize(N + 1);
	d = dsu(n, m);
	for (int i = 0; i < M; i++) {
		adj[U[i]].push_back({V[i], W[i], i});
		adj[V[i]].push_back({U[i], W[i], i});
	}
	vector<int> idx(M);
	iota(all(idx), 0);
	sort(all(idx), [&](int x, int y) { return W[x] < W[y]; });
	for (int i = 0; i < M; i++) {
		d.add(U[idx[i]], V[idx[i]]);
	}
	d.process(n + m - 1);
	weights.resize(m);
	for (int i = 0; i < m; i++) {
		weights[i] = W[idx[i]];
	}
}

int getMinimumFuelCapacity(int X, int Y) {
	auto good = [&](int mid) -> bool {
		return d.anc(mid + n, X) && d.anc(mid + n, Y) && (d.mark[mid + n] || d.sub[mid + n] == 0);
	};
	int l = 0, r = m - 1, ans = m - 1;
	if (!good(r)) return -1;
	while (l <= r) {
		int mid = (l+r)/2;
		if (good(mid)) ans = mid, r = mid-1;
		else l = mid+1;
	}
	return weights[ans];
}

Compilation message

swap.cpp: In constructor 'dsu::dsu(int, int)':
swap.cpp:16:6: warning: 'dsu::who' will be initialized after [-Wreorder]
   16 |  int who;
      |      ^~~
swap.cpp:14:22: warning:   'std::vector<int> dsu::sub' [-Wreorder]
   14 |  vector<int> deg, p, sub, tin, tout;
      |                      ^~~
swap.cpp:18:2: warning:   when initialized here [-Wreorder]
   18 |  dsu(int n, int m) : adj(n + m), deg(n), p(n + m), who(n), sub(n + m), tin(n + m), tout(n + m), mark(n + m) {
      |  ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 52 ms 15956 KB Output is correct
10 Correct 70 ms 19720 KB Output is correct
11 Correct 67 ms 19176 KB Output is correct
12 Correct 70 ms 20308 KB Output is correct
13 Correct 73 ms 23564 KB Output is correct
14 Correct 56 ms 16212 KB Output is correct
15 Correct 104 ms 21328 KB Output is correct
16 Correct 107 ms 20624 KB Output is correct
17 Correct 109 ms 21840 KB Output is correct
18 Correct 105 ms 25168 KB Output is correct
19 Correct 49 ms 7000 KB Output is correct
20 Correct 119 ms 22352 KB Output is correct
21 Correct 115 ms 21924 KB Output is correct
22 Correct 137 ms 23360 KB Output is correct
23 Correct 115 ms 26420 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 123 ms 29756 KB Output is correct
4 Correct 126 ms 31084 KB Output is correct
5 Correct 129 ms 30300 KB Output is correct
6 Correct 131 ms 30828 KB Output is correct
7 Correct 126 ms 30852 KB Output is correct
8 Correct 122 ms 29532 KB Output is correct
9 Correct 124 ms 30500 KB Output is correct
10 Correct 129 ms 29452 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Incorrect 1 ms 604 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 52 ms 15956 KB Output is correct
11 Correct 70 ms 19720 KB Output is correct
12 Correct 67 ms 19176 KB Output is correct
13 Correct 70 ms 20308 KB Output is correct
14 Correct 73 ms 23564 KB Output is correct
15 Incorrect 1 ms 604 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 52 ms 15956 KB Output is correct
10 Correct 70 ms 19720 KB Output is correct
11 Correct 67 ms 19176 KB Output is correct
12 Correct 70 ms 20308 KB Output is correct
13 Correct 73 ms 23564 KB Output is correct
14 Correct 56 ms 16212 KB Output is correct
15 Correct 104 ms 21328 KB Output is correct
16 Correct 107 ms 20624 KB Output is correct
17 Correct 109 ms 21840 KB Output is correct
18 Correct 105 ms 25168 KB Output is correct
19 Correct 123 ms 29756 KB Output is correct
20 Correct 126 ms 31084 KB Output is correct
21 Correct 129 ms 30300 KB Output is correct
22 Correct 131 ms 30828 KB Output is correct
23 Correct 126 ms 30852 KB Output is correct
24 Correct 122 ms 29532 KB Output is correct
25 Correct 124 ms 30500 KB Output is correct
26 Correct 129 ms 29452 KB Output is correct
27 Incorrect 1 ms 604 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 52 ms 15956 KB Output is correct
11 Correct 70 ms 19720 KB Output is correct
12 Correct 67 ms 19176 KB Output is correct
13 Correct 70 ms 20308 KB Output is correct
14 Correct 73 ms 23564 KB Output is correct
15 Correct 56 ms 16212 KB Output is correct
16 Correct 104 ms 21328 KB Output is correct
17 Correct 107 ms 20624 KB Output is correct
18 Correct 109 ms 21840 KB Output is correct
19 Correct 105 ms 25168 KB Output is correct
20 Correct 123 ms 29756 KB Output is correct
21 Correct 126 ms 31084 KB Output is correct
22 Correct 129 ms 30300 KB Output is correct
23 Correct 131 ms 30828 KB Output is correct
24 Correct 126 ms 30852 KB Output is correct
25 Correct 122 ms 29532 KB Output is correct
26 Correct 124 ms 30500 KB Output is correct
27 Correct 129 ms 29452 KB Output is correct
28 Incorrect 1 ms 604 KB Output isn't correct
29 Halted 0 ms 0 KB -