oj.uz

답안 #913897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
913897 2024-01-20T12:49:39 Z Trisanu_Das 모임들 (IOI18_meetings) C++17
100 / 100
 3667 ms 337976 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
const int mxN=7.5e5;
int n, q;
array<int, 2> a[20][mxN];
vector<ll> ans;
vector<int> ta[mxN], ql, qr;
array<ll, 2> st[1<<21], lz[1<<21];
 
array<int, 2> lca(int l, int r) {
	int k=31-__builtin_clz(r-l+1);
	return max(a[k][l], a[k][r-(1<<k)+1]);
}
 
void app(int i, array<ll, 2> x, int l2, int r2) {
	if(x[0]) {
		st[i]={l2*x[0], r2*x[0]};
		lz[i]={x[0], 0};
	}
	st[i][0]+=x[1];
	st[i][1]+=x[1];
	lz[i][1]+=x[1];
}
 
void psh(int i, int l2, int m2, int r2) {
	app(2*i, lz[i], l2, m2);
	app(2*i+1, lz[i], m2+1, r2);
	lz[i]={};
}
 
void upd(int l1, int r1, array<ll, 2> x, bool f, int i=1, int l2=0, int r2=n-1) {
	if(l1<=l2&&r2<=r1) {
		if(f||r2*x[0]+x[1]<st[i][1]) {
			app(i, x, l2, r2);
			return;
		} else if(l2*x[0]+x[1]>=st[i][0])
			return;
	}
	int m2=(l2+r2)/2;
	psh(i, l2, m2, r2);
	if(l1<=m2)
		upd(l1, r1, x, f, 2*i, l2, m2);
	if(m2<r1)
		upd(l1, r1, x, f, 2*i+1, m2+1, r2);
	st[i]={st[2*i][0], st[2*i+1][1]};
}
 
ll qry(int l1, int i=1, int l2=0, int r2=n-1) {
	if(l2==r2)
		return st[i][0];
	int m2=(l2+r2)/2;
	psh(i, l2, m2, r2);
	return l1<=m2?qry(l1, 2*i, l2, m2):qry(l1, 2*i+1, m2+1, r2);
}
 
int dfs(int l=0, int r=n-1) {
	if(l>r)
		return -1;
	int u=abs(lca(l, r)[1]), lc=dfs(l, u-1), rc=dfs(u+1, r);
	upd(u, u, {1, -u}, 1);
	for(int i : ta[u])
		ans[i]=min(qry(qr[i])+(u-ql[i]+1ll)*a[0][u][0], ans[i]);
	upd(u, r, {0, (u-l+1ll)*a[0][u][0]}, 1);
	upd(u, r, {a[0][u][0], (~lc?qry(u-1):0)-(u-1ll)*a[0][u][0]}, 0);
	return u;
}
 
vector<ll> minimum_costs(vector<int> h, vector<int> l, vector<int> r) {
	n=h.size(), q=l.size();
	for(int i=0; i<n; ++i)
		a[0][i]={h[i], i};
	for(int k=1; k<20; ++k)
		for(int i=0; i<=n-(1<<k); ++i)
			a[k][i]=max(a[k-1][i], a[k-1][i+(1<<k-1)]);
	ql=l, qr=r;
	ans=vector<ll>(q, 1e18);
	for(int i=0; i<q; ++i) {
		int w=lca(l[i], r[i])[1];
		ta[w].push_back(i);
	}
	dfs();
	reverse(ta, ta+n);
	for(int i=0; i<q; ++i)
		tie(ql[i], qr[i])=make_pair(n-1-qr[i], n-1-ql[i]);
	for(int i=0; i<n; ++i)
		a[0][i]={h[n-1-i], -i};
	for(int k=1; k<20; ++k)
		for(int i=0; i<=n-(1<<k); ++i)
			a[k][i]=max(a[k-1][i], a[k-1][i+(1<<k-1)]);
	dfs();
	return ans;
}

Compilation message

meetings.cpp: In function 'int dfs(int, int)':
meetings.cpp:63:43: warning: unused variable 'rc' [-Wunused-variable]
   63 |  int u=abs(lca(l, r)[1]), lc=dfs(l, u-1), rc=dfs(u+1, r);
      |                                           ^~
meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:78:41: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   78 |    a[k][i]=max(a[k-1][i], a[k-1][i+(1<<k-1)]);
      |                                        ~^~
meetings.cpp:93:41: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   93 |    a[k][i]=max(a[k-1][i], a[k-1][i+(1<<k-1)]);
      |                                        ~^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 22876 KB Output is correct
