QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#668359#9492. 树上简单求和cmk66647 5332ms97220kbC++2312.2kb2024-10-23 13:55:312024-10-23 13:55:33

Judging History

你现在查看的是最新测评结果

  • [2024-10-23 13:55:33]
  • 评测
  • 测评结果:47
  • 用时:5332ms
  • 内存:97220kb
  • [2024-10-23 13:55:31]
  • 提交

answer

/*  _              _     _                                             _       __      __      __   
   / \     _   _  | |_  | |__     ___    _ __   _    ___   _ __ ___   | | __  / /_    / /_    / /_  
  / _ \   | | | | | __| | '_ \   / _ \  | '__| (_)  / __| | '_ ` _ \  | |/ / | '_ \  | '_ \  | '_ \ 
 / ___ \  | |_| | | |_  | | | | | (_) | | |     _  | (__  | | | | | | |   <  | (_) | | (_) | | (_) |
/_/   \_\  \__,_|  \__| |_| |_|  \___/  |_|    (_)  \___| |_| |_| |_| |_|\_\  \___/   \___/   \___/ 
[Created Time:       2024-10-23 13:25:24]
[Last Modified Time: 2024-10-23 13:55:16] */
#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include"debug.h"
#else
#define D(...) ((void)0)
#endif
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
namespace FastIO
{
#define USE_FastIO
// ------------------------------
// #define DISABLE_MMAP
// ------------------------------
#if ( defined(LOCAL) || defined(_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifdef LOCAL
	inline void _chk_i() {}
	inline char _gc_nochk() { return getchar(); }
	inline char _gc() { return getchar(); }
	inline void _chk_o() {}
	inline void _pc_nochk(char c) { putchar(c); }
	inline void _pc(char c) { putchar(c); }
	template < int n > inline void _pnc_nochk(const char *c) { for ( int i = 0 ; i < n ; i++ ) putchar(c[i]); }
#else
#ifdef DISABLE_MMAP
	inline constexpr int _READ_SIZE = 1 << 18; inline static char _read_buffer[_READ_SIZE + 40], *_read_ptr = nullptr, *_read_ptr_end = nullptr; static inline bool _eof = false;
	inline void _chk_i() { if ( __builtin_expect(!_eof, true) && __builtin_expect(_read_ptr_end - _read_ptr < 40, false) ) { int sz = _read_ptr_end - _read_ptr; if ( sz ) memcpy(_read_buffer, _read_ptr, sz); char *beg = _read_buffer + sz; _read_ptr = _read_buffer, _read_ptr_end = beg + fread(beg, 1, _READ_SIZE, stdin); if ( __builtin_expect(_read_ptr_end != beg + _READ_SIZE, false) ) _eof = true, *_read_ptr_end = EOF; } }
	inline char _gc_nochk() { return __builtin_expect(_eof && _read_ptr == _read_ptr_end, false) ? EOF : *_read_ptr++; }
	inline char _gc() { _chk_i(); return _gc_nochk(); }
#else
#include<sys/mman.h>
#include<sys/stat.h>
	inline static char *_read_ptr = (char *)mmap(nullptr, [] { struct stat s; return fstat(0, &s), s.st_size; } (), 1, 2, 0, 0);
	inline void _chk_i() {}
	inline char _gc_nochk() { return *_read_ptr++; }
	inline char _gc() { return *_read_ptr++; }
#endif
	inline constexpr int _WRITE_SIZE = 1 << 18; inline static char _write_buffer[_WRITE_SIZE + 40], *_write_ptr = _write_buffer;
	inline void _chk_o() { if ( __builtin_expect(_write_ptr - _write_buffer > _WRITE_SIZE, false) ) fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout), _write_ptr = _write_buffer; }
	inline void _pc_nochk(char c) { *_write_ptr++ = c; }
	inline void _pc(char c) { *_write_ptr++ = c, _chk_o(); }
	template < int n > inline void _pnc_nochk(const char *c) { memcpy(_write_ptr, c, n), _write_ptr += n; }
	inline struct _auto_flush { inline ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); } } _auto_flush;
#endif
#define println println_ // don't use C++23 std::println
	template < class T > inline constexpr bool _is_signed = numeric_limits < T >::is_signed;
	template < class T > inline constexpr bool _is_unsigned = numeric_limits < T >::is_integer && !_is_signed < T >;
#if __SIZEOF_LONG__ == 64
	template <> inline constexpr bool _is_signed < __int128 > = true;
	template <> inline constexpr bool _is_unsigned < __uint128_t > = true;
