#607515 (C++17) No.1365 [Cherry 1st Tune] Whose Fault?

提出ソース

結果

問題	No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー	iaNTU
提出日時	2021-01-20 03:23:05
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	324 ms / 2,000 ms
コード長	5,093 bytes
コンパイル時間	2,829 ms
コンパイル使用メモリ	216,768 KB
実行使用メモリ	12,632 KB
最終ジャッジ日時	2024-06-09 06:49:17
合計ジャッジ時間	24,302 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4 ms 11,852 KB
testcase_01	AC	4 ms 11,860 KB
testcase_02	AC	4 ms 11,852 KB
testcase_03	AC	4 ms 11,860 KB
testcase_04	AC	4 ms 11,856 KB
testcase_05	AC	4 ms 11,860 KB
testcase_06	AC	4 ms 11,980 KB
testcase_07	AC	4 ms 11,852 KB
testcase_08	AC	3 ms 11,856 KB
testcase_09	AC	4 ms 11,984 KB
testcase_10	AC	4 ms 11,852 KB
testcase_11	AC	4 ms 11,988 KB
testcase_12	AC	4 ms 11,736 KB
testcase_13	AC	32 ms 11,916 KB
testcase_14	AC	23 ms 11,920 KB
testcase_15	AC	8 ms 11,920 KB
testcase_16	AC	5 ms 11,916 KB
testcase_17	AC	19 ms 11,940 KB
testcase_18	AC	11 ms 11,920 KB
testcase_19	AC	31 ms 11,956 KB
testcase_20	AC	17 ms 12,048 KB
testcase_21	AC	28 ms 12,076 KB
testcase_22	AC	24 ms 11,980 KB
testcase_23	AC	59 ms 11,916 KB
testcase_24	AC	135 ms 12,412 KB
testcase_25	AC	268 ms 11,000 KB
testcase_26	AC	186 ms 12,156 KB
testcase_27	AC	229 ms 12,048 KB
testcase_28	AC	91 ms 12,028 KB
testcase_29	AC	75 ms 11,904 KB
testcase_30	AC	324 ms 11,920 KB
testcase_31	AC	289 ms 12,044 KB
testcase_32	AC	165 ms 12,632 KB
testcase_33	AC	263 ms 12,172 KB
testcase_34	AC	204 ms 12,048 KB
testcase_35	AC	116 ms 12,176 KB
testcase_36	AC	240 ms 12,176 KB
testcase_37	AC	51 ms 12,048 KB
testcase_38	AC	58 ms 12,044 KB
testcase_39	AC	310 ms 12,044 KB
testcase_40	AC	301 ms 12,172 KB
testcase_41	AC	231 ms 12,276 KB
testcase_42	AC	207 ms 12,044 KB
testcase_43	AC	3 ms 11,856 KB
testcase_44	AC	51 ms 11,912 KB
testcase_45	AC	87 ms 12,048 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// Exported by Exporter.exe

// Included from B.cpp
// Compile flags -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -DDEBUG -ggdb3 -fmax-errors=2
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define MTP make_tuple
typedef long long int ll;

constexpr int kN = int(2E5 + 10);
// constexpr int kMod = 998244353;
// constexpr int kInf = 0x3f3f3f3f
// constexpr ll kInf = 0x3f3f3f3f3f3f3f3f;

template <typename T> T ABS(T n) {return n >= 0 ? n : -n;}


// Included from C:\Users\ianli\Desktop\CP\template\Various\Fast_IO.cpp
static inline char Get_Raw_Char() {
	static char buf[1 << 16], *p = buf, *end = buf;
	if (p == end) {
		if ((end = buf + fread(buf, 1, 1 << 16, stdin)) == buf) return '\0';
		p = buf;
	}
	return *p++;
}

static inline int Get_Digit() {
	char c = Get_Raw_Char();
	while (!isdigit(c)) c = Get_Raw_Char();
	return int(c - '0');
}

static inline int Get_PInt() {
	char c = Get_Raw_Char();
	int ret;
	while (!isdigit(c)) c = Get_Raw_Char();
	ret = int(c - '0');
	while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');
	return ret;
}

static inline int Get_Int() {
	char c = Get_Raw_Char();
	bool neg = false;
	int ret;
	while (!isdigit(c)) {
		if (c == '-') neg = true;
		c = Get_Raw_Char();
	}
	ret = int(c - '0');
	while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');
	if (neg) return -ret;
	return ret;
}

static inline long long int Get_ll() {
	char c = Get_Raw_Char();
	bool neg = false;
	long long int ret;
	while (!isdigit(c)) {
		if (c == '-') neg = true;
		c = Get_Raw_Char();
	}
	ret = int(c - '0');
	while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');
	if (neg) return -ret;
	return ret;
}

