oj.uz

Submission #420062

# Submission time Handle Problem Language Result Execution time Memory
420062 2021-06-08T04:40:08 Z AriaH Dynamic Diameter (CEOI19_diameter) C++11
100 / 100
 432 ms 69564 KB 
/** I can do this all day **/

#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

typedef long long                   ll;
typedef long double                 ld;
typedef pair<int,int>               pii;
typedef pair<ll,ll>                 pll;
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define Mp                          make_pair
#define SZ(x)			    		(int)x.size()
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);

const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll inf = 3e18;
const int LOG = 22;

ll pw(ll a , ll b, ll M)  { return (!b ? 1 : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M : pw(a * a % M, b / 2, M))); }

ll W, last, H[N], lz[N << 2], E[N];

int n, q, A[N], B[N], pos[N], St[N], Fi[N];

vector < pll > G[N];

vector < int > tour;

struct node
{
	ll mx, mn, ab, bc, abc; /// ab -> maximum a - 2b dar in node, bc -> maximum -2b + c, abc max a + c - 2b
	void init(ll x)
	{
		mx = mn = x;
		ab = bc = -x;
		abc = 0;
	}
	friend node operator | (node a, node b)
	{
		node ret;
		ret.mx = max(a.mx, b.mx);
		ret.mn = min(a.mn, b.mn);
		ret.ab = max({a.ab, b.ab, a.mx - 2 * b.mn});
		ret.bc = max({a.bc, b.bc, - 2 * a.mn + b.mx});
		ret.abc = max({a.abc, b.abc, a.ab + b.mx, a.mx + b.bc});
		return ret;
	}
	friend node operator + (node V, ll x)
	{
		V.mx += x, V.mn += x, V.ab -= x, V.bc -= x;
		return V;
	}
} seg[N << 2], Q;

void dfs(int v, int P = 0)
{
	///printf("v = %d H = %lld\n", v, H[v]);
	tour.push_back(v);
	for(auto y : G[v])
	{
		ll u = y.F, cost = y.S;
		if(u == P) continue;
		H[u] = H[v] + cost;
		dfs(u, v);
		tour.push_back(v);
	}
}

void build(int v = 1, int tl = 0, int tr = SZ(tour) - 1)
{
	if(tl == tr)
	{
		seg[v].init(H[tour[tl]]);
		return;
	}
	int mid = (tl + tr) >> 1;
	build(v << 1, tl, mid), build(v << 1 | 1, mid + 1, tr);
	seg[v] = seg[v << 1] | seg[v << 1 | 1];
}

void S(int v, int tl, int tr)
{
	if(!lz[v] || tl == tr) return;
	lz[v << 1] += lz[v];
	lz[v << 1 | 1] += lz[v];
	seg[v << 1] = seg[v << 1] + lz[v];
	seg[v << 1 | 1] = seg[v << 1 | 1] + lz[v];
	lz[v] = 0;
}

void upd(int l, int r, ll x, int v = 1, int tl = 0, int tr = SZ(tour) - 1)
{
	S(v, tl, tr);
	if(l > tr || r < tl || l > r) return;
	if(l <= tl && tr <= r)
	{
		seg[v] = seg[v] + x;
		lz[v] += x;
		///printf("here l = %d r = %d x = %lld\n", l, r, x);
		return;
	}
	int mid = (tl + tr) >> 1;
	upd(l, r, x, v << 1, tl, mid), upd(l, r, x, v << 1 | 1, mid + 1, tr);
	seg[v] = seg[v << 1] | seg[v << 1 | 1];
}

/*void get(int l, int r, int v = 1, int tl = 0, int tr = SZ(tour) - 1)
{
	S(v, tl, tr);
	if(l > tr || r < tl || l > r) return;
	if(l <= tl && tr <= r)
	{
		if(Q.mx == -inf) Q = seg[v];
		else Q = Q | seg[v];
		return;
	}
	int mid = (tl + tr) >> 1;
	get(l, r, v << 1, tl, mid), get(l, r, v << 1 | 1, mid + 1, tr);
}
*/

