oj.uz

답안 #1107510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107510 2024-11-01T11:12:18 Z thieunguyenhuy 통행료 (IOI18_highway) C++17
100 / 100
 213 ms 39292 KB 
#ifndef hwe
	#include "highway.h"
#endif
 
#include <bits/stdc++.h>
using namespace std;
 
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
 
#define Int __int128
#define fi first
#define se second
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
 
template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
 
template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}
 
const int N = 90000 + 5, M = 130000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
 
const int LIGHT = 0, HEAVY = 1;
 
int asked = 0, dist[2][N], edge[M], ver[N], dep[N];
vii adj[N];
vector<int> ve[N];
map<vector<int>, ll> mem;

#ifdef hwe
namespace Grader {
	int n, m, s, t;
	ll dist[N];
	int trace[N];
	pii edges[N];
	vii adj[N];
	vector<int> w;
 
	void get() {
		cin >> n >> m >> s >> t;
	
		for (int i = 0; i < n; ++i) adj[i].clear();

		for (int i = 0; i < m; ++i) {
			int u, v; cin >> u >> v;
			adj[u].emplace_back(v, i), adj[v].emplace_back(u, i);
			edges[i] = make_pair(u, v);
		}
	}
 
	void rand() {
		n = random(10, 20), m = random(n - 1, 100), s = random(n), t = random(n);
		while (s == t) t = random(n);
		for (int i = 1; i < n; ++i) {
			edges[i - 1] = make_pair(random(i), i);
		}
		for (int i = n - 1; i < m; ++i) {
			edges[i] = make_pair(random(n), random(n));
		}
		for (int i = 0; i < n; ++i) adj[i].clear();
		for (int i = 0; i < m; ++i) {
			int u, v; tie(u, v) = edges[i];
			adj[u].emplace_back(v, i), adj[v].emplace_back(u, i);
		}
	}
 
	void show() {
		cerr << n << ' ' << m << ' ' << s << ' ' << t << '\n';
		for (int i = 0; i < m; ++i) cerr << edges[i].fi << ' ' << edges[i].se << '\n';
	}
 
	ll dijkstra(int s, int t) {
		for (int i = 0; i < n; ++i) dist[i] = INF;
		dist[s] = 0;
		priority_queue<pli, vli, greater<pli>> pq; pq.emplace(0, s);
		while (!pq.empty()) {
			int u = pq.top().se; pq.pop();
			// cerr << "dijkstra " << u << ' ' << dist[u] << '\n';
			for (auto [v, id] : adj[u]) if (minimize(dist[v], dist[u] + w[id])) {
				trace[v] = id;
				pq.emplace(dist[v], v);
			}
		}
		// int ma = -1; for (auto &x : w) maximize(ma, x);
		// if (ma <= 1) cerr << "kq " << dist[t] << '\n';
		return dist[t];
	}

	void Trace() {
		cerr << "trace "; int v = t;
		while (true) {
			cerr << trace[v] << ' ';
			v = edges[trace[v]].fi ^ edges[trace[v]].se ^ v;
			if (v == s) break;
		}
	}
 
	ll ask(const vector<int> &_w) {
		w = _w; for (auto &x : w) ++x;
		return dijkstra(s, t);
	}
}
 
ll ask(const vector<int> &w) {
	return Grader::ask(w);
}
 
void answer(int s, int t) {
	// cerr << "Answer " << s << ' ' << t << '\n';
	pii ans = make_pair(Grader::s, Grader::t);
	if (make_pair(s, t) != ans && make_pair(t, s) != ans) {
		cerr << "Wrong Answer\n";
		exit(0);
	}
}
#endif
 
ll myask(const vector<int> &w) {
	auto it = mem.find(w);
	if (it != mem.end()) return it->se;
	assert(++asked <= 50);
	return mem[w] = ask(w);
}
 
void bfs(const int type, int root) {
	queue<int> q; q.emplace(root); dist[type][root] = 0;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto [v, id] : adj[u]) if (dist[type][v] == -1) {
			dist[type][v] = dist[type][u] + 1;
			q.emplace(v);
		}
	}
}

void print(vector<int> &ve) {
	for (auto &x : ve) cerr << x << ' ';
	cerr << '\n';
}
 