#endif
	inline bool _isgraph(char c) { return c >= 33; }
	inline bool _isdigit(char c) { return 48 <= c && c <= 57; } // or faster, remove c <= 57
	constexpr struct _table {
#ifndef LOCAL
	int i[65536];
#endif
	char o[40000]; constexpr _table() :
#ifndef LOCAL
	i{},
#endif
	o{} {
#ifndef LOCAL
	for ( int x = 0 ; x < 65536 ; x++ ) i[x] = -1; for ( int x = 0 ; x <= 9 ; x++ ) for ( int y = 0 ; y <= 9 ; y++ ) i[x + y * 256 + 12336] = x * 10 + y;
#endif
	for ( int x = 0 ; x < 10000 ; x++ ) for ( int y = 3, z = x ; ~y ; y-- ) o[x * 4 + y] = z % 10 + 48, z /= 10; } } _table;
	template < class T, int digit > inline constexpr T _pw10 = 10 * _pw10 < T, digit - 1 >;
	template < class T > inline constexpr T _pw10 < T, 0 > = 1;
	inline void read(char &c) { do c = _gc(); while ( !_isgraph(c) ); }
	inline void read_cstr(char *s) { char c = _gc(); while ( !_isgraph(c) ) c = _gc(); while ( _isgraph(c) ) *s++ = c, c = _gc(); *s = 0; }
	inline void read(string &s) { char c = _gc(); s.clear(); while ( !_isgraph(c) ) c = _gc(); while ( _isgraph(c) ) s.push_back(c), c = _gc(); }
	template < class T, bool neg >
#ifndef LOCAL
	__attribute__((no_sanitize("undefined")))
