oj.uz

답안 #620245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620245 2022-08-03T04:18:44 Z Zanite Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 352 ms 65552 KB 
#include <bits/stdc++.h>
using namespace std;

using ll	= long long;
using pll	= pair<ll, ll>;
using Edge	= pair<ll, pll>;

#define fi	first
#define se	second

const int maxN	= 1e5 + 5;

const ll INF	= 1e18;

ll n, q, w;
vector<pll> adj[maxN];
vector<Edge> edges;

ll timer;
ll dist[maxN], tin[maxN], tout[maxN];
vector<ll> Euler(1);

void dfs(ll cur, ll par, ll cdist) {
	dist[cur] = cdist;
	Euler.push_back(cur);
	tin[cur] = (ll)Euler.size() - 1;

	for (auto &[nxt, w] : adj[cur]) {
		if (nxt == par) continue;
		dfs(nxt, cur, cdist+w);

		Euler.push_back(cur);
	}

	tout[cur] = (ll)Euler.size() - 1;
}

struct Segtree {
	struct Node {
		// max(dist[x] - 2dist[y] + dist[z])
		// A = dist[x] or dist[z]
		// B = -2dist[y]

		ll A, B, AB, BA, ABA, lazy;

		Node() {}

		Node(ll val) {
			A = val;
			B = -2ll * val;
			AB = BA = ABA = -INF;
			lazy = 0;
		}

		void print() {
			#define _ << ' ' <<
			cout << A _ B _ AB _ BA _ ABA _ lazy << '\n';
		}
	};

	ll sz;
	vector<Node> seg;

	Segtree(ll sz) : sz(sz) {
		seg.assign((sz << 2) + 1, Node());
	}

	void updateNode(ll pos, ll val) {
		Node &C = seg[pos];

		C.A += val;
		C.B -= 2ll * val;
		C.AB -= val;
		C.BA -= val;
		C.lazy += val;
	}

	void checkLazy(ll pos) {
		if (seg[pos].lazy != 0) {
			ll lc = pos << 1, rc = lc | 1;
			updateNode(lc, seg[pos].lazy);
			updateNode(rc, seg[pos].lazy);
			seg[pos].lazy = 0;
		}
	}

	Node merge(Node L, Node R) {
		Node N = Node(0);

		N.A = max(L.A, R.A);
		N.B = max(L.B, R.B);

		N.AB = max({
			L.AB,
			R.AB,
			L.A + R.B
		});

		N.BA = max({
			L.BA,
			R.BA,
			L.B + R.A
		});

		N.ABA = max({
			L.ABA,
			R.ABA,
			L.A + R.BA,
			L.AB + R.A
		});

		//cout << "Merged:\n";
		//L.print(); R.print(); N.print();

		return N;
	}

	void build(ll pos, ll l, ll r) {
		if (l == r) {
			//cerr << pos << ' ' << l << ' ' << Euler[l] << ' ' << dist[Euler[l]] << '\n';
			seg[pos] = Node(dist[Euler[l]]);
			return;
		}

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		build(lc, l, m);
		build(rc, m+1, r);
		seg[pos] = merge(seg[lc], seg[rc]);
	}
	void build() {build(1, 1, sz);}

	void update(ll pos, ll l, ll r, ll ul, ll ur, ll val) {
		if (l > r || ul > ur || l > ur || ul > r) return;
		if (ul <= l && r <= ur) {
			updateNode(pos, val);
			return;
		}

		checkLazy(pos);

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		update(lc, l, m, ul, ur, val);
		update(rc, m+1, r, ul, ur, val);
		seg[pos] = merge(seg[lc], seg[rc]);
	}
	void update(ll ul, ll ur, ll val) {update(1, 1, sz, ul, ur, val);}

	ll query(ll pos, ll l, ll r, ll idx) {
		cerr << pos << ' ' << l << ' ' << r << ' ' << idx << '\n';
		if (l == r) {
			return seg[pos].A;
		}

		checkLazy(pos);

		ll m = (l+r) >> 1, lc = pos << 1, rc = lc | 1;
		if (idx <= m) {
			return query(lc, l, m, idx);
		} else {
			return query(rc, m+1, r, idx);
		}
	}

	ll query() {
		return max({seg[1].ABA, seg[1].AB, seg[1].BA});
	}

	void print() {
		for (ll i = 1; i <= sz; i++) {
			cout << query(1, 1, sz, i) << ' ';
		}
		cout << '\n';
	}

	void print2() {
		for (ll i = 1; i <= 13; i++) {cout << i << ": "; seg[i].print();}
		cout << "\n";
	}
};

