oj.uz

답안 #123228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123228 2019-06-30T13:55:13 Z MvC Cake 3 (JOI19_cake3) C++11
100 / 100
 908 ms 103824 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "rail.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int nds,i,n,m,rt[70*nmax],lch[70*nmax],rch[70*nmax];
pair<ll,int>st[70*nmax];
pair<pair<ll,ll>,int>a[nmax];
ll ans=-llinf;
int nlf(pair<ll,int>x)
{
	int p=++nds;
	lch[p]=rch[p]=0;
	st[p]=x;
	return p;
}
int npr(int l,int r)
{
	int p=++nds;
	lch[p]=l,rch[p]=r;
	st[p].fr=st[l].fr+st[r].fr;
	st[p].sc=st[l].sc+st[r].sc;
	return p;
}
int build(int l,int r)
{
	if(l==r)return nlf(mkp(0,0));
	int mid=(l+r)/2;
	return npr(build(l,mid),build(mid+1,r));
}
int upd(int nod,int l,int r,int p,ll v)
{
	if(l==r)return nlf(mkp(v,1));
	int mid=(l+r)/2;
	if(p<=mid)return npr(upd(lch[nod],l,mid,p,v),rch[nod]);
	else return npr(lch[nod],upd(rch[nod],mid+1,r,p,v));
}
ll qry(int nod,int old,int k)
{
	if(st[nod].sc-st[old].sc==k)return st[nod].fr-st[old].fr;
	if(st[lch[nod]].sc-st[lch[old]].sc>=k)return qry(lch[nod],lch[old],k);
	else return st[lch[nod]].fr-st[lch[old]].fr+qry(rch[nod],rch[old],k-(st[lch[nod]].sc-st[lch[old]].sc));
}
void rec(int l,int r,int opl,int opr)
{
	if(l>r)return;
	int mid=(l+r)/2,bst=opl;
	ll s,val=-llinf;
	for(int i=max(opl,mid+m-1);i<=opr;i++)
	{
		s=qry(rt[i],rt[mid-1],m)-2LL*(a[i].fr.fr-a[mid].fr.fr);
		if(s>val)
		{
			val=s;
			bst=i;
		}
	}
	ans=max(ans,val);
	rec(l,mid-1,opl,bst);
	rec(mid+1,r,bst,opr);
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=1;i<=n;i++)cin>>a[i].fr.fr>>a[i].fr.sc;
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	for(i=1;i<=n;i++)
	{
		a[i].sc=i;
		swap(a[i].fr.sc,a[i].fr.fr);
	}
	sort(a+1,a+n+1);
	rt[0]=build(1,n);
	for(i=1;i<=n;i++)
	{
		rt[i]=upd(rt[i-1],1,n,a[i].sc,a[i].fr.sc);
	}
	rec(1,n-m+1,1,n);
	cout<<ans<<endl;
    return 0;
}

Compilation message

