oj.uz

답안 #102659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102659 2019-03-26T13:40:38 Z psmao Cake 3 (JOI19_cake3) C++14
100 / 100
 1325 ms 123768 KB 
#include <bits/stdc++.h>
using namespace std;

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#ifdef MPS
#define D(x...) printf(x)
#else
#define D(x...)
#endif
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}

const int maxn = 200050;
const int _L = 1;
const int _R = 1e9;

int n, m, rt[maxn], tot;
int ls[maxn*40], rs[maxn*40], nd[maxn*40];
ll sum[maxn*40];
ll ans = -INF;
struct cake{int v, c;}c[maxn];

bool cmp(cake a, cake b)
{
	return a.c < b.c;
}
void upd(int &now, int pre, int p, int l = 1, int r = 1000000000)
{
	now = ++ tot;
	nd[now] = nd[pre] + 1; sum[now] = sum[pre] + p;
	if(l == r) return;
	int mid = l + r >> 1;
	if(p <= mid) upd(ls[now], ls[pre], p, l, mid), rs[now] = rs[pre];
	else upd(rs[now], rs[pre], p, mid+1, r), ls[now] = ls[pre];
}
ll query(int now, int pre, int num, int l = 1, int r = 1000000000)
{
	if(!now || !num) return 0;
	if(l == r) return num * 1ll * l;
	int mid = l + r >> 1, c = nd[rs[now]] - nd[rs[pre]];
	if(c == num) return sum[rs[now]] - sum[rs[pre]];
	else if(c < num) return sum[rs[now]] - sum[rs[pre]] + query(ls[now], ls[pre], num - c, l, mid);
	else return query(rs[now], rs[pre], num, mid+1, r);
}
ll ask(int l, int r)
{
	return query(rt[r], rt[l-1], m);
}
void solve(int l, int r, int ll, int rr)
{
	if(l > r) return;
	int mid = l + r >> 1, p = 1;
	long long best = -INF;
	fo(i, ll, rr)
		if(mid - i + 1 >= m)
		{
			long long v = ask(i, mid) - (c[mid].c - c[i].c)*2;
			if(best < v)
			{
				best = v;
				p = i;
			}
		}
	ans = max(ans, best);
	solve(l, mid-1, ll, p);
	solve(mid+1, r, p, rr);
}
int main()
{
	#ifdef MPS	
		fp("1.in","r",stdin);
		fp("1.out","w",stdout);
	#endif
	sf("%d%d",&n,&m);
	fo(i,1,n) sf("%d%d",&c[i].v,&c[i].c);
	sort(c+1,c+n+1,cmp);
	fo(i,1,n) upd(rt[i], rt[i-1], c[i].v);
	solve(1, n, 1, n);
	pf("%lld\n",ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'void upd(int&, int, int, int, int)':
cake3.cpp:52:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1;
            ~~^~~
cake3.cpp: In function 'll query(int, int, int, int, int)':
cake3.cpp:60:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1, c = nd[rs[now]] - nd[rs[pre]];
            ~~^~~
cake3.cpp: In function 'void solve(int, int, int, int)':
cake3.cpp:72:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1, p = 1;
            ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:94:4: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  sf("%d%d",&n,&m);
    ^
cake3.cpp:95:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,n) sf("%d%d",&c[i].v,&c[i].c);
              ^

Subtask #1
5.0 / 5.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 7 ms 1536 KB Output is correct
39 Correct 6 ms 1536 KB Output is correct
40 Correct 6 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 1536 KB Output is correct
44 Correct 5 ms 1536 KB Output is correct
45 Correct 5 ms 1536 KB Output is correct
46 Correct 6 ms 1536 KB Output is correct
47 Correct 5 ms 1536 KB Output is correct
48 Correct 5 ms 1536 KB Output is correct
49 Correct 5 ms 1664 KB Output is correct
50 Correct 5 ms 1536 KB Output is correct
51 Correct 5 ms 1600 KB Output is correct
52 Correct 5 ms 1536 KB Output is correct
53 Correct 5 ms 1536 KB Output is correct
54 Correct 6 ms 1636 KB Output is correct
55 Correct 5 ms 1536 KB Output is correct
56 Correct 4 ms 1536 KB Output is correct
57 Correct 4 ms 1536 KB Output is correct
58 Correct 4 ms 1536 KB Output is correct
59 Correct 5 ms 1536 KB Output is correct
60 Correct 7 ms 1564 KB Output is correct
61 Correct 5 ms 1536 KB Output is correct
62 Correct 5 ms 1536 KB Output is correct
63 Correct 6 ms 1664 KB Output is correct
64 Correct 6 ms 1536 KB Output is correct
65 Correct 6 ms 1536 KB Output is correct
66 Correct 6 ms 1536 KB Output is correct
67 Correct 6 ms 1536 KB Output is correct
68 Correct 7 ms 1536 KB Output is correct
69 Correct 6 ms 1536 KB Output is correct
70 Correct 7 ms 1536 KB Output is correct
71 Correct 6 ms 1536 KB Output is correct
72 Correct 6 ms 1664 KB Output is correct
73 Correct 4 ms 1536 KB Output is correct
74 Correct 5 ms 1664 KB Output is correct
75 Correct 1325 ms 115252 KB Output is correct
76 Correct 1238 ms 112232 KB Output is correct
77 Correct 1126 ms 115656 KB Output is correct
78 Correct 1169 ms 117240 KB Output is correct
79 Correct 394 ms 117748 KB Output is correct
80 Correct 509 ms 114552 KB Output is correct
81 Correct 821 ms 116656 KB Output is correct
82 Correct 940 ms 118136 KB Output is correct
83 Correct 827 ms 122144 KB Output is correct
84 Correct 875 ms 121780 KB Output is correct
85 Correct 732 ms 117744 KB Output is correct
86 Correct 415 ms 113888 KB Output is correct
87 Correct 422 ms 112120 KB Output is correct
88 Correct 690 ms 111428 KB Output is correct
89 Correct 674 ms 117808 KB Output is correct
90 Correct 546 ms 123100 KB Output is correct
91 Correct 391 ms 113872 KB Output is correct
92 Correct 372 ms 113016 KB Output is correct
93 Correct 436 ms 117844 KB Output is correct
94 Correct 379 ms 123096 KB Output is correct
95 Correct 418 ms 123164 KB Output is correct
96 Correct 371 ms 111148 KB Output is correct
97 Correct 347 ms 123768 KB Output is correct
98 Correct 368 ms 121836 KB Output is correct
99 Correct 325 ms 122104 KB Output is correct
100 Correct 338 ms 115260 KB Output is correct
101 Correct 332 ms 115192 KB Output is correct
102 Correct 719 ms 115168 KB Output is correct
103 Correct 625 ms 113528 KB Output is correct
104 Correct 803 ms 119672 KB Output is correct
105 Correct 489 ms 119288 KB Output is correct
106 Correct 627 ms 122360 KB Output is correct
107 Correct 476 ms 118116 KB Output is correct
108 Correct 1192 ms 116872 KB Output is correct
109 Correct 972 ms 123768 KB Output is correct
110 Correct 291 ms 116032 KB Output is correct
111 Correct 419 ms 117340 KB Output is correct
112 Correct 1244 ms 111772 KB Output is correct
113 Correct 377 ms 123668 KB Output is correct