oj.uz

Submission #204950

# Submission time Handle Problem Language Result Execution time Memory
204950 2020-02-27T14:57:36 Z cheetose Cake 3 (JOI19_cake3) C++11
100 / 100
 1940 ms 18784 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 42043;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

Pll tree[524288];
VPll vv;
int b[200000];
void upd(int node, int S, int E, int k,int c)
{
	if (S == E)
	{
		if(c>0)tree[node]=mp(1,vv[k].X);
		else tree[node]=mp(0,0);
		return;
	}
	if (k <= (S + E) / 2)upd(node * 2, S, (S + E) / 2, k,c);
	else upd(node * 2 + 1, (S + E) / 2 + 1, E, k,c);
	tree[node].X=tree[node<<1].X+tree[node<<1|1].X;
	tree[node].Y=tree[node<<1].Y+tree[node<<1|1].Y;
}

ll find(int node, int S, int E, int k)
{
	if (tree[node].X==k)return tree[node].Y;
	if(tree[node<<1|1].X<k)return tree[node<<1|1].Y+find(node<<1,S,S+E>>1,k-tree[node<<1|1].X);
	return find(node<<1|1,(S+E>>1)+1,E,k);
}
Pll p[200000];
int n,m;
int L,R;
void ins(int i)
{
	upd(1,0,n-1,b[i],1);
}
void era(int i)
{
	upd(1,0,n-1,b[i],-1);
}
ll f(int l,int r)
{
	if(r-l+1<m-2)return -INF;
	while(r>R)ins(++R);
	while(L>l)ins(--L);
	while(r<R)era(R--);
	while(L<l)era(L++);
	return find(1,0,n-1,m-2);
}
ll g(int S,int E,int l,int r)
{
	S=max(S,l+m-1);
	if(S>E)return -INF;
	int M=S+E>>1;
	ll res=-INF;
	int w=-1;
	fdn(i,min(r,M-m+1),l,1)
	{
		ll tmp=f(i+1,M-1)+p[i].X+p[M].X-2*(p[M].Y-p[i].Y);
		if(tmp>res)res=tmp,w=i;
	}
	return max({res,g(M+1,E,w,r),g(S,M-1,l,w)});
}
int main() {
	scanf("%d%d",&n,&m);
	L=R=n-1>>1;
	R--;
	fup(i,0,n-1,1)scanf("%lld%lld",&p[i].X,&p[i].Y);
	sort(p,p+n,[&](Pll p1,Pll p2){return p1.Y<p2.Y;});
	fup(i,0,n-1,1)vv.pb(mp(p[i].X,i));
	sort(ALL(vv));
	fup(i,0,n-1,1)b[vv[i].Y]=i;
	printf("%lld\n",g(0,n-1,0,n-1));
}

Compilation message

cake3.cpp: In function 'll find(int, int, int, int)':
cake3.cpp:64:66: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  if(tree[node<<1|1].X<k)return tree[node<<1|1].Y+find(node<<1,S,S+E>>1,k-tree[node<<1|1].X);
                                                                 ~^~
cake3.cpp:65:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  return find(node<<1|1,(S+E>>1)+1,E,k);
                         ~^~
cake3.cpp: In function 'll g(int, int, int, int)':
cake3.cpp:91:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int M=S+E>>1;
        ~^~
cake3.cpp: In function 'int main()':
cake3.cpp:103:7: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  L=R=n-1>>1;
      ~^~