int main()
{
	scanf("%d%d%lld", &n, &q, &W);
	for(int i = 1; i < n; i ++)
	{
		int a, b;
		ll c;
		scanf("%d%d%lld", &a, &b, &c);
		G[a].push_back(Mp(b, c));
		G[b].push_back(Mp(a, c));
		A[i] = a, B[i] = b;
		E[i] = c;
	}
	dfs(1);
	for(int i = 0; i < SZ(tour); i ++)
	{
		Fi[tour[i]] = i;
	}
	for(int i = SZ(tour) - 1; ~i; i --)
	{
		St[tour[i]] = i;
	}
	for(int i = 1; i < n; i ++)
	{
		if(H[B[i]] > H[A[i]]) swap(A[i], B[i]);
	}
	/*for(int i = 1; i <= n ;i ++)
	{
		printf("%d %d %d\n", i, St[i], Fi[i]);
	}
	*/
	build();
	while(q --)
	{
		ll fir, sec;
		scanf("%lld%lld", &fir, &sec);
		fir = (fir + last) % (n - 1) + 1;
		sec = (sec + last) % W;
		///printf("fir = %lld sec = %lld\n", fir, sec);
		upd(St[A[fir]], Fi[A[fir]], sec - E[fir]);
		E[fir] = sec;
		last = seg[1].abc;
		printf("%lld\n", last);
	}
    return 0;
}