#endif
	inline void _read_int_suf(T &x) { _chk_i(); char c; while
#ifndef LOCAL
	( ~_table.i[*reinterpret_cast < unsigned short *& >(_read_ptr)] ) if constexpr ( neg ) x = x * 100 - _table.i[*reinterpret_cast < unsigned short *& >(_read_ptr)++]; else x = x * 100 + _table.i[*reinterpret_cast < unsigned short *& >(_read_ptr)++]; if
#endif
	( _isdigit(c = _gc_nochk()) ) if constexpr ( neg ) x = x * 10 - ( c & 15 ); else x = x * 10 + ( c & 15 ); }
	template < class T, enable_if_t < _is_signed < T >, int > = 0 > inline void read(T &x) { char c; while ( !_isdigit(c = _gc()) ) if ( c == 45 ) { _read_int_suf < T, true >(x = -( _gc_nochk() & 15 )); return; } _read_int_suf < T, false >(x = c & 15); }
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 > inline void read(T &x) { char c; while ( !_isdigit(c = _gc()) ); _read_int_suf < T, false >(x = c & 15); }
	inline void write(bool x) { _pc(x | 48); }
	inline void write(char c) { _pc(c); }
	inline void write_cstr(const char *s) { while ( *s ) _pc(*s++); }
	inline void write(const string &s) { for ( char c : s ) _pc(c); }
	template < class T, bool neg, int digit > inline void _write_int_suf(T x) { if constexpr ( digit == 4 ) _pnc_nochk < 4 >(_table.o + ( neg ? -x : x ) * 4); else _write_int_suf < T, neg, digit / 2 >(x / _pw10 < T, digit / 2 >), _write_int_suf < T, neg, digit / 2 >(x % _pw10 < T, digit / 2 >); }
	template < class T, bool neg, int digit > inline void _write_int_pre(T x) { if constexpr ( digit <= 4 ) if ( digit >= 3 && ( neg ? x <= -100 : x >= 100 ) ) if ( digit >= 4 && ( neg ? x <= -1000 : x >= 1000 ) ) _pnc_nochk < 4 >(_table.o + ( neg ? -x : x ) * 4); else _pnc_nochk < 3 >(_table.o + ( neg ? -x : x ) * 4 + 1); else if ( digit >= 2 && ( neg ? x <= -10 : x >= 10 ) ) _pnc_nochk < 2 >(_table.o + ( neg ? -x : x ) * 4 + 2); else _pc_nochk(( neg ? -x : x ) | 48); else { constexpr int cur = 1 << __lg(digit - 1); if ( neg ? x <= -_pw10 < T, cur > : x >= _pw10 < T, cur > ) _write_int_pre < T, neg, digit - cur >(x / _pw10 < T, cur >), _write_int_suf < T, neg, cur >(x % _pw10 < T, cur >); else _write_int_pre < T, neg, cur >(x); } }
	template < class T, enable_if_t < _is_signed < T >, int > = 0 > inline void write(T x) { if ( x >= 0 ) _write_int_pre < T, false, numeric_limits < T >::digits10 + 1 >(x); else _pc_nochk(45), _write_int_pre < T, true, numeric_limits < T >::digits10 + 1 >(x); _chk_o(); }
	template < class T, enable_if_t < _is_unsigned < T >, int > = 0 > inline void write(T x) { _write_int_pre < T, false, numeric_limits < T >::digits10 + 1 >(x), _chk_o(); }
	template < size_t N, class ...T > inline void _read_tuple(tuple < T... > &x) { read(get < N >(x)); if constexpr ( N + 1 != sizeof...(T) ) _read_tuple < N + 1, T... >(x); }
	template < size_t N, class ...T > inline void _write_tuple(const tuple < T... > &x) { write(get < N >(x)); if constexpr ( N + 1 != sizeof...(T) ) _pc(32), _write_tuple < N + 1, T... >(x); }
	template < class ...T > inline void read(tuple < T... > &x) { _read_tuple < 0, T... >(x); }
	template < class ...T > inline void write(const tuple < T... > &x) { _write_tuple < 0, T... >(x); }
	template < class T1, class T2 > inline void read(pair < T1, T2 > &x) { read(x.first), read(x.second); }
	template < class T1, class T2 > inline void write(const pair < T1, T2 > &x) { write(x.first), _pc(32), write(x.second); }
	template < class T > inline auto read(T &x) -> decltype(x.read(), void()) { x.read(); }
	template < class T > inline auto write(const T &x) -> decltype(x.write(), void()) { x.write(); }
	template < class T1, class ...T2 > inline void read(T1 &x, T2 &...y) { read(x), read(y...); }
	template < class ...T > inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
	template < class T1, class ...T2 > inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); }
	template < class ...T > inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
	template < class T > inline void print(const T &x) { write(x); }
	inline void print_cstr(const char *x) { write_cstr(x); }
	template < class T1, class ...T2 > inline void print(const T1 &x, const T2 &...y) { write(x), _pc(32), print(y...); }
	template < class ...T > inline void print_cstr(const char *x, const T *...y) { write_cstr(x), _pc(32), print_cstr(y...); }
	inline void println() { _pc(10); }
	inline void println_cstr() { _pc(10); }
	template < class ...T > inline void println(const T &...x) { print(x...), _pc(10); }
	template < class ...T > inline void println_cstr(const T *...x) { print_cstr(x...), _pc(10); }
}	using FastIO::read, FastIO::read_cstr, FastIO::write, FastIO::write_cstr, FastIO::println, FastIO::println_cstr;
using ull = unsigned long long;
int n, m, b, u, v, bn, lp, rp, len, o[200009], opl, cnt[200009];
ull w, a[200009], aa[200009], sum[200009], tag, ans[200009];
tuple < int, int, int, ull > op[4000009];
struct HLD
{
	basic_string < int > g[200009];
	int fa[200009], h[200009], sz[200009], hs[200009], tp[200009], dfn[200009], ord[200009], cnt;
	inline void clr() { fill(hs + 1, hs + n + 1, 0), cnt = 0; }
	inline void dfs(int u, int fa = 0)
	{
		HLD::fa[u] = fa, h[u] = h[fa] + 1, sz[u] = 1;
		for ( int i : g[u] ) if ( i != fa )
		{
			dfs(i, u), sz[u] += sz[i];
			if ( sz[i] > sz[hs[u]] ) hs[u] = i;
		}
	}
	inline void dfs2(int u, int tp)
	{
		HLD::tp[u] = tp, dfn[u] = ++cnt;
		if ( hs[u] ) dfs2(hs[u], tp);
		for ( int i : g[u] ) if ( i != fa[u] && i != hs[u] ) dfs2(i, i);
	}
	inline void init(int rt = 1) { clr(), dfs(rt), dfs2(rt, rt); }
	inline int lca(int x, int y)
	{
		while ( tp[x] != tp[y] ) h[tp[x]] > h[tp[y]] ? ( x = fa[tp[x]] ) : ( y = fa[tp[y]] );
		return h[x] < h[y] ? x : y;
	}
	inline int dis(int x, int y) { return h[x] + h[y] - 2 * h[lca(x, y)]; }
	inline int kth(int x, int k)
	{
		for ( ; x ; k -= h[x] - h[tp[x]] + 1, x = fa[tp[x]] )
			if ( k < h[x] - h[tp[x]] + 1 ) return ord[dfn[x] - k];
		return 0;
	}
	inline void mdf(int x, int y, int z, ull w)
	{
		for ( ; tp[x] != tp[y] ; x = fa[tp[x]] )
		{
			if ( h[tp[x]] < h[tp[y]] ) swap(x, y);
			op[++opl] = tuple(dfn[tp[x]], dfn[x], z, w);
		}
		if ( h[x] > h[y] ) swap(x, y);
		op[++opl] = tuple(dfn[x], dfn[y], z, w);
	}
}	t1, t2;
inline void build()
{
	fill(sum + 1, sum + len + 1, 0); For(i, lp, rp) sum[cnt[o[i]]] += a[i];
	partial_sum(sum + 1, sum + len + 1, sum + 1);
}
int main()
{
	read(n, m), b = max(1, (int)roundl(sqrtl(m) * .25l)), bn = ( n - 1 ) / b + 1;
	For(i, 1, n) read(aa[i]);
	For(i, 2, n) read(u, v), t1.g[u].push_back(v), t1.g[v].push_back(u);
	For(i, 2, n) read(u, v), t2.g[u].push_back(v), t2.g[v].push_back(u);
	t1.init(), t2.init();
	For(i, 1, n) o[t1.dfn[i]] = t2.dfn[i], a[t1.dfn[i]] = aa[i];
	For(i, 1, m) read(u, v, w), t1.mdf(u, v, 0, w), t2.mdf(u, v, i, 0);
	For(i, 1, bn)
	{
		lp = i * b - b + 1, rp = min(i * b, n), len = rp - lp + 1;
		fill(cnt + 1, cnt + n + 1, 0); For(j, lp, rp) cnt[o[j]]++;
		partial_sum(cnt + 1, cnt + n + 1, cnt + 1), build(), tag = 0;
		For(j, 1, opl)
		{
			auto [l, r, z, w] = op[j];
			if ( z )
			{
				l = cnt[l - 1], r = cnt[r];
				if ( l < r ) ans[z] += sum[r] - sum[l] + ( r - l ) * tag; 
			}
			else
			{
				if ( l <= lp && rp <= r ) tag += w;
				else if ( l <= rp && r >= lp )
				{
					if ( tag ) { For(k, lp, rp) a[k] += tag; tag = 0; }
					For(k, max(l, lp), min(r, rp)) a[k] += w; build();
				}
			}
		}
	}
	For(i, 1, m) println(ans[i]);
	return 0;
}
// 想上GM捏 想上GM捏 想上GM捏 想上GM捏 想上GM捏
// 伊娜可爱捏 伊娜贴贴捏

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 5
Accepted