2 Correct 14 ms 45508 KB Output is correct
3 Correct 17 ms 45672 KB Output is correct
4 Correct 14 ms 45660 KB Output is correct
5 Correct 15 ms 45660 KB Output is correct
6 Correct 15 ms 45876 KB Output is correct
7 Correct 18 ms 45660 KB Output is correct
8 Correct 16 ms 45916 KB Output is correct
9 Correct 13 ms 45660 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 22876 KB Output is correct
2 Correct 14 ms 45508 KB Output is correct
3 Correct 17 ms 45672 KB Output is correct
4 Correct 14 ms 45660 KB Output is correct
5 Correct 15 ms 45660 KB Output is correct
6 Correct 15 ms 45876 KB Output is correct
7 Correct 18 ms 45660 KB Output is correct
8 Correct 16 ms 45916 KB Output is correct
9 Correct 13 ms 45660 KB Output is correct
10 Correct 21 ms 52056 KB Output is correct
11 Correct 20 ms 52060 KB Output is correct
12 Correct 21 ms 52060 KB Output is correct
13 Correct 22 ms 52056 KB Output is correct
14 Correct 21 ms 52316 KB Output is correct
15 Correct 20 ms 52248 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 22876 KB Output is correct
2 Correct 59 ms 54736 KB Output is correct
3 Correct 303 ms 87140 KB Output is correct
4 Correct 269 ms 81828 KB Output is correct
5 Correct 294 ms 88924 KB Output is correct
6 Correct 300 ms 89436 KB Output is correct
7 Correct 307 ms 89680 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 22876 KB Output is correct
2 Correct 59 ms 54736 KB Output is correct
3 Correct 303 ms 87140 KB Output is correct
4 Correct 269 ms 81828 KB Output is correct
5 Correct 294 ms 88924 KB Output is correct
6 Correct 300 ms 89436 KB Output is correct
7 Correct 307 ms 89680 KB Output is correct
8 Correct 280 ms 82236 KB Output is correct
9 Correct 249 ms 84168 KB Output is correct
10 Correct 271 ms 84512 KB Output is correct
11 Correct 265 ms 83816 KB Output is correct
12 Correct 248 ms 83540 KB Output is correct
13 Correct 260 ms 83968 KB Output is correct
14 Correct 270 ms 89180 KB Output is correct
15 Correct 272 ms 83564 KB Output is correct
16 Correct 311 ms 89336 KB Output is correct

Subtask #5
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 22876 KB Output is correct
2 Correct 14 ms 45508 KB Output is correct
3 Correct 17 ms 45672 KB Output is correct
4 Correct 14 ms 45660 KB Output is correct
5 Correct 15 ms 45660 KB Output is correct
6 Correct 15 ms 45876 KB Output is correct
7 Correct 18 ms 45660 KB Output is correct
8 Correct 16 ms 45916 KB Output is correct
9 Correct 13 ms 45660 KB Output is correct
10 Correct 21 ms 52056 KB Output is correct
11 Correct 20 ms 52060 KB Output is correct
12 Correct 21 ms 52060 KB Output is correct
13 Correct 22 ms 52056 KB Output is correct
14 Correct 21 ms 52316 KB Output is correct
15 Correct 20 ms 52248 KB Output is correct
16 Correct 6 ms 22876 KB Output is correct
17 Correct 59 ms 54736 KB Output is correct
18 Correct 303 ms 87140 KB Output is correct
19 Correct 269 ms 81828 KB Output is correct
20 Correct 294 ms 88924 KB Output is correct
21 Correct 300 ms 89436 KB Output is correct
22 Correct 307 ms 89680 KB Output is correct
23 Correct 280 ms 82236 KB Output is correct
24 Correct 249 ms 84168 KB Output is correct
25 Correct 271 ms 84512 KB Output is correct
26 Correct 265 ms 83816 KB Output is correct
27 Correct 248 ms 83540 KB Output is correct
28 Correct 260 ms 83968 KB Output is correct
29 Correct 270 ms 89180 KB Output is correct
30 Correct 272 ms 83564 KB Output is correct
31 Correct 311 ms 89336 KB Output is correct
32 Correct 2470 ms 257928 KB Output is correct
33 Correct 2093 ms 258116 KB Output is correct
34 Correct 2334 ms 258032 KB Output is correct
35 Correct 2473 ms 259300 KB Output is correct
36 Correct 2090 ms 258612 KB Output is correct
37 Correct 2282 ms 258204 KB Output is correct
38 Correct 3060 ms 299120 KB Output is correct
39 Correct 3080 ms 299296 KB Output is correct
40 Correct 2702 ms 263712 KB Output is correct
41 Correct 3351 ms 334648 KB Output is correct
42 Correct 3667 ms 337796 KB Output is correct
43 Correct 3608 ms 337976 KB Output is correct
44 Correct 3285 ms 298760 KB Output is correct