int main() {
	scanf("%lld %lld %lld", &n, &q, &w);
	for (ll a, b, c, i = 1; i < n; i++) {
		scanf("%lld %lld %lld", &a, &b, &c);
		adj[a].push_back({b, c});
		adj[b].push_back({a, c});

		edges.push_back({c, {a, b}});
	}
	dfs(1, 0, 0);

	//for (auto i : Euler) {cout << i << ' ';} cout << '\n';

	ll ES = (ll)Euler.size() - 1;
	/*
	for (ll i = 1; i <= n; i++) {
		cout << tin[i] << ' ' << tout[i] << ' ' << dist[i] << '\n';
	}
	*/

	Segtree S(ES);
	S.build();
	for (auto &[cw, p] : edges) {
		if (tin[p.se] < tin[p.fi]) {swap(p.fi, p.se);}
	}

	ll last = 0;
	for (ll d, e, i = 1; i <= q; i++) {
		scanf("%lld %lld", &d, &e);
		d = (d + last) % (n - 1);
		e = (e + last) % w;

		//cout << d << ' ' << e << '\n';

		auto &[cw, p] = edges[d];

		S.update(tin[p.se], tout[p.se], e - cw);
		cw = e;

		//S.print2();

		last = S.query();
		printf("%lld\n", last);
	}
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2616 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2656 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2616 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2656 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 6 ms 3156 KB Output is correct
20 Correct 5 ms 3156 KB Output is correct
21 Correct 6 ms 3156 KB Output is correct
22 Correct 6 ms 3284 KB Output is correct
23 Correct 8 ms 5356 KB Output is correct
24 Correct 8 ms 5356 KB Output is correct
25 Correct 9 ms 5476 KB Output is correct
26 Correct 16 ms 5716 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 3 ms 2664 KB Output is correct
4 Correct 9 ms 2876 KB Output is correct
5 Correct 41 ms 3708 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2900 KB Output is correct
8 Correct 2 ms 2900 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 12 ms 3184 KB Output is correct
11 Correct 52 ms 4300 KB Output is correct
12 Correct 5 ms 5284 KB Output is correct
13 Correct 7 ms 5288 KB Output is correct
14 Correct 5 ms 5268 KB Output is correct
15 Correct 16 ms 5584 KB Output is correct
16 Correct 69 ms 6720 KB Output is correct
17 Correct 71 ms 54444 KB Output is correct
18 Correct 73 ms 54432 KB Output is correct
19 Correct 77 ms 54352 KB Output is correct
20 Correct 80 ms 54736 KB Output is correct
21 Correct 191 ms 56056 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3184 KB Output is correct
2 Correct 9 ms 3284 KB Output is correct
3 Correct 34 ms 3788 KB Output is correct
4 Correct 68 ms 4560 KB Output is correct
5 Correct 9 ms 7980 KB Output is correct
6 Correct 16 ms 8136 KB Output is correct
7 Correct 49 ms 8736 KB Output is correct
8 Correct 123 ms 9400 KB Output is correct
9 Correct 36 ms 29136 KB Output is correct
10 Correct 41 ms 29224 KB Output is correct
11 Correct 83 ms 29612 KB Output is correct
12 Correct 127 ms 29936 KB Output is correct
13 Correct 69 ms 55036 KB Output is correct
14 Correct 92 ms 54984 KB Output is correct
15 Correct 112 ms 55340 KB Output is correct
16 Correct 183 ms 55648 KB Output is correct
17 Correct 143 ms 55564 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 249 ms 56212 KB Output is correct
2 Correct 239 ms 56308 KB Output is correct
3 Correct 257 ms 59452 KB Output is correct
4 Correct 227 ms 59420 KB Output is correct
5 Correct 226 ms 59256 KB Output is correct
6 Correct 213 ms 59072 KB Output is correct
7 Correct 291 ms 61760 KB Output is correct
8 Correct 233 ms 61812 KB Output is correct
9 Correct 251 ms 61848 KB Output is correct
10 Correct 263 ms 61812 KB Output is correct
11 Correct 250 ms 61660 KB Output is correct
12 Correct 214 ms 60796 KB Output is correct
13 Correct 259 ms 65528 KB Output is correct
14 Correct 262 ms 65528 KB Output is correct
15 Correct 309 ms 65504 KB Output is correct
16 Correct 341 ms 65552 KB Output is correct
17 Correct 317 ms 64980 KB Output is correct
18 Correct 261 ms 62228 KB Output is correct
19 Correct 286 ms 65472 KB Output is correct
20 Correct 255 ms 65536 KB Output is correct
21 Correct 302 ms 65516 KB Output is correct
22 Correct 352 ms 65452 KB Output is correct
23 Correct 307 ms 64932 KB Output is correct
24 Correct 294 ms 62200 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2616 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2656 KB Output is correct
12 Correct 3 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 6 ms 3156 KB Output is correct
20 Correct 5 ms 3156 KB Output is correct
21 Correct 6 ms 3156 KB Output is correct
22 Correct 6 ms 3284 KB Output is correct
23 Correct 8 ms 5356 KB Output is correct
24 Correct 8 ms 5356 KB Output is correct
25 Correct 9 ms 5476 KB Output is correct
26 Correct 16 ms 5716 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 3 ms 2664 KB Output is correct
30 Correct 9 ms 2876 KB Output is correct
31 Correct 41 ms 3708 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2900 KB Output is correct
34 Correct 2 ms 2900 KB Output is correct
35 Correct 3 ms 2900 KB Output is correct
36 Correct 12 ms 3184 KB Output is correct
37 Correct 52 ms 4300 KB Output is correct
38 Correct 5 ms 5284 KB Output is correct
39 Correct 7 ms 5288 KB Output is correct
40 Correct 5 ms 5268 KB Output is correct
41 Correct 16 ms 5584 KB Output is correct
42 Correct 69 ms 6720 KB Output is correct
43 Correct 71 ms 54444 KB Output is correct
44 Correct 73 ms 54432 KB Output is correct
45 Correct 77 ms 54352 KB Output is correct
46 Correct 80 ms 54736 KB Output is correct
47 Correct 191 ms 56056 KB Output is correct
48 Correct 4 ms 3184 KB Output is correct
49 Correct 9 ms 3284 KB Output is correct
50 Correct 34 ms 3788 KB Output is correct
51 Correct 68 ms 4560 KB Output is correct
52 Correct 9 ms 7980 KB Output is correct
53 Correct 16 ms 8136 KB Output is correct
54 Correct 49 ms 8736 KB Output is correct
55 Correct 123 ms 9400 KB Output is correct
56 Correct 36 ms 29136 KB Output is correct
57 Correct 41 ms 29224 KB Output is correct
58 Correct 83 ms 29612 KB Output is correct
59 Correct 127 ms 29936 KB Output is correct
60 Correct 69 ms 55036 KB Output is correct
61 Correct 92 ms 54984 KB Output is correct
62 Correct 112 ms 55340 KB Output is correct
63 Correct 183 ms 55648 KB Output is correct
64 Correct 143 ms 55564 KB Output is correct
65 Correct 249 ms 56212 KB Output is correct
66 Correct 239 ms 56308 KB Output is correct
67 Correct 257 ms 59452 KB Output is correct
68 Correct 227 ms 59420 KB Output is correct
69 Correct 226 ms 59256 KB Output is correct
70 Correct 213 ms 59072 KB Output is correct
71 Correct 291 ms 61760 KB Output is correct
72 Correct 233 ms 61812 KB Output is correct
73 Correct 251 ms 61848 KB Output is correct
74 Correct 263 ms 61812 KB Output is correct
75 Correct 250 ms 61660 KB Output is correct
76 Correct 214 ms 60796 KB Output is correct
77 Correct 259 ms 65528 KB Output is correct
78 Correct 262 ms 65528 KB Output is correct
79 Correct 309 ms 65504 KB Output is correct
80 Correct 341 ms 65552 KB Output is correct
81 Correct 317 ms 64980 KB Output is correct
82 Correct 261 ms 62228 KB Output is correct
83 Correct 286 ms 65472 KB Output is correct
84 Correct 255 ms 65536 KB Output is correct
85 Correct 302 ms 65516 KB Output is correct
86 Correct 352 ms 65452 KB Output is correct
87 Correct 307 ms 64932 KB Output is correct
88 Correct 294 ms 62200 KB Output is correct
89 Correct 257 ms 58384 KB Output is correct
90 Correct 226 ms 58768 KB Output is correct
91 Correct 276 ms 59996 KB Output is correct
92 Correct 286 ms 59984 KB Output is correct
93 Correct 283 ms 62300 KB Output is correct
94 Correct 332 ms 61556 KB Output is correct
95 Correct 335 ms 62944 KB Output is correct
96 Correct 275 ms 62048 KB Output is correct
97 Correct 297 ms 62816 KB Output is correct
98 Correct 259 ms 64744 KB Output is correct
99 Correct 289 ms 62632 KB Output is correct
100 Correct 264 ms 62584 KB Output is correct