void find_pair(int n, vector<int> U, vector<int> V, int A, int B) {
	int m = U.size(); asked = 0;
	for (int i = 0; i < n; ++i) adj[i].clear();
	for (int i = 0; i < m; ++i) {
		adj[U[i]].emplace_back(V[i], i), adj[V[i]].emplace_back(U[i], i);
	}
 
	vector<int> w(m, LIGHT); mem.clear();
	ll fixed = myask(w);

	int low = 0, high = m - 1, edgeId = -1;
	while (low <= high) {
		int mid = low + high >> 1; vector<int> w(m, LIGHT);
		for (int i = 0; i <= mid; ++i) w[i] = HEAVY;
		if (myask(w) != fixed) high = (edgeId = mid) - 1;
		else low = mid + 1;
	}
	assert(edgeId != -1);
	int u = U[edgeId], v = V[edgeId];

	// cerr << "EdgeId " << edgeId << '\n';
	
	for (int i : {0, 1}) for (int j = 0; j < n; ++j) {
		dist[i][j] = -1;
	}
	bfs(0, u), bfs(1, v);

	auto work = [&](const int type, const int root) {
		queue<int> q; for (int i = 0; i < n; ++i) dep[i] = -1;
		q.emplace(root), dep[root] = 0; int cnt = 0;
		for (int i = 0; i < m; ++i) edge[i] = ver[i] = -1;
		while (!q.empty()) {
			int u = q.front(); q.pop();
			for (auto [v, id] : adj[u]) {
				if (dist[type][v] < dist[!type][v]) {
					if (dep[v] == -1) {
						dep[v] = dep[u] + 1;
						ver[cnt] = v, edge[id] = cnt++;
						q.emplace(v);
					}
					else if (dep[v] == dep[u] + 1) {
						edge[id] = inf;
					}
				}
				else if (id != edgeId) edge[id] = inf;
			}
		}

		auto check = [&](int mid) {
			vector<int> w(m, HEAVY);
			for (int i = 0; i < m; ++i) w[i] = edge[i] >= mid;
			return myask(w) != fixed;
		};

		// for (int i = 0; i < ve.size(); ++i) cerr << check(i);
		// cerr << '\n';
		// for (int i = 0; i < cnt; ++i) cerr << check(i);
		// cerr << '\n';

		int low = 0, high = cnt - 1, id = -1;
		while (low <= high) {
			int mid = low + high >> 1; 
			// if (mid == 1) cerr << "myask = " << myask(w) << '\n';
			// if (type == 0) cerr << mid << ' ' << myask(w) << '\n';
			if (check(mid)) low = (id = mid) + 1;
			else high = mid - 1;
		}
		// cerr << "id = " << id << '\n';
		return (id == -1 ? root : ver[id]);
	};

	int s = work(0, u), t = work(1, v);
	answer(s, t);
}
 
#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
 
    #ifdef hwe
        freopen("input.inp", "r", stdin);
        freopen("output.out", "w", stdout);
    #else
        #define taskname ""
        if (fopen(taskname".inp", "r")) {
            freopen(taskname".inp", "r", stdin);
            freopen(taskname".out", "w", stdout);
        }
    #endif
 
    for (int _ = 0; _ < 1000000; ++_) {
    	if (_ % 10000 == 0) cerr << "Doing " << _ << '\n';
	    Grader::rand(); 
	    // Grader::show();
	    int n = Grader::n; vector<int> U, V;
	    for (int i = 0; i < Grader::m; ++i) {
	    	int u, v; tie(u, v) = Grader::edges[i];
	    	U.emplace_back(u), V.emplace_back(v);
	    }
	    find_pair(n, U, V, 2, 3);    	
    }

    Grader::get(); Grader::show();
    int n = Grader::n; vector<int> U, V;
    for (int i = 0; i < Grader::m; ++i) {
    	int u, v; tie(u, v) = Grader::edges[i];
    	U.emplace_back(u), V.emplace_back(v);
    }
    find_pair(n, U, V, 1, 2);
 
    cerr << '\n'; return 0;
}
#endif

Compilation message

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:200:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  200 |   int mid = low + high >> 1; vector<int> w(m, LIGHT);
      |             ~~~~^~~~~~
highway.cpp: In lambda function:
highway.cpp:249:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  249 |    int mid = low + high >> 1;
      |              ~~~~^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4688 KB Output is correct