static inline long long int Get_Pll() {
	char c = Get_Raw_Char();
	long long int ret;
	while (!isdigit(c)) c = Get_Raw_Char();
	ret = int(c - '0');
	while (isdigit(c = Get_Raw_Char())) ret = ret * 10 + int(c - '0');
	return ret;
}

template <typename T> static inline void Read_P(T &n) {
	static_assert(is_integral<T>::value);
	char c = Get_Raw_Char();
	while (!isdigit(c)) c = Get_Raw_Char();
	n = int(c - '0');
	while (isdigit(c = Get_Raw_Char())) n = n * 10 + int(c - '0');
	return ;
}

template <typename T> static inline void Read(T &n) {
	static_assert(is_integral<T>::value);
	char c = Get_Raw_Char();
	bool neg = false;
	while (!isdigit(c)) {
		if (c == '-') neg = true;
		c = Get_Raw_Char();
	}
	n = int(c - '0');
	while (isdigit(c = Get_Raw_Char())) n = n * 10 + int(c - '0');
	if (neg) n = -n;
	return ;
}

template <typename T> static inline void Read_Digit(T &n) {
	static_assert(is_integral<T>::value);
	char c = Get_Raw_Char();
	while (!isdigit(c)) c = Get_Raw_Char();
	n = int(c - '0');
	return ;
}

template <typename T, typename... Targs> static inline void Read(T &n, Targs&... Fargs) {
	Read(n);
	return Read(Fargs...);
}

template <typename T, typename... Targs> static inline void Read_Digit(T &n, Targs&... Fargs) {
	Read_Digit(n);
	return Read_Digit(Fargs...);
}

template <typename T, typename... Targs> static inline void Read_P(T &n, Targs&... Fargs) {
	Read_P(n);
	return Read_P(Fargs...);
}
// End of C:\Users\ianli\Desktop\CP\template\Various\Fast_IO.cpp

int f[kN], p[kN], x[kN], y[kN], sa[kN], sb[kN], idx[kN];
double ans, srp[kN], val[kN], tsp[kN];

double Cal(int n) {
	ll sd = ABS(sa[n] - sb[n]);
	return val[n] = sd * sd / srp[n];
}

int Find(int n) {return n == f[n] ? n : f[n] = Find(f[n]);}
void Merge(int l, int r) {
	l = Find(l), r = Find(r);
	if (l != r) {
		if (idx[l] < idx[r]) swap(l, r);
		ans -= val[l];
		ans -= val[r];
		f[r] = l;
		sa[l] += sa[r];
		sb[l] += sb[r];
		srp[l] += srp[r];
		ans += Cal(l);
	}
	return ;
}

int main() {
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//freopen("file_name", "r", stdin);
	//freopen("file_name", "w", stdout);
	//fstream input, output;
	//input.open("file_name", ios::in);
	//output.open("file_name", ios::out);
	int n, q;
	mt19937 rng;
	Read_P(n);
	for (int i = 1; i <= n; i++) Read_P(sa[i]);
	for (int i = 1; i <= n; i++) Read_P(sb[i]);
	for (int i = 1; i <= n; i++) Read_P(p[i]);
	Read_P(q);
	for (int i = 1; i <= q; i++) Read_P(x[i], y[i]);

	// Limit check
	 assert(1 <= n && n <= 100000);
	 assert(1 <= q && q <= 200000);
	 for (int i = 1; i <= n; i++) assert(0 <= sa[i] && sa[i] <= 1000);
	 for (int i = 1; i <= n; i++) assert(0 <= sb[i] && sb[i] <= 1000);
	// for (int i = 1; i <= n; i++) assert(0 <= p[i] && p[i] <= 100);
	 for (int i = 1; i <= q; i++) assert(x[i] != y[i]);
	 for (int i = 1; i <= q; i++) assert(1 <= x[i] && x[i] <= n);
	 for (int i = 1; i <= q; i++) assert(1 <= y[i] && y[i] <= n);

	for (int i = 1; i <= n; i++) idx[i] = rng();

	//for (int i = 0; i <= 100; i++) tsp[i] = 1.0 / i;
	//for (int i = 1; i <= n; i++) srp[i] = tsp[p[i]];
	for (int i = 1; i <= n; i++) srp[i] = 1.0 / p[i];
	for (int i = 1; i <= n; i++) f[i] = i;
	for (int i = 1; i <= n; i++) ans += Cal(i);

	for (int i = 1; i <= q; i++) {
		Merge(x[i], y[i]);
		printf("%.20lf\n", ans);
	}
	//input.close();
	//output.close();
}
// End of B.cpp

yukicoder

結果

テストケース

ソースコード