cake3.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
cake3.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 424 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 504 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 424 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 5 ms 1144 KB Output is correct
39 Correct 5 ms 1144 KB Output is correct
40 Correct 4 ms 1088 KB Output is correct
41 Correct 4 ms 1144 KB Output is correct
42 Correct 4 ms 1144 KB Output is correct
43 Correct 4 ms 1016 KB Output is correct
44 Correct 4 ms 1016 KB Output is correct
45 Correct 4 ms 1144 KB Output is correct
46 Correct 5 ms 1144 KB Output is correct
47 Correct 5 ms 1144 KB Output is correct
48 Correct 5 ms 1036 KB Output is correct
49 Correct 4 ms 1144 KB Output is correct
50 Correct 4 ms 1144 KB Output is correct
51 Correct 4 ms 1020 KB Output is correct
52 Correct 4 ms 1016 KB Output is correct
53 Correct 4 ms 1016 KB Output is correct
54 Correct 4 ms 1144 KB Output is correct
55 Correct 4 ms 1144 KB Output is correct
56 Correct 4 ms 1020 KB Output is correct
57 Correct 4 ms 1016 KB Output is correct
58 Correct 4 ms 1016 KB Output is correct
59 Correct 4 ms 1016 KB Output is correct
60 Correct 4 ms 1144 KB Output is correct
61 Correct 4 ms 1144 KB Output is correct
62 Correct 4 ms 1144 KB Output is correct
63 Correct 4 ms 1156 KB Output is correct
64 Correct 4 ms 1116 KB Output is correct
65 Correct 4 ms 1144 KB Output is correct
66 Correct 4 ms 1020 KB Output is correct
67 Correct 5 ms 1144 KB Output is correct
68 Correct 4 ms 1144 KB Output is correct
69 Correct 4 ms 1144 KB Output is correct
70 Correct 4 ms 1016 KB Output is correct
71 Correct 4 ms 1016 KB Output is correct
72 Correct 4 ms 1144 KB Output is correct
73 Correct 4 ms 1016 KB Output is correct
74 Correct 4 ms 1144 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 424 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 420 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 5 ms 1144 KB Output is correct
39 Correct 5 ms 1144 KB Output is correct
40 Correct 4 ms 1088 KB Output is correct
41 Correct 4 ms 1144 KB Output is correct
42 Correct 4 ms 1144 KB Output is correct
43 Correct 4 ms 1016 KB Output is correct
44 Correct 4 ms 1016 KB Output is correct
45 Correct 4 ms 1144 KB Output is correct
46 Correct 5 ms 1144 KB Output is correct
47 Correct 5 ms 1144 KB Output is correct
48 Correct 5 ms 1036 KB Output is correct
49 Correct 4 ms 1144 KB Output is correct
50 Correct 4 ms 1144 KB Output is correct
51 Correct 4 ms 1020 KB Output is correct
52 Correct 4 ms 1016 KB Output is correct
53 Correct 4 ms 1016 KB Output is correct
54 Correct 4 ms 1144 KB Output is correct
55 Correct 4 ms 1144 KB Output is correct
56 Correct 4 ms 1020 KB Output is correct
57 Correct 4 ms 1016 KB Output is correct
58 Correct 4 ms 1016 KB Output is correct
59 Correct 4 ms 1016 KB Output is correct
60 Correct 4 ms 1144 KB Output is correct
61 Correct 4 ms 1144 KB Output is correct
62 Correct 4 ms 1144 KB Output is correct
63 Correct 4 ms 1156 KB Output is correct
64 Correct 4 ms 1116 KB Output is correct
65 Correct 4 ms 1144 KB Output is correct
66 Correct 4 ms 1020 KB Output is correct
67 Correct 5 ms 1144 KB Output is correct
68 Correct 4 ms 1144 KB Output is correct
69 Correct 4 ms 1144 KB Output is correct
70 Correct 4 ms 1016 KB Output is correct
71 Correct 4 ms 1016 KB Output is correct
72 Correct 4 ms 1144 KB Output is correct
73 Correct 4 ms 1016 KB Output is correct
74 Correct 4 ms 1144 KB Output is correct
75 Correct 908 ms 96560 KB Output is correct
76 Correct 842 ms 93888 KB Output is correct
77 Correct 722 ms 96888 KB Output is correct
78 Correct 775 ms 98532 KB Output is correct
79 Correct 298 ms 98796 KB Output is correct
80 Correct 325 ms 95736 KB Output is correct
81 Correct 662 ms 98012 KB Output is correct
82 Correct 780 ms 99296 KB Output is correct
83 Correct 750 ms 102492 KB Output is correct
84 Correct 770 ms 102376 KB Output is correct
85 Correct 678 ms 98696 KB Output is correct
86 Correct 437 ms 95352 KB Output is correct
87 Correct 449 ms 93816 KB Output is correct
88 Correct 660 ms 93364 KB Output is correct
89 Correct 594 ms 98808 KB Output is correct
90 Correct 455 ms 103416 KB Output is correct
91 Correct 351 ms 95380 KB Output is correct
92 Correct 357 ms 94584 KB Output is correct
93 Correct 392 ms 98808 KB Output is correct
94 Correct 348 ms 103444 KB Output is correct
95 Correct 435 ms 103568 KB Output is correct
96 Correct 320 ms 95916 KB Output is correct
97 Correct 341 ms 103824 KB Output is correct
98 Correct 366 ms 102392 KB Output is correct
99 Correct 328 ms 102464 KB Output is correct
100 Correct 285 ms 96376 KB Output is correct
101 Correct 295 ms 96504 KB Output is correct
102 Correct 600 ms 96504 KB Output is correct
103 Correct 549 ms 95096 KB Output is correct
104 Correct 642 ms 100476 KB Output is correct
105 Correct 573 ms 99804 KB Output is correct
106 Correct 567 ms 102136 KB Output is correct
107 Correct 484 ms 98296 KB Output is correct
108 Correct 723 ms 97164 KB Output is correct
109 Correct 678 ms 103380 KB Output is correct
110 Correct 307 ms 96376 KB Output is correct
111 Correct 367 ms 97400 KB Output is correct
112 Correct 565 ms 92932 KB Output is correct
113 Correct 307 ms 103392 KB Output is correct