oj.uz

답안 #120797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120797 2019-06-25T13:59:29 Z imyujin Cake 3 (JOI19_cake3) C++14
100 / 100
 1104 ms 188720 KB 
#include<stdio.h>
#include<algorithm>

using namespace std;

#define MAXN 200005

typedef long long lint;
typedef pair<lint, lint> pll;
typedef pair<lint, int> pli;

struct NOD{
	NOD *lef, *rig;
	int cnt;
	lint sum;

	NOD();
} *nil, *pst[MAXN];

NOD::NOD(){
	lef=rig=nil;
	cnt=0;
	sum=0ll;
}

const lint LINF=1ll<<50;
int N, M;
pll CV[MAXN];
pli vs[MAXN];
int vidx[MAXN];
lint dp[MAXN];

void mkpst(NOD *bf, NOD *nw, int l, int r, int x){
	//printf("mkpst(%d %d %d %lld)\n", l, r, x, vs[x].first);
	//printf("%d", bf==nil?1:0);
	//printf("%d", bf->cnt);
	nw->cnt=bf->cnt+1;
	nw->sum=bf->sum+vs[x].first;
	if(l==r) return;
	int m=(l+r)/2;
	if(x<=m){
		nw->lef=new NOD();
		nw->rig=bf->rig;
		mkpst(bf->lef, nw->lef, l, m, x);
	}
	else{
		nw->lef=bf->lef;
		nw->rig=new NOD();
		mkpst(bf->rig, nw->rig, m+1, r, x);
	}
}

lint gpst(NOD *pa, NOD *pb, int l, int r, int k){
	//printf("gpst(l=%d, r=%d, k=%d)\n", l, r, k);
	if(k==0) return 0ll;
	if(k >= pb->cnt - pa->cnt) return pb->sum - pa->sum;
	int m=(l+r)/2;
	int cr=pb->rig->cnt - pa->rig->cnt;
	if(cr>=k) return gpst(pa->rig, pb->rig, m+1, r, k);
	else return pb->rig->sum - pa->rig->sum + gpst(pa->lef, pb->lef, l, m, k-cr);
}

void dnc(int al, int ar, int bl, int br){
	//printf("dnc(al=%d, ar=%d, bl=%d, br=%d)\n", al, ar, bl, br);
	if(ar<al) return;
	int am=(al+ar)/2, bm;
	lint sum;
	dp[am]=-LINF;
	for(int i=max(bl, am+M-1); i<=br; i++){
		int s=1, e=N;
		lint ndp=gpst(pst[am], pst[i-1], 1, N, M-2)+2*CV[am].first-2*CV[i].first+CV[am].second+CV[i].second;
		//printf("ndp(i=%d)=%lld\n", i, ndp);
		if(ndp>dp[am]){
			dp[am]=ndp;
			bm=i;
		}
	}
	//printf("dp[%d]=%lld, bm=%d\n", am, dp[am], bm);
	if(al<ar){
		dnc(al, am-1, bl, bm);
		dnc(am+1, ar, bm, br);
	}
}