Test #1:

score: 5
Accepted
time: 27ms
memory: 35564kb

input:

3000 3000
7236742292501328495 17973811477309806363 16075782662531676171 17971236571771878676 11392080645527132110 3685563455925680459 9773593720088356683 8313828403245053795 7736401634567449043 1634817828009987181 6951124933529719486 12775126714635387213 15460977209223753216 397573676785925632 31372...

output:

12105153858659381124
18367442707572066757
11668241962484097878
11288238120352358472
1742468310074622166
9942835997686093671
3305677510569607477
17741602000425004088
14984128302052618266
1075081718074605786
6509217537832509095
16750513627843273113
8569443169249732820
14475184194298579044
156111071108...

result:

ok 3000 lines

Test #2:

score: 5
Accepted
time: 30ms
memory: 35348kb

input:

3000 3000
1612333876155866602 8538417838700679227 6080765231437578796 17905224638340228394 12270907925903144224 17944105326358594564 17302041033966840611 1006351124625222126 496336153231744288 9393087977687876980 9553975238547373621 9361882717200384390 15051881329169144319 9757999873162420435 882725...

output:

11133131376095771981
7909873024850695144
16250639243139481926
14562550655578101207
8274205996508264973
178549413271904466
2368406276743327913
7464009386554813982
9439464815411774627
1471756740732097060
15201641099137019227
6774030298556871576
18156105511913219667
1553508745644446823
4225137078364117...

result:

ok 3000 lines

Test #3:

score: 5
Accepted
time: 16ms
memory: 35424kb

input:

3000 3000
9709246061666095435 1861649101703072889 10620139893353930613 17635186539135419482 710209455559527146 6075101384669982511 1120305006358459674 9703156967435388252 1397046737759839382 5259056712870179169 8253156305433022999 710199693203327302 15130650033641744675 10720111924616886955 15543351...

output:

7834604406305153073
5037061270969117785
16481572776620825702
15177894197606565804
3120320619896892806
18008650876379132344
7417108723176816402
13515164814425439399
3299769942258542105
15897528270699011770
11642805469843844638
16764682282380318054
4824039114054405772
4859834102876213962
1234210473247...

