oj.uz

답안 #553871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553871 2022-04-27T08:18:32 Z MilosMilutinovic Cake 3 (JOI19_cake3) C++14
100 / 100
 617 ms 82724 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=200050;
const int M=20*N;
int n,m,c[N],v[N],ord[N],vv[N];
int root[N],ls[M],rs[M],tsz,cc[M];
ll ans,st[M];
PII pp[N];

void modify(int p,int&c,int l,int r,int i,int v) {
	c=++tsz;ls[c]=ls[p];rs[c]=rs[p];st[c]=st[p]+v;cc[c]=cc[p]+1;
	if (l==r) return;
	int mid=(l+r)/2;
	if (i<=mid) modify(ls[p],ls[c],l,mid,i,v);
	else modify(rs[p],rs[c],mid+1,r,i,v);
}

ll query(int p,int c,int l,int r,int x) {
	if (!c) return 0ll;
	if (l==r) {return x>=1?st[c]-st[p]:0ll;}
	int mid=(l+r)/2;
	if (cc[rs[c]]-cc[rs[p]]<x) return st[rs[c]]-st[rs[p]]+query(ls[p],ls[c],l,mid,x-(cc[rs[c]]-cc[rs[p]]));
	else return query(rs[p],rs[c],mid+1,r,x);
}

void solve(int l,int r,int tl,int tr) {
	if (l>r) return;
	int mid=(l+r)/2;
	int opt=tl;
	ll mx=(ll)-1e18;
	rep(i,tl,min(tr+1,mid-m+2)) {
		ll cs=query(root[i-1],root[mid],1,n,m)-(c[mid]-c[i])*2;
		if (cs>mx) mx=cs,opt=i;
	}
	ans=max(ans,mx);
	solve(l,mid-1,tl,opt);
	solve(mid+1,r,opt,tr);
}

int main() {
	scanf("%d%d",&n,&m);
	rep(i,1,n+1) scanf("%d%d",v+i,c+i);
	rep(i,1,n+1) pp[i]=mp(c[i],v[i]);
	sort(pp+1,pp+1+n);
	rep(i,1,n+1) v[i]=pp[i].se,c[i]=pp[i].fi;
	rep(i,1,n+1) ord[i]=i;
	sort(ord+1,ord+1+n,[&](int i,int j){return v[i]<v[j];});
	rep(i,1,n+1) vv[ord[i]]=i;
	rep(i,1,n+1) {
		modify(root[i-1],root[i],1,n,vv[i],v[i]);
	}
	ans=-1e18;
	solve(1,n,1,n);
	printf("%lld",ans);
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
cake3.cpp:62:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |  rep(i,1,n+1) scanf("%d%d",v+i,c+i);
      |               ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 2 ms 852 KB Output is correct
39 Correct 3 ms 880 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Correct 2 ms 852 KB Output is correct
42 Correct 2 ms 876 KB Output is correct
43 Correct 2 ms 852 KB Output is correct
44 Correct 2 ms 836 KB Output is correct
45 Correct 3 ms 852 KB Output is correct
46 Correct 2 ms 852 KB Output is correct
47 Correct 2 ms 852 KB Output is correct
48 Correct 3 ms 852 KB Output is correct
49 Correct 2 ms 836 KB Output is correct
50 Correct 2 ms 852 KB Output is correct
51 Correct 2 ms 852 KB Output is correct
52 Correct 2 ms 852 KB Output is correct
53 Correct 2 ms 876 KB Output is correct
54 Correct 2 ms 852 KB Output is correct
55 Correct 2 ms 852 KB Output is correct
56 Correct 2 ms 852 KB Output is correct
57 Correct 2 ms 840 KB Output is correct
58 Correct 2 ms 852 KB Output is correct
59 Correct 2 ms 852 KB Output is correct
60 Correct 2 ms 872 KB Output is correct
61 Correct 2 ms 840 KB Output is correct
62 Correct 2 ms 852 KB Output is correct
63 Correct 2 ms 876 KB Output is correct
64 Correct 2 ms 852 KB Output is correct
65 Correct 2 ms 852 KB Output is correct
66 Correct 2 ms 852 KB Output is correct
67 Correct 2 ms 852 KB Output is correct
68 Correct 2 ms 852 KB Output is correct
69 Correct 2 ms 852 KB Output is correct
70 Correct 2 ms 852 KB Output is correct
71 Correct 2 ms 856 KB Output is correct
72 Correct 1 ms 852 KB Output is correct
73 Correct 2 ms 884 KB Output is correct
74 Correct 2 ms 868 KB Output is correct
75 Correct 589 ms 76960 KB Output is correct
76 Correct 604 ms 74612 KB Output is correct
77 Correct 516 ms 77136 KB Output is correct
78 Correct 552 ms 78328 KB Output is correct
79 Correct 189 ms 78616 KB Output is correct
80 Correct 205 ms 76060 KB Output is correct
81 Correct 511 ms 76980 KB Output is correct
82 Correct 617 ms 78104 KB Output is correct
83 Correct 588 ms 80752 KB Output is correct
84 Correct 600 ms 80540 KB Output is correct
85 Correct 521 ms 77584 KB Output is correct
86 Correct 262 ms 74856 KB Output is correct
87 Correct 277 ms 73960 KB Output is correct
88 Correct 448 ms 73248 KB Output is correct
89 Correct 420 ms 77628 KB Output is correct
90 Correct 282 ms 81416 KB Output is correct
91 Correct 215 ms 74972 KB Output is correct
92 Correct 216 ms 74228 KB Output is correct
93 Correct 241 ms 77616 KB Output is correct
94 Correct 215 ms 81372 KB Output is correct
95 Correct 292 ms 81408 KB Output is correct
96 Correct 263 ms 75240 KB Output is correct
97 Correct 277 ms 81720 KB Output is correct
98 Correct 286 ms 80396 KB Output is correct
99 Correct 259 ms 80592 KB Output is correct
100 Correct 228 ms 75640 KB Output is correct
101 Correct 233 ms 75748 KB Output is correct
102 Correct 505 ms 75796 KB Output is correct
103 Correct 464 ms 74660 KB Output is correct
104 Correct 527 ms 79004 KB Output is correct
105 Correct 391 ms 78836 KB Output is correct
106 Correct 446 ms 80920 KB Output is correct
107 Correct 381 ms 77876 KB Output is correct
108 Correct 517 ms 77692 KB Output is correct
109 Correct 426 ms 82508 KB Output is correct
110 Correct 205 ms 75712 KB Output is correct
111 Correct 295 ms 76500 KB Output is correct
112 Correct 229 ms 72908 KB Output is correct
113 Correct 172 ms 82724 KB Output is correct