2 Correct 2 ms 4688 KB Output is correct
3 Correct 2 ms 4688 KB Output is correct
4 Correct 2 ms 4688 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4688 KB Output is correct
7 Correct 2 ms 4688 KB Output is correct
8 Correct 2 ms 4688 KB Output is correct
9 Correct 2 ms 4688 KB Output is correct
10 Correct 2 ms 4688 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 2 ms 4688 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4688 KB Output is correct
2 Correct 15 ms 6644 KB Output is correct
3 Correct 135 ms 26192 KB Output is correct
4 Correct 123 ms 28656 KB Output is correct
5 Correct 135 ms 26852 KB Output is correct
6 Correct 118 ms 23804 KB Output is correct
7 Correct 132 ms 28480 KB Output is correct
8 Correct 113 ms 28036 KB Output is correct
9 Correct 115 ms 25988 KB Output is correct
10 Correct 133 ms 26616 KB Output is correct
11 Correct 136 ms 28536 KB Output is correct
12 Correct 128 ms 29076 KB Output is correct
13 Correct 120 ms 27716 KB Output is correct
14 Correct 121 ms 27640 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 6736 KB Output is correct
2 Correct 27 ms 9192 KB Output is correct
3 Correct 39 ms 11488 KB Output is correct
4 Correct 121 ms 27876 KB Output is correct
5 Correct 105 ms 28472 KB Output is correct
6 Correct 107 ms 27424 KB Output is correct
7 Correct 122 ms 27024 KB Output is correct
8 Correct 132 ms 28116 KB Output is correct
9 Correct 117 ms 27808 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4688 KB Output is correct
2 Correct 16 ms 7064 KB Output is correct
3 Correct 78 ms 21020 KB Output is correct
4 Correct 112 ms 25272 KB Output is correct
5 Correct 113 ms 25964 KB Output is correct
6 Correct 124 ms 24176 KB Output is correct
7 Correct 115 ms 25088 KB Output is correct
8 Correct 109 ms 24196 KB Output is correct
9 Correct 123 ms 28220 KB Output is correct
10 Correct 133 ms 28804 KB Output is correct
11 Correct 132 ms 27500 KB Output is correct
12 Correct 125 ms 28052 KB Output is correct
13 Correct 121 ms 28180 KB Output is correct
14 Correct 132 ms 28968 KB Output is correct
15 Correct 112 ms 24864 KB Output is correct
16 Correct 112 ms 24076 KB Output is correct
17 Correct 137 ms 27692 KB Output is correct
18 Correct 125 ms 27868 KB Output is correct
19 Correct 108 ms 24912 KB Output is correct
20 Correct 134 ms 28096 KB Output is correct
21 Correct 101 ms 24280 KB Output is correct
22 Correct 117 ms 24584 KB Output is correct
23 Correct 132 ms 29272 KB Output is correct
24 Correct 128 ms 29408 KB Output is correct
25 Correct 126 ms 27852 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7140 KB Output is correct
2 Correct 18 ms 7264 KB Output is correct
3 Correct 129 ms 30244 KB Output is correct
4 Correct 172 ms 33284 KB Output is correct
5 Correct 180 ms 38144 KB Output is correct
6 Correct 186 ms 38964 KB Output is correct
7 Correct 183 ms 39056 KB Output is correct
8 Correct 200 ms 38684 KB Output is correct
9 Correct 155 ms 29416 KB Output is correct
10 Correct 146 ms 29948 KB Output is correct
11 Correct 169 ms 30216 KB Output is correct
12 Correct 213 ms 37936 KB Output is correct
13 Correct 180 ms 39072 KB Output is correct
14 Correct 187 ms 38640 KB Output is correct
15 Correct 173 ms 38212 KB Output is correct
16 Correct 180 ms 36192 KB Output is correct
17 Correct 122 ms 28904 KB Output is correct
18 Correct 125 ms 28912 KB Output is correct
19 Correct 127 ms 28576 KB Output is correct
20 Correct 137 ms 28632 KB Output is correct
21 Correct 177 ms 38924 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 6984 KB Output is correct
2 Correct 15 ms 7260 KB Output is correct
3 Correct 131 ms 31700 KB Output is correct
4 Correct 150 ms 32252 KB Output is correct
5 Correct 149 ms 33916 KB Output is correct
6 Correct 188 ms 38196 KB Output is correct
7 Correct 124 ms 26468 KB Output is correct
8 Correct 171 ms 31684 KB Output is correct
9 Correct 168 ms 34044 KB Output is correct
10 Correct 185 ms 39128 KB Output is correct
11 Correct 190 ms 39132 KB Output is correct
12 Correct 188 ms 38820 KB Output is correct
13 Correct 156 ms 30700 KB Output is correct
14 Correct 151 ms 30544 KB Output is correct
15 Correct 142 ms 30368 KB Output is correct
16 Correct 137 ms 29992 KB Output is correct
17 Correct 160 ms 30704 KB Output is correct
18 Correct 157 ms 30636 KB Output is correct
19 Correct 182 ms 37428 KB Output is correct
20 Correct 174 ms 38052 KB Output is correct
21 Correct 180 ms 38896 KB Output is correct
22 Correct 198 ms 39292 KB Output is correct
23 Correct 177 ms 38784 KB Output is correct
24 Correct 207 ms 38856 KB Output is correct
25 Correct 182 ms 38864 KB Output is correct
26 Correct 183 ms 38660 KB Output is correct
27 Correct 141 ms 28780 KB Output is correct
28 Correct 140 ms 28960 KB Output is correct
29 Correct 105 ms 24872 KB Output is correct
30 Correct 106 ms 24932 KB Output is correct
31 Correct 128 ms 28796 KB Output is correct
32 Correct 122 ms 28672 KB Output is correct
33 Correct 127 ms 29284 KB Output is correct
34 Correct 150 ms 29616 KB Output is correct
35 Correct 128 ms 28700 KB Output is correct
36 Correct 123 ms 29064 KB Output is correct
37 Correct 131 ms 28828 KB Output is correct
38 Correct 134 ms 25012 KB Output is correct
39 Correct 190 ms 39264 KB Output is correct
40 Correct 180 ms 38912 KB Output is correct
41 Correct 166 ms 34632 KB Output is correct
42 Correct 183 ms 39248 KB Output is correct