result:

ok 3000 lines

Test #4:

score: 5
Accepted
time: 17ms
memory: 35912kb

input:

3000 3000
16538965545220923528 18062192327708400751 10422465150728338588 3471522151129113073 1236650672072793692 1942240200040301168 13090729759591037952 15335798523677372669 9912100622761466753 11177948788405690381 3710859061697501523 4984944638666762977 17278589713462878008 6371292801024547050 868...

output:

8182453933067329108
13535217473847106938
17067385337010269798
3806121648880466130
11322569288575153037
11079197311131660121
9670138330007803226
6554062218199796758
965954569567598779
18055887214749050688
6142620503089407421
8690117812667761187
9547139298346295115
8890987597519353054
1755036654049586...

result:

ok 3000 lines

Test #5:

score: 5
Accepted
time: 22ms
memory: 36184kb

input:

3000 3000
17759588706587888497 10550000524636484378 11601004513528075994 7150322911283804521 4459707248078569712 10692395730842402625 8940418793863522991 12967068928670540447 9954278250450015940 13702413838608801301 10598390500439869870 15110245227553613794 490862872212325709 15164980555660957366 94...

output:

9743736929788175512
16812303667256960040
14694223512340829897
550204232580650311
1175342872438242313
17622261358285047637
7413682703975031220
12643066512274062227
1868985217436232595
5471830334855681322
8070132260376389587
3970361922096052085
218281824643752746
991917103472727104
2960248244218479023...

result:

ok 3000 lines

Subtask #2:

score: 12
Accepted

Dependency #1:

100%
Accepted

Test #6:

score: 12
Accepted
time: 0ms
memory: 35228kb

input:

5 7
0 3 2 6 4
1 2
2 4
1 5
5 3
3 4
4 2
2 5
5 1
5 3 0
3 2 5
4 4 4
4 4 3
5 2 0
3 4 3
5 5 6

output:

15
21
10
13
17
26
18

result:

ok 7 lines

Test #7:

score: 12
Accepted
time: 3100ms
memory: 62024kb

input:

70000 70000
3805295436278888199 9842309351516174725 1566744796319231180 2206519284152256579 2715928675931950447 6346821976624501261 16020972671480798719 14702021753902144915 17127828773798978442 15779168055669690475 4964561323934614661 9395102787554964450 6377076753365184543 15167378195767668817 288...

output:

5971729064136092190
6457394048987305727
13604212649915736394
8639973959364892219
437861319070967556
16133076880026962355
5384937395694479961
4591478439775690843
16071919565966962790
15485626634068969082
10235993901046758372
3449528613427081475
8064280362779764074
12784984512326434905
424951714880051...

result:

ok 70000 lines

Test #8:

score: 12
Accepted
time: 2578ms
memory: 61256kb

input:

70000 70000
17769190865915081913 3772925482507158804 10559962993069063712 16307277356502651642 12014171661057147061 1923543107882042577 13408785599350410314 17786178374951015816 2038922879833426794 2540043772647346461 15419977514837351390 5175974305273838292 16815288359165841441 6295059675346852046 ...

output:

16215781699519408534
17067966839552063165
1639359200259068228
1157756671621253300
12850966537933214537
13917563606289473282
11146906493479190751
869141055866285398
529460535280965984
11437720548737856517
12321579881011015953
4005153170897692243
10217866116994297464
8892403813874757974
12520505236760...

result:

ok 70000 lines

Test #9:

score: 12
Accepted
time: 1333ms
memory: 55460kb

input:

70000 70000
1322605819855709761 1534349070722535975 3956030287626175223 12996546673549161162 7258680666490714729 15591023033141410544 11626890152249303179 7745771567168540351 5535931029756133379 11840793767439557739 6286106656048048381 9490665709724541446 4561258384162386434 2460318488748442222 1303...

output:

7565012138645637258
1080785033897684285
4000254219257999844
8727142139647715419
1784876728989450460
2474052717732723820
5108017366064709316
5232698473118606856
7893212823648229982
6449010654774296779
16571818815110297674
603759348329356530
7364528294111530037
4667545362378304836
3039728935129459889
...

result:

ok 70000 lines

Test #10:

score: 12
Accepted
time: 2246ms
memory: 54532kb

input:

70000 70000
2918414982140182939 1004760492603077644 7526656799259998488 6665485253854847449 7752199419154649757 12763267823077347079 11745132191692540338 6726116817426709990 15550876907005962464 9760509858122842638 684733892856965421 10077915441058780247 8380400329996723109 16920573433866702239 3069...

output:

