Submission #769685

#	Time	Username	Problem	Language	Result	Execution time	Memory
769685		horiiseun	Hotspot (NOI17_hotspot)	C++17	100 / 100	567 ms	1188 KiB

hotspot

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

const double EPS = numeric_limits<double>::epsilon();

int n, m, qr, a, b, ret;
double ans[5005], mx;
vector<int> adj[5005];

void bfs(int st, vector<pair<int, int>> &dst) {
	dst.resize(n, {-1, 0});
	dst[st].f = 0;
	dst[st].s = 1;
	queue<int> q;
	q.push(st);
	while (!q.empty()) {
		int curr = q.front();
		q.pop();
		
		for (int i : adj[curr]) {
			if (dst[i].f == -1) {
				dst[i].f = dst[curr].f + 1;
				dst[i].s += dst[curr].s;
				q.push(i);
			} else if (dst[i].f == dst[curr].f + 1) {
				dst[i].s += dst[curr].s;
			}
		}
	}
}

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}

	cin >> qr;
	while (qr--) {
		cin >> a >> b;
		vector<pair<int, int>> dst1, dst2;
		bfs(a, dst1);
		bfs(b, dst2);
		D(dst1);
		D(dst2);
		for (int i = 0; i < n; i++) {
			if (dst1[i].f + dst2[i].f == dst1[b].f) {
				ans[i] += (double) dst1[i].s * (double) dst2[i].s / (double) dst1[b].s;
			}
		}
	}

	for (int i = 0; i < n; i++) {
		mx = max(mx, ans[i]);
	}
	for (int i = 0; i < n; i++) {
		if (abs(ans[i] - mx) <= EPS) {
			ret = i;
		}
	}

	cout << ret << "\n";

}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 11 / 11
• Subtask 4: 18 / 18
• Subtask 5: 26 / 26
• Subtask 6: 36 / 36