int main(){
	lint ans=-LINF;

	scanf("%d%d", &N, &M);
	for(int i=1; i<=N; i++) scanf("%lld%lld", &CV[i].second, &CV[i].first);

	sort(CV+1, CV+N+1);
	for(int i=1; i<=N; i++) vs[i]=make_pair(CV[i].second, i);
	sort(vs+1, vs+N+1);
	for(int i=1; i<=N; i++) vidx[vs[i].second]=i;

	//for(int i=1; i<=N; i++) printf("%d ", vidx[i]);
	//printf("\n");

	nil=new NOD();
	nil->lef=nil->rig=nil;

	pst[0]=nil;
	//printf("%d", nil->cnt);
	for(int i=1; i<=N; i++){
		pst[i]=new NOD();
		mkpst(pst[i-1], pst[i], 1, N, vidx[i]);
	}

	dnc(1, N-M+1, M, N);
	for(int i=1; i<=N-M+1; i++) ans=max(ans, dp[i]);

	printf("%lld", ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'void dnc(int, int, int, int)':
cake3.cpp:70:7: warning: unused variable 's' [-Wunused-variable]
   int s=1, e=N;
       ^
cake3.cpp:70:12: warning: unused variable 'e' [-Wunused-variable]
   int s=1, e=N;
            ^
cake3.cpp:67:7: warning: unused variable 'sum' [-Wunused-variable]
  lint sum;
       ^~~
cake3.cpp: In function 'int main()':
cake3.cpp:88:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
cake3.cpp:89:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%lld%lld", &CV[i].second, &CV[i].first);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp: In function 'void dnc(int, int, int, int)':
cake3.cpp:80:6: warning: 'bm' may be used uninitialized in this function [-Wmaybe-uninitialized]
   dnc(al, am-1, bl, bm);
   ~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 5 ms 1536 KB Output is correct
39 Correct 5 ms 1536 KB Output is correct
40 Correct 5 ms 1536 KB Output is correct
41 Correct 5 ms 1536 KB Output is correct
42 Correct 5 ms 1536 KB Output is correct
43 Correct 5 ms 1408 KB Output is correct
44 Correct 5 ms 1408 KB Output is correct
45 Correct 5 ms 1536 KB Output is correct
46 Correct 5 ms 1536 KB Output is correct
47 Correct 5 ms 1536 KB Output is correct
48 Correct 6 ms 1536 KB Output is correct
49 Correct 5 ms 1536 KB Output is correct
50 Correct 5 ms 1536 KB Output is correct
51 Correct 5 ms 1508 KB Output is correct
52 Correct 4 ms 1536 KB Output is correct
53 Correct 5 ms 1536 KB Output is correct
54 Correct 4 ms 1536 KB Output is correct
55 Correct 4 ms 1536 KB Output is correct
56 Correct 4 ms 1664 KB Output is correct
57 Correct 4 ms 1536 KB Output is correct
58 Correct 5 ms 1536 KB Output is correct
59 Correct 5 ms 1536 KB Output is correct
60 Correct 4 ms 1536 KB Output is correct
61 Correct 5 ms 1536 KB Output is correct
62 Correct 4 ms 1536 KB Output is correct
63 Correct 4 ms 1536 KB Output is correct
64 Correct 4 ms 1536 KB Output is correct
65 Correct 5 ms 1536 KB Output is correct
66 Correct 5 ms 1536 KB Output is correct
67 Correct 5 ms 1536 KB Output is correct
68 Correct 4 ms 1536 KB Output is correct
69 Correct 4 ms 1536 KB Output is correct
70 Correct 4 ms 1536 KB Output is correct
71 Correct 4 ms 1508 KB Output is correct
72 Correct 4 ms 1536 KB Output is correct
73 Correct 5 ms 1536 KB Output is correct
74 Correct 4 ms 1536 KB Output is correct
75 Correct 1076 ms 175704 KB Output is correct
76 Correct 1104 ms 170840 KB Output is correct
77 Correct 972 ms 175824 KB Output is correct
78 Correct 1022 ms 178804 KB Output is correct
79 Correct 455 ms 178552 KB Output is correct
80 Correct 478 ms 173248 KB Output is correct
81 Correct 761 ms 176888 KB Output is correct
82 Correct 932 ms 179732 KB Output is correct
83 Correct 914 ms 185992 KB Output is correct
84 Correct 902 ms 185464 KB Output is correct
85 Correct 808 ms 178424 KB Output is correct
86 Correct 544 ms 171740 KB Output is correct
87 Correct 567 ms 169432 KB Output is correct
88 Correct 712 ms 168568 KB Output is correct
89 Correct 720 ms 178420 KB Output is correct
90 Correct 589 ms 186872 KB Output is correct
91 Correct 479 ms 171868 KB Output is correct
92 Correct 492 ms 170488 KB Output is correct
93 Correct 521 ms 178296 KB Output is correct
94 Correct 666 ms 186376 KB Output is correct
95 Correct 570 ms 187256 KB Output is correct
96 Correct 479 ms 173304 KB Output is correct
97 Correct 515 ms 187936 KB Output is correct
98 Correct 536 ms 185080 KB Output is correct
99 Correct 483 ms 185208 KB Output is correct
100 Correct 418 ms 173944 KB Output is correct
101 Correct 431 ms 173944 KB Output is correct
102 Correct 840 ms 174580 KB Output is correct
103 Correct 814 ms 171744 KB Output is correct
104 Correct 1016 ms 181916 KB Output is correct
105 Correct 826 ms 180936 KB Output is correct
106 Correct 805 ms 185976 KB Output is correct
107 Correct 667 ms 178884 KB Output is correct
108 Correct 998 ms 177660 KB Output is correct
109 Correct 904 ms 188720 KB Output is correct
110 Correct 429 ms 174756 KB Output is correct
111 Correct 513 ms 177016 KB Output is correct
112 Correct 887 ms 168368 KB Output is correct
113 Correct 460 ms 188404 KB Output is correct