8230389499860859172
16425656898047941538
107743004356580170
9778122844868660722
11068387722102791183
13252614309136720348
15937842372230698728
12777338070107774364
17974062134369145560
3740400391792770609
7367804332878038809
14236246024207211797
5659238205278608512
10550373456364765526
3478082332928...

result:

ok 70000 lines

Test #11:

score: 12
Accepted
time: 920ms
memory: 53872kb

input:

70000 70000
14167059704556856337 16190708842842354431 16763990539754009056 7631426709261583690 16701377874952853623 13128000186728267818 13668914249103068169 11444044591715948726 461080622438520919 15327533341012334586 15905150558482528923 18113008235210277231 18273290154232335325 871461822812191943...

output:

5416890687002400795
15434184693210288436
14994504916760087024
2057026449542829151
14782289435774270062
5375237679514404106
6242405047854012647
13176621545709355733
14860610197328732602
2320525143444929350
4955538191022622551
16072981679771537209
16493487770453132249
7457010288198365370
1095949888193...

result:

ok 70000 lines

Test #12:

score: 12
Accepted
time: 821ms
memory: 51304kb

input:

70000 70000
6512290618577097706 2307104154841663907 18099814251235047570 8297332016606109910 6979819983598849680 18022671181330012408 7003320957516774041 10765303713874539785 15263207007138552812 11713955610641877995 9084887894280210904 3653718255996209121 14197591595561260765 2937670413926210256 43...

output:

5372775214253596890
927985558228810546
3829815088328182672
17496384540548895622
2541458359607440535
9685902106698191409
13649653134779075960
2952563488513208867
3457470079648848247
11542323450217419837
6576344363223624061
12316990756988470568
17923006133291073450
13069551524451668138
648013229980407...

result:

ok 70000 lines

Test #13:

score: 12
Accepted
time: 1656ms
memory: 51280kb

input:

70000 70000
13665984219894847790 9458613748861462697 7467746948118990839 10855454155004540952 10025433108785732161 15816172836312183738 2834129139700401667 221649423184372325 8409217794427284711 16119623676185869010 12488380095384700010 3049877130176336551 5805665682633632307 13224802542929355280 18...

output:

7934210059911784858
14305091721658406168
5803801684631217062
8806866881905382618
14997911434771439753
7006465422324293550
15394754861139766679
8377831978907312075
12227086919743533414
8784212755151945751
17039860679476902214
6474495685436520748
11136139762939837997
16869294577244011226
1164744311638...

result:

ok 70000 lines

Subtask #3:

score: 13
Accepted

Dependency #2:

100%
Accepted

Test #14:

score: 13
Accepted
time: 4655ms
memory: 70844kb

input:

120000 120000
4056283459929576306 2264755903151268173 1157390036441353969 5734735320959854923 6025999163810189446 3972481234804681969 4746636248696530169 6716674455256322787 6407347371842702902 7463142557880503801 208361219405474896 512530621977574257 6488145455921761864 6595856237657889728 95997703...

output:

11686658894480913739
10283716998652647869
7469817527336516079
9879285786875030762
4982549977394044949
16564334076086174008
6433057925981833441
7460470339844352254
9945354316570680900
18377735143728853940
15872286040534058104
8507347369923543553
308747406436979607
18218197459972943141
177225056570719...

result:

ok 120000 lines

Test #15:

score: 13
Accepted
time: 2066ms
memory: 69252kb

input:

120000 120000
5867632904403891095 7734115005912544376 13901514937742085110 17141033381317351710 17988246451665298411 17540600012243810041 15190868862458266725 15454563456231559301 8740470882859091311 17882360629171437337 12095218884748126199 17817518168343018595 7112391591378197276 65538601378146110...

output:

13420129597746517056
18337642296188485079
4380067206814687930
5525410739012465159
1979575298167242590
10855827974711636510
9874020479466690595
17720000790164899934
16724816545805525287
15594891417371432986
14655386085151616523
11435247647009150363
7635358811289719984
14609735500036643833
13339404812...

result:

ok 120000 lines

Test #16:

score: 13
Accepted
time: 4441ms
memory: 80712kb

input:

120000 120000
12590795589408290093 11275909154009220197 10996087245163181988 287253987689120747 522028471439816976 5251098397309018220 9466903789635983479 12562504698210775380 14359608006525868271 12860739587215060171 6110493152041264342 8941951597283806533 7247902667356706183 13908919237133011991 1...

output:

12568574963997891813
9761481874717599084
9748193662109666281
17759229044598540251
9232146611495947992
16451851566322082145
10163587939420717881
11939061140179225100
13555756814075457024
15331444302135124578
12404089960631589833
10914316315261843243
3330610810849167077
4308673861372384247
22214038984...

