oj.uz

답안 #123226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123226 2019-06-30T13:54:15 Z MvC Cake 3 (JOI19_cake3) C++11
100 / 100
 859 ms 104288 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[100*nmax],lch[100*nmax],rch[100*nmax];
pair<ll,int>st[100*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 376 KB Output is correct
2 Correct 2 ms 376 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 376 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 376 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 376 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 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 376 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 376 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 376 KB Output is correct
38 Correct 5 ms 1016 KB Output is correct
39 Correct 5 ms 1144 KB Output is correct
40 Correct 4 ms 1144 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 5 ms 1144 KB Output is correct
46 Correct 5 ms 1144 KB Output is correct
47 Correct 5 ms 1016 KB Output is correct
48 Correct 5 ms 1016 KB Output is correct
49 Correct 4 ms 1124 KB Output is correct
50 Correct 4 ms 1144 KB Output is correct
51 Correct 4 ms 1144 KB Output is correct
52 Correct 4 ms 1144 KB Output is correct
53 Correct 4 ms 1144 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 1144 KB Output is correct
57 Correct 4 ms 1144 KB Output is correct
58 Correct 4 ms 1144 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 1020 KB Output is correct
62 Correct 4 ms 1144 KB Output is correct
63 Correct 4 ms 1144 KB Output is correct
64 Correct 4 ms 1144 KB Output is correct
65 Correct 4 ms 1148 KB Output is correct
66 Correct 4 ms 1084 KB Output is correct
67 Correct 4 ms 1144 KB Output is correct
68 Correct 4 ms 1144 KB Output is correct
69 Correct 4 ms 1016 KB Output is correct
70 Correct 4 ms 1144 KB Output is correct
71 Correct 4 ms 1040 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 376 KB Output is correct
2 Correct 2 ms 376 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 376 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 376 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 376 KB Output is correct
38 Correct 5 ms 1016 KB Output is correct
39 Correct 5 ms 1144 KB Output is correct
40 Correct 4 ms 1144 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 5 ms 1144 KB Output is correct
46 Correct 5 ms 1144 KB Output is correct
47 Correct 5 ms 1016 KB Output is correct
48 Correct 5 ms 1016 KB Output is correct
49 Correct 4 ms 1124 KB Output is correct
50 Correct 4 ms 1144 KB Output is correct
51 Correct 4 ms 1144 KB Output is correct
52 Correct 4 ms 1144 KB Output is correct
53 Correct 4 ms 1144 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 1144 KB Output is correct
57 Correct 4 ms 1144 KB Output is correct
58 Correct 4 ms 1144 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 1020 KB Output is correct
62 Correct 4 ms 1144 KB Output is correct
63 Correct 4 ms 1144 KB Output is correct
64 Correct 4 ms 1144 KB Output is correct
65 Correct 4 ms 1148 KB Output is correct
66 Correct 4 ms 1084 KB Output is correct
67 Correct 4 ms 1144 KB Output is correct
68 Correct 4 ms 1144 KB Output is correct
69 Correct 4 ms 1016 KB Output is correct
70 Correct 4 ms 1144 KB Output is correct
71 Correct 4 ms 1040 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 819 ms 97024 KB Output is correct
76 Correct 859 ms 94200 KB Output is correct
77 Correct 735 ms 97144 KB Output is correct
78 Correct 777 ms 98680 KB Output is correct
79 Correct 295 ms 99064 KB Output is correct
80 Correct 312 ms 95964 KB Output is correct
81 Correct 652 ms 98168 KB Output is correct
82 Correct 808 ms 99576 KB Output is correct
83 Correct 739 ms 102892 KB Output is correct
84 Correct 758 ms 102488 KB Output is correct
85 Correct 659 ms 98856 KB Output is correct
86 Correct 429 ms 95480 KB Output is correct
87 Correct 435 ms 94120 KB Output is correct
88 Correct 639 ms 93480 KB Output is correct
89 Correct 599 ms 99064 KB Output is correct
90 Correct 457 ms 103660 KB Output is correct
91 Correct 345 ms 95736 KB Output is correct
92 Correct 351 ms 94656 KB Output is correct
93 Correct 409 ms 98936 KB Output is correct
94 Correct 346 ms 103544 KB Output is correct
95 Correct 444 ms 103672 KB Output is correct
96 Correct 319 ms 95992 KB Output is correct
97 Correct 385 ms 103928 KB Output is correct
98 Correct 352 ms 102136 KB Output is correct
99 Correct 331 ms 102524 KB Output is correct
100 Correct 289 ms 96248 KB Output is correct
101 Correct 289 ms 96476 KB Output is correct
102 Correct 605 ms 96552 KB Output is correct
103 Correct 553 ms 94968 KB Output is correct
104 Correct 681 ms 100540 KB Output is correct
105 Correct 573 ms 100160 KB Output is correct
106 Correct 546 ms 103036 KB Output is correct
107 Correct 495 ms 99296 KB Output is correct
108 Correct 769 ms 98184 KB Output is correct
109 Correct 655 ms 104288 KB Output is correct
110 Correct 307 ms 97268 KB Output is correct
111 Correct 369 ms 98376 KB Output is correct
112 Correct 574 ms 93688 KB Output is correct
113 Correct 314 ms 104220 KB Output is correct