/** test corner cases(n = 1?) watch for overflow or minus indices **/

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:130:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |  scanf("%d%d%lld", &n, &q, &W);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:135:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |   scanf("%d%d%lld", &a, &b, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:163:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  163 |   scanf("%lld%lld", &fir, &sec);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23768 KB Output is correct
3 Correct 16 ms 23756 KB Output is correct
4 Correct 14 ms 23780 KB Output is correct
5 Correct 16 ms 23840 KB Output is correct
6 Correct 14 ms 23756 KB Output is correct
7 Correct 14 ms 23792 KB Output is correct
8 Correct 13 ms 23756 KB Output is correct
9 Correct 13 ms 23796 KB Output is correct
10 Correct 14 ms 23800 KB Output is correct
11 Correct 13 ms 23788 KB Output is correct
12 Correct 14 ms 23792 KB Output is correct
13 Correct 13 ms 23788 KB Output is correct
14 Correct 14 ms 23756 KB Output is correct
15 Correct 14 ms 23884 KB Output is correct
16 Correct 15 ms 23788 KB Output is correct
17 Correct 16 ms 23772 KB Output is correct
18 Correct 13 ms 23856 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23768 KB Output is correct
3 Correct 16 ms 23756 KB Output is correct
4 Correct 14 ms 23780 KB Output is correct
5 Correct 16 ms 23840 KB Output is correct
6 Correct 14 ms 23756 KB Output is correct
7 Correct 14 ms 23792 KB Output is correct
8 Correct 13 ms 23756 KB Output is correct
9 Correct 13 ms 23796 KB Output is correct
10 Correct 14 ms 23800 KB Output is correct
11 Correct 13 ms 23788 KB Output is correct
12 Correct 14 ms 23792 KB Output is correct
13 Correct 13 ms 23788 KB Output is correct
14 Correct 14 ms 23756 KB Output is correct
15 Correct 14 ms 23884 KB Output is correct
16 Correct 15 ms 23788 KB Output is correct
17 Correct 16 ms 23772 KB Output is correct
18 Correct 13 ms 23856 KB Output is correct
19 Correct 18 ms 24140 KB Output is correct
20 Correct 19 ms 24200 KB Output is correct
21 Correct 19 ms 24216 KB Output is correct
22 Correct 19 ms 24172 KB Output is correct
23 Correct 22 ms 26024 KB Output is correct
24 Correct 23 ms 26056 KB Output is correct
25 Correct 23 ms 26108 KB Output is correct
26 Correct 24 ms 26316 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23848 KB Output is correct
2 Correct 14 ms 23884 KB Output is correct
3 Correct 16 ms 23860 KB Output is correct
4 Correct 23 ms 24012 KB Output is correct
5 Correct 58 ms 24928 KB Output is correct
6 Correct 13 ms 23732 KB Output is correct
7 Correct 17 ms 23884 KB Output is correct
8 Correct 14 ms 23884 KB Output is correct
9 Correct 15 ms 23916 KB Output is correct
10 Correct 25 ms 24232 KB Output is correct
11 Correct 69 ms 25216 KB Output is correct
12 Correct 18 ms 25716 KB Output is correct
13 Correct 17 ms 25852 KB Output is correct
14 Correct 18 ms 25844 KB Output is correct
15 Correct 31 ms 26100 KB Output is correct
16 Correct 90 ms 27208 KB Output is correct
17 Correct 83 ms 55272 KB Output is correct
18 Correct 69 ms 55604 KB Output is correct
19 Correct 72 ms 57392 KB Output is correct
20 Correct 95 ms 58504 KB Output is correct
21 Correct 211 ms 59792 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24140 KB Output is correct
2 Correct 22 ms 24268 KB Output is correct
3 Correct 56 ms 24808 KB Output is correct
4 Correct 103 ms 25540 KB Output is correct
5 Correct 23 ms 28048 KB Output is correct
6 Correct 35 ms 28208 KB Output is correct
7 Correct 76 ms 28864 KB Output is correct
8 Correct 137 ms 29676 KB Output is correct
9 Correct 49 ms 41660 KB Output is correct
10 Correct 59 ms 41872 KB Output is correct
11 Correct 142 ms 42496 KB Output is correct
12 Correct 198 ms 43412 KB Output is correct
13 Correct 95 ms 58708 KB Output is correct
14 Correct 96 ms 59624 KB Output is correct
15 Correct 163 ms 60372 KB Output is correct
16 Correct 259 ms 61236 KB Output is correct
17 Correct 202 ms 59864 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 63268 KB Output is correct
2 Correct 387 ms 63328 KB Output is correct
3 Correct 310 ms 63320 KB Output is correct
4 Correct 323 ms 63404 KB Output is correct
5 Correct 310 ms 62872 KB Output is correct
6 Correct 296 ms 61188 KB Output is correct
7 Correct 342 ms 65768 KB Output is correct
8 Correct 379 ms 65760 KB Output is correct
9 Correct 377 ms 65736 KB Output is correct
10 Correct 341 ms 65692 KB Output is correct
11 Correct 341 ms 65176 KB Output is correct
12 Correct 365 ms 62736 KB Output is correct
13 Correct 421 ms 69508 KB Output is correct
14 Correct 407 ms 69548 KB Output is correct
15 Correct 394 ms 69564 KB Output is correct
16 Correct 414 ms 69436 KB Output is correct
17 Correct 415 ms 68616 KB Output is correct
18 Correct 383 ms 64244 KB Output is correct
19 Correct 394 ms 69376 KB Output is correct
20 Correct 425 ms 69364 KB Output is correct
21 Correct 432 ms 69516 KB Output is correct
22 Correct 416 ms 69388 KB Output is correct
23 Correct 409 ms 68508 KB Output is correct
24 Correct 365 ms 64240 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 14 ms 23768 KB Output is correct
3 Correct 16 ms 23756 KB Output is correct
4 Correct 14 ms 23780 KB Output is correct
5 Correct 16 ms 23840 KB Output is correct
6 Correct 14 ms 23756 KB Output is correct
7 Correct 14 ms 23792 KB Output is correct
8 Correct 13 ms 23756 KB Output is correct
9 Correct 13 ms 23796 KB Output is correct
10 Correct 14 ms 23800 KB Output is correct
11 Correct 13 ms 23788 KB Output is correct
12 Correct 14 ms 23792 KB Output is correct
13 Correct 13 ms 23788 KB Output is correct
14 Correct 14 ms 23756 KB Output is correct
15 Correct 14 ms 23884 KB Output is correct
16 Correct 15 ms 23788 KB Output is correct
17 Correct 16 ms 23772 KB Output is correct
18 Correct 13 ms 23856 KB Output is correct
19 Correct 18 ms 24140 KB Output is correct
20 Correct 19 ms 24200 KB Output is correct
21 Correct 19 ms 24216 KB Output is correct
22 Correct 19 ms 24172 KB Output is correct
23 Correct 22 ms 26024 KB Output is correct
24 Correct 23 ms 26056 KB Output is correct
25 Correct 23 ms 26108 KB Output is correct
26 Correct 24 ms 26316 KB Output is correct
27 Correct 14 ms 23848 KB Output is correct
28 Correct 14 ms 23884 KB Output is correct
29 Correct 16 ms 23860 KB Output is correct
30 Correct 23 ms 24012 KB Output is correct
31 Correct 58 ms 24928 KB Output is correct
32 Correct 13 ms 23732 KB Output is correct
33 Correct 17 ms 23884 KB Output is correct
34 Correct 14 ms 23884 KB Output is correct
35 Correct 15 ms 23916 KB Output is correct
36 Correct 25 ms 24232 KB Output is correct
37 Correct 69 ms 25216 KB Output is correct
38 Correct 18 ms 25716 KB Output is correct
39 Correct 17 ms 25852 KB Output is correct
40 Correct 18 ms 25844 KB Output is correct
41 Correct 31 ms 26100 KB Output is correct
42 Correct 90 ms 27208 KB Output is correct
43 Correct 83 ms 55272 KB Output is correct
44 Correct 69 ms 55604 KB Output is correct
45 Correct 72 ms 57392 KB Output is correct
46 Correct 95 ms 58504 KB Output is correct
47 Correct 211 ms 59792 KB Output is correct
48 Correct 18 ms 24140 KB Output is correct
49 Correct 22 ms 24268 KB Output is correct
50 Correct 56 ms 24808 KB Output is correct
51 Correct 103 ms 25540 KB Output is correct
52 Correct 23 ms 28048 KB Output is correct
53 Correct 35 ms 28208 KB Output is correct
54 Correct 76 ms 28864 KB Output is correct
55 Correct 137 ms 29676 KB Output is correct
56 Correct 49 ms 41660 KB Output is correct
57 Correct 59 ms 41872 KB Output is correct
58 Correct 142 ms 42496 KB Output is correct
59 Correct 198 ms 43412 KB Output is correct
60 Correct 95 ms 58708 KB Output is correct
61 Correct 96 ms 59624 KB Output is correct
62 Correct 163 ms 60372 KB Output is correct
63 Correct 259 ms 61236 KB Output is correct
64 Correct 202 ms 59864 KB Output is correct
65 Correct 297 ms 63268 KB Output is correct
66 Correct 387 ms 63328 KB Output is correct
67 Correct 310 ms 63320 KB Output is correct
68 Correct 323 ms 63404 KB Output is correct
69 Correct 310 ms 62872 KB Output is correct
70 Correct 296 ms 61188 KB Output is correct
71 Correct 342 ms 65768 KB Output is correct
72 Correct 379 ms 65760 KB Output is correct
73 Correct 377 ms 65736 KB Output is correct
74 Correct 341 ms 65692 KB Output is correct
75 Correct 341 ms 65176 KB Output is correct
76 Correct 365 ms 62736 KB Output is correct
77 Correct 421 ms 69508 KB Output is correct
78 Correct 407 ms 69548 KB Output is correct
79 Correct 394 ms 69564 KB Output is correct
80 Correct 414 ms 69436 KB Output is correct
81 Correct 415 ms 68616 KB Output is correct
82 Correct 383 ms 64244 KB Output is correct
83 Correct 394 ms 69376 KB Output is correct
84 Correct 425 ms 69364 KB Output is correct
85 Correct 432 ms 69516 KB Output is correct
86 Correct 416 ms 69388 KB Output is correct
87 Correct 409 ms 68508 KB Output is correct
88 Correct 365 ms 64240 KB Output is correct
89 Correct 321 ms 62340 KB Output is correct
90 Correct 297 ms 62700 KB Output is correct
91 Correct 351 ms 63968 KB Output is correct
92 Correct 326 ms 64008 KB Output is correct
93 Correct 391 ms 66220 KB Output is correct
94 Correct 412 ms 65388 KB Output is correct
95 Correct 423 ms 66916 KB Output is correct
96 Correct 412 ms 65960 KB Output is correct
97 Correct 417 ms 66780 KB Output is correct
98 Correct 408 ms 68608 KB Output is correct
99 Correct 401 ms 66632 KB Output is correct
100 Correct 399 ms 66524 KB Output is correct