result:

ok 120000 lines

Test #17:

score: 13
Accepted
time: 1610ms
memory: 68192kb

input:

120000 120000
16014732670888203993 17003360764706956461 4309217563402934767 12155136955819956058 9472943536135969437 8619903067520668384 8532935983471178458 840596314384730622 8808409849265669508 16268252642839060126 8703458878963184072 14133056030074803107 16125379684339605436 13795196609771489642 ...

output:

14157083647705042191
9626539498588941455
12672590587667741319
7637586779842324001
17945793757619266709
6486513804042528016
17128439522931715545
14506773931432125656
10149598925465005229
8493513931817247270
9843224754697262936
17563138715401598781
5251652421620155711
16347886781065131205
141775307219...

result:

ok 120000 lines

Test #18:

score: 13
Accepted
time: 5332ms
memory: 67952kb

input:

120000 120000
3799726989717681598 2540658873004706851 6999377479951345208 4574847538261052797 1388764904624490347 797597442974571877 12049698136986117426 1334073669070317189 11812534794423707083 12910806883079537898 8919907966949030320 3609251437048437267 6955259073591432492 1913761510032208708 1536...

output:

16410218753178084291
3452125570141203996
12637348475870430626
939828522750114530
6181904502892064992
7530673907543931274
11125835388154440123
1132493328298594689
6540415366631312545
10171022468601061874
10785984448364782773
15132462728937914062
13894055239781007518
14553135357399426810
1058534365058...

result:

ok 120000 lines

Test #19:

score: 13
Accepted
time: 4506ms
memory: 67768kb

input:

120000 120000
523123731336918243 4097858622836674571 1961367823237386001 2725250184116707092 15256083167104925470 8826573328357841773 14551942275839683916 4676612813711946771 16866097649532049020 16028370234860808559 16550040875881081238 13114506992715113111 18223636920754369434 4711187061384408363 ...

output:

13171866584326858355
7378923635054867195
4676544939953182559
8211313138413629930
3762100382261198154
17376905504590956432
11575432112253285846
6651270238220236939
7296214239679292747
3921715204635211841
13514446212830941534
14681462832343839777
9394758474079991863
2039117273115115478
162036285844685...

result:

ok 120000 lines

Test #20:

score: 13
Accepted
time: 3630ms
memory: 69356kb

input:

120000 120000
16563527794956746492 3507607345845239151 6704373347302736722 4366660651585002614 17477711326324414919 14064904073416411127 1886265819461820151 1530962154006256458 3386801749967932412 10176358119958383434 14136333004424650089 18047845530334381646 14290290829566494165 1979382774616512004...

output:

2687063429907612648
7246290134975359576
451523845887078136
6787443537167049842
11742387638116508426
9452080235999660003
1640133015384348445
9479626460563956802
8536081354965239985
14886879078945984440
5977814891978138604
16811290642393481835
2319291536056800936
4327858711873466013
508236457787094527...

result:

ok 120000 lines

Subtask #4:

score: 0
Time Limit Exceeded

Test #21:

score: 0
Time Limit Exceeded

input:

200000 200000
622783158027686223 2242697872372232537 8481648430436878777 10092474834140799044 15403999682625301609 12614289513474949582 9180944589267018841 7823784919308285798 8257785171198951273 5134508521895120821 8041682272181381093 3835432206618893170 2653803171409877650 5589823419153460372 1007...

output:


result:


Subtask #5:

score: 17
Accepted

Test #27:

score: 17
Accepted
time: 4730ms
memory: 89596kb

input:

200000 200000
1958469220619413759 14991498002015735322 6054491201406941902 18206143187746582567 15082377615826460430 2936248617457291604 10073577150351675920 16534472678586906457 2207599132486246393 10301540360769075442 1492580560381080472 551692353431379140 13238280352539145808 8462626987240986565 ...

output:

11479812171669345085
7612644482907856514
7664363696211351499
10419050713553268082
7115244954460011045
9683711549165598600
15714069303067445091
5098969076555779384
17312050420753525411
13302302653999024684
15237835478514966949
1011923303415334401
15280591493481885526
11613220426756932450
109080667232...

result:

ok 200000 lines

Test #28:

score: 17
Accepted
time: 3125ms
memory: 91884kb

input:

200000 200000
16779443803326674772 15639579352489825289 13969981610137062426 16505376510381344640 9806280160602498118 1419045977670621133 7677707894082613460 11957033082833096140 2771983498938827257 14706498164400422706 9378952791453329569 1930132295950861416 16111764090559108273 8905137311835789422...