cake3.cpp:102: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:105:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,0,n-1,1)scanf("%lld%lld",&p[i].X,&p[i].Y);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 380 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 380 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 10 ms 504 KB Output is correct
39 Correct 11 ms 504 KB Output is correct
40 Correct 9 ms 504 KB Output is correct
41 Correct 8 ms 504 KB Output is correct
42 Correct 7 ms 504 KB Output is correct
43 Correct 8 ms 504 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 10 ms 504 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 11 ms 504 KB Output is correct
48 Correct 10 ms 504 KB Output is correct
49 Correct 9 ms 504 KB Output is correct
50 Correct 9 ms 504 KB Output is correct
51 Correct 9 ms 632 KB Output is correct
52 Correct 9 ms 504 KB Output is correct
53 Correct 9 ms 580 KB Output is correct
54 Correct 8 ms 504 KB Output is correct
55 Correct 7 ms 504 KB Output is correct
56 Correct 7 ms 508 KB Output is correct
57 Correct 7 ms 504 KB Output is correct
58 Correct 7 ms 504 KB Output is correct
59 Correct 8 ms 504 KB Output is correct
60 Correct 9 ms 504 KB Output is correct
61 Correct 9 ms 584 KB Output is correct
62 Correct 7 ms 504 KB Output is correct
63 Correct 8 ms 504 KB Output is correct
64 Correct 8 ms 504 KB Output is correct
65 Correct 10 ms 504 KB Output is correct
66 Correct 9 ms 504 KB Output is correct
67 Correct 10 ms 504 KB Output is correct
68 Correct 9 ms 632 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Correct 9 ms 504 KB Output is correct
72 Correct 8 ms 508 KB Output is correct
73 Correct 10 ms 504 KB Output is correct
74 Correct 6 ms 504 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 380 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 380 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 380 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 5 ms 376 KB Output is correct
38 Correct 10 ms 504 KB Output is correct
39 Correct 11 ms 504 KB Output is correct
40 Correct 9 ms 504 KB Output is correct
41 Correct 8 ms 504 KB Output is correct
42 Correct 7 ms 504 KB Output is correct
43 Correct 8 ms 504 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 10 ms 504 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 11 ms 504 KB Output is correct
48 Correct 10 ms 504 KB Output is correct
49 Correct 9 ms 504 KB Output is correct
50 Correct 9 ms 504 KB Output is correct
51 Correct 9 ms 632 KB Output is correct
52 Correct 9 ms 504 KB Output is correct
53 Correct 9 ms 580 KB Output is correct
54 Correct 8 ms 504 KB Output is correct
55 Correct 7 ms 504 KB Output is correct
56 Correct 7 ms 508 KB Output is correct
57 Correct 7 ms 504 KB Output is correct
58 Correct 7 ms 504 KB Output is correct
59 Correct 8 ms 504 KB Output is correct
60 Correct 9 ms 504 KB Output is correct
61 Correct 9 ms 584 KB Output is correct
62 Correct 7 ms 504 KB Output is correct
63 Correct 8 ms 504 KB Output is correct
64 Correct 8 ms 504 KB Output is correct
65 Correct 10 ms 504 KB Output is correct
66 Correct 9 ms 504 KB Output is correct
67 Correct 10 ms 504 KB Output is correct
68 Correct 9 ms 632 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Correct 9 ms 504 KB Output is correct
72 Correct 8 ms 508 KB Output is correct
73 Correct 10 ms 504 KB Output is correct
74 Correct 6 ms 504 KB Output is correct
75 Correct 1625 ms 18284 KB Output is correct
76 Correct 1940 ms 18268 KB Output is correct
77 Correct 1358 ms 18396 KB Output is correct
78 Correct 1484 ms 18524 KB Output is correct
79 Correct 182 ms 18780 KB Output is correct
80 Correct 299 ms 18396 KB Output is correct
81 Correct 1355 ms 18236 KB Output is correct
82 Correct 1779 ms 18268 KB Output is correct
83 Correct 1614 ms 18652 KB Output is correct
84 Correct 1676 ms 18524 KB Output is correct
85 Correct 1410 ms 18396 KB Output is correct
86 Correct 797 ms 17884 KB Output is correct
87 Correct 887 ms 17756 KB Output is correct
88 Correct 1213 ms 17756 KB Output is correct
89 Correct 1171 ms 18272 KB Output is correct
90 Correct 862 ms 18784 KB Output is correct
91 Correct 531 ms 17916 KB Output is correct
92 Correct 557 ms 17756 KB Output is correct
93 Correct 661 ms 18140 KB Output is correct
94 Correct 451 ms 18524 KB Output is correct
95 Correct 801 ms 18652 KB Output is correct
96 Correct 635 ms 17884 KB Output is correct
97 Correct 656 ms 18652 KB Output is correct
98 Correct 674 ms 18396 KB Output is correct
99 Correct 635 ms 18528 KB Output is correct
100 Correct 494 ms 17884 KB Output is correct
101 Correct 526 ms 17884 KB Output is correct
102 Correct 1214 ms 17884 KB Output is correct
103 Correct 1120 ms 17756 KB Output is correct
104 Correct 1320 ms 18268 KB Output is correct
105 Correct 947 ms 18268 KB Output is correct
106 Correct 1032 ms 18268 KB Output is correct
107 Correct 818 ms 18140 KB Output is correct
108 Correct 1271 ms 18012 KB Output is correct
109 Correct 1000 ms 18396 KB Output is correct
110 Correct 598 ms 17500 KB Output is correct
111 Correct 863 ms 17500 KB Output is correct
112 Correct 1466 ms 17116 KB Output is correct
113 Correct 180 ms 18268 KB Output is correct