output:

16293566981830212911
10264859857591337484
8994663676867609646
2754771179506593788
4767946170760042771
742819530451319825
2803285017809086810
3484130454853725644
7697600623078121691
5084812233611883732
3280787561128521192
1047502191383912852
14082348302073768112
2601331176748190671
117450452631909696...

result:

ok 200000 lines

Test #29:

score: 17
Accepted
time: 1461ms
memory: 92648kb

input:

200000 200000
12029385893748061284 9172822681287286332 11779114870282057106 4849897936395853889 6103529715098530443 8797239236736271231 11618134370305604768 10908476427113524251 3933201111692274240 4499796948331538987 4232975400910660164 10415557794345312125 17360908993089799508 13708880030692860522...

output:

13101691483811142037
7858940297704268921
9131311782659594969
3979986497647305855
131040009215643795
10080455913202724993
13237896591702170157
4007300413168456185
10099014266690222675
16590528230541839393
10133194446659869919
16360073169922464941
15194261798246191631
5464643399868946391
1634883990603...

result:

ok 200000 lines

Test #30:

score: 17
Accepted
time: 2000ms
memory: 97220kb

input:

200000 200000
12279899037614140058 8888114948527866653 13928233147675322734 12454101025136386040 5288759580423671283 8776652717163613021 16449880332412915864 17287034922899709125 10532733829212727135 10764189288575553991 13953267646406847995 13908054688602304211 5827028562849173311 10886964702131020...

output:

16698510136139978210
16369094547606910925
1326550504815919356
15571631364851754526
15142726028067532669
16433307477502505346
2288796203808772846
14834334808701484355
11332372387379739662
16882038025761766711
15880577744881855798
3482331692875200083
3909893051643604341
17525221195783380334
1592129559...

result:

ok 200000 lines

Test #31:

score: 17
Accepted
time: 1654ms
memory: 91636kb

input:

200000 200000
4893160298280825903 18198846065921817748 16343447781007974282 15723743432312964985 12871862738540236681 9972578954818260019 125153552836276808 5361924347833293579 11971958522882153451 6606998668153528639 9846700557419796517 924197471899377062 16510652970019285610 13527675083280389351 1...

output:

12217733345977585604
15090345895939064308
8800682550100929240
8418299123801754016
9906718252280231096
3019478245971491784
9496949828298647194
17471225676572414614
11441204915622920024
5759065639620250580
3072007946120216696
17839333347550122908
11855291417460815970
1574976372415972484
15048267748478...

result:

ok 200000 lines

Test #32:

score: 17
Accepted
time: 1460ms
memory: 89564kb

input:

200000 200000
16269080113100378653 4484500057558985491 3155111047194780915 1955124878557628793 1131676785723263995 15670458790089679131 12642775067469645913 16058994799171671871 11128893081798077921 17630174838696618160 10509057764997030178 2736352128209806460 11214180975026520052 990613932293281058...

output:

12064924625133015846
16862321744372560028
1994646811747150992
10140722851099240116
2557503422311666754
15259878734280971978
3955576474907811510
3673505041702176640
7400377071018962046
12622228824601464114
10514727287268994992
17046945994663165568
3131278608817391298
7110396577833899144
2955850235837...

result:

ok 200000 lines

Test #33:

score: 17
Accepted
time: 4662ms
memory: 89348kb

input:

200000 200000
7793598924465250299 11320616179551810509 4514956344247028440 13595219380199005841 9022300443122747211 5306720789215014051 12829201090248291001 17484907120965865432 4426007998575926549 16938003364463208590 8456717373555158888 9856394533639307403 4263328592244098713 4497412961128822026 1...

output:

10753764993328700009
18007939111928197938
9749484091345535325
5504011101575545606
13062921586637652283
11960644823021452066
5934883515296641825
14816522537666728261
11155114586067595959
7338645965836498696
6416169899635462788
11575170211633743517
11478197945758314236
5225462134046697629
164046911152...

result:

ok 200000 lines

Subtask #6:

score: 0
Time Limit Exceeded

Test #34:

score: 0
Time Limit Exceeded

input:

200000 200000
6794776813641982926 1561596256197101737 10910039723053043515 7892247858295192798 12233819960547881004 17695389034783066733 9173201689566865598 17626618141377486739 7358781671024283919 6787559733384974662 3884392438269280436 14872846228351316833 9037842441501571648 14299818404271084016 ...

output:


result:


Subtask #7:

score: 0
Skipped

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Dependency #3:

100%
Accepted

Dependency #4:

0%