oj.uz

답안 #102617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102617 2019-03-26T09:38:54 Z hugo_pm Cake 3 (JOI19_cake3) C++17
100 / 100
 2417 ms 19780 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define form2(i, a, b) for (int i = (a); i < (b); ++i)
#define ford2(i, a, b) for (int i = (a-1); i >= b; --i)
#define form(i, n) form2(i, 0, n)
#define ford(i, n) ford2(i, n, 0)

#define chmax(x, v) x = max(x, (v))
#define chmin(x, v) x = min(x, (v))
#define fi first
#define se second

const long long BIG = 1000000000000000000LL;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

void cpr(string s, vector<int> v)
{ int i = 0; for (char c : s) { if (c == '$') cout << v[i++]; else cout << c; } cout << '\n'; }

void cpr(string s) { cpr(s, {}); }

void solve();
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	return 0;
}

const int borne = 201*1000;
int nbPieces, nbVoulu;
pii pieces[borne];
int rep = -BIG;

pii st[4*borne];
int otn[borne];
int gt[borne];

void upd(int nod, int il, int ir, int cible, int val)
{
	if (il == ir) {
		assert(il == cible);
		st[nod].fi += val*otn[il];
		st[nod].se += val;
		return;
	}
	int im = (il+ir)/2;
	if (cible <= im) upd(2*nod, il, im, cible, val);
	else upd(2*nod+1, im+1, ir, cible, val);
	st[nod].fi = st[2*nod].fi + st[2*nod+1].fi;
	st[nod].se = st[2*nod].se + st[2*nod+1].se;
}

int cl=0, cr=0;
pii walk(int nod, int il, int ir, int k)
{
	if (k == 0 || st[nod].se == 0) return {0,0};
	if (st[nod].se <= k) {
		return st[nod];
	}
	int im = (il+ir)/2;
	pii ret = walk(2*nod+1, im+1, ir, k);
	k -= ret.se;
	pii ret2 = walk(2*nod, il, im, k);
	ret.fi += ret2.fi;
	ret.se += ret2.se;
	return ret;
}

int func(int deb, int fin)
{
	if (fin < deb+nbVoulu-1) return -BIG;
	int ca = 2*(pieces[deb].fi - pieces[fin].fi);
	int nod = 1;

	while (cl < deb) { upd(nod, 0, nbPieces-1, gt[cl], -1); ++cl; } // suppr
	while (cl > deb) { --cl; upd(nod, 0, nbPieces-1, gt[cl], 1); } // rajout
	while (cr > fin) { upd(nod, 0, nbPieces-1, gt[cr], -1); --cr; } // suppr
	while (cr < fin) { ++cr; upd(nod, 0, nbPieces-1, gt[cr], 1); } // rajout

	assert(st[1].se == (fin-deb+1));
	ca += walk(nod, 0, nbPieces-1, nbVoulu).fi;
	return ca;
}

void calc(int il, int ir, int kl, int kr)
{
	if (il > ir) return;
	int im = (il+ir) / 2;
	int ca = -BIG-1, opt = kl;
	form2(k, kl, min(kr, ir)+1) {
		int nv = func(k, im);
		if (nv > ca) {
			ca = nv;
			opt = k;
		}
	}

	chmax(rep, ca);
	calc(il, im-1, kl, opt);
	calc(im+1, ir, opt, kr);
}

map<int, int> nto;

void solve()
{
	cin >> nbPieces >> nbVoulu;
	form(i, nbPieces) {
		// val, coul
		cin >> pieces[i].fi >> pieces[i].se; 
	}
	sort(pieces, pieces+nbPieces);
	vector<pair<pii, int>> oth;
	form(i, nbPieces) {
		// devient coul, val
		swap(pieces[i].fi, pieces[i].se);
		oth.push_back({pieces[i], i});
	}
	sort(oth.begin(), oth.end());
	sort(pieces, pieces+nbPieces);
	form(i, nbPieces) { gt[i] = oth[i].se; otn[gt[i]] = pieces[i].se; }
	sort(pieces, pieces+nbPieces);
	upd(1, 0, nbPieces-1, gt[0], 1);
	calc(0, nbPieces-1, 0, nbPieces-1);
	cout << rep << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 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 3 ms 384 KB Output is correct
11 Correct 3 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 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 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 3 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 3 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 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 512 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 3 ms 512 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 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 3 ms 384 KB Output is correct
11 Correct 3 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 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 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 3 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 3 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 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 512 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 3 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 9 ms 680 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 6 ms 640 KB Output is correct
42 Correct 6 ms 640 KB Output is correct
43 Correct 6 ms 640 KB Output is correct
44 Correct 9 ms 640 KB Output is correct
45 Correct 8 ms 640 KB Output is correct
46 Correct 8 ms 640 KB Output is correct
47 Correct 8 ms 640 KB Output is correct
48 Correct 8 ms 640 KB Output is correct
49 Correct 7 ms 640 KB Output is correct
50 Correct 7 ms 640 KB Output is correct
51 Correct 7 ms 640 KB Output is correct
52 Correct 6 ms 640 KB Output is correct
53 Correct 7 ms 640 KB Output is correct
54 Correct 6 ms 640 KB Output is correct
55 Correct 4 ms 640 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 4 ms 640 KB Output is correct
58 Correct 4 ms 512 KB Output is correct
59 Correct 5 ms 640 KB Output is correct
60 Correct 7 ms 640 KB Output is correct
61 Correct 6 ms 640 KB Output is correct
62 Correct 6 ms 640 KB Output is correct
63 Correct 6 ms 640 KB Output is correct
64 Correct 5 ms 640 KB Output is correct
65 Correct 10 ms 640 KB Output is correct
66 Correct 7 ms 640 KB Output is correct
67 Correct 8 ms 640 KB Output is correct
68 Correct 8 ms 640 KB Output is correct
69 Correct 7 ms 640 KB Output is correct
70 Correct 5 ms 640 KB Output is correct
71 Correct 6 ms 640 KB Output is correct
72 Correct 4 ms 640 KB Output is correct
73 Correct 6 ms 640 KB Output is correct
74 Correct 5 ms 640 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 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 3 ms 384 KB Output is correct
11 Correct 3 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 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 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 3 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 3 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 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 512 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 3 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 9 ms 680 KB Output is correct
40 Correct 6 ms 640 KB Output is correct
41 Correct 6 ms 640 KB Output is correct
42 Correct 6 ms 640 KB Output is correct
43 Correct 6 ms 640 KB Output is correct
44 Correct 9 ms 640 KB Output is correct
45 Correct 8 ms 640 KB Output is correct
46 Correct 8 ms 640 KB Output is correct
47 Correct 8 ms 640 KB Output is correct
48 Correct 8 ms 640 KB Output is correct
49 Correct 7 ms 640 KB Output is correct
50 Correct 7 ms 640 KB Output is correct
51 Correct 7 ms 640 KB Output is correct
52 Correct 6 ms 640 KB Output is correct
53 Correct 7 ms 640 KB Output is correct
54 Correct 6 ms 640 KB Output is correct
55 Correct 4 ms 640 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 4 ms 640 KB Output is correct
58 Correct 4 ms 512 KB Output is correct
59 Correct 5 ms 640 KB Output is correct
60 Correct 7 ms 640 KB Output is correct
61 Correct 6 ms 640 KB Output is correct
62 Correct 6 ms 640 KB Output is correct
63 Correct 6 ms 640 KB Output is correct
64 Correct 5 ms 640 KB Output is correct
65 Correct 10 ms 640 KB Output is correct
66 Correct 7 ms 640 KB Output is correct
67 Correct 8 ms 640 KB Output is correct
68 Correct 8 ms 640 KB Output is correct
69 Correct 7 ms 640 KB Output is correct
70 Correct 5 ms 640 KB Output is correct
71 Correct 6 ms 640 KB Output is correct
72 Correct 4 ms 640 KB Output is correct
73 Correct 6 ms 640 KB Output is correct
74 Correct 5 ms 640 KB Output is correct
75 Correct 2225 ms 19032 KB Output is correct
76 Correct 2417 ms 18740 KB Output is correct
77 Correct 1764 ms 18904 KB Output is correct
78 Correct 1919 ms 19160 KB Output is correct
79 Correct 225 ms 19160 KB Output is correct
80 Correct 350 ms 19008 KB Output is correct
81 Correct 1658 ms 19160 KB Output is correct
82 Correct 2136 ms 19176 KB Output is correct
83 Correct 2007 ms 19548 KB Output is correct
84 Correct 2144 ms 19644 KB Output is correct
85 Correct 1702 ms 19160 KB Output is correct
86 Correct 851 ms 18764 KB Output is correct
87 Correct 918 ms 18692 KB Output is correct
88 Correct 1416 ms 18652 KB Output is correct
89 Correct 1432 ms 19132 KB Output is correct
90 Correct 1051 ms 19672 KB Output is correct
91 Correct 586 ms 18776 KB Output is correct
92 Correct 561 ms 18776 KB Output is correct
93 Correct 700 ms 19288 KB Output is correct
94 Correct 510 ms 19548 KB Output is correct
95 Correct 930 ms 19672 KB Output is correct
96 Correct 847 ms 18856 KB Output is correct
97 Correct 879 ms 19672 KB Output is correct
98 Correct 897 ms 19480 KB Output is correct
99 Correct 730 ms 19548 KB Output is correct
100 Correct 604 ms 18904 KB Output is correct
101 Correct 631 ms 18904 KB Output is correct
102 Correct 1393 ms 18964 KB Output is correct
103 Correct 1294 ms 19032 KB Output is correct
104 Correct 1545 ms 19416 KB Output is correct
105 Correct 1050 ms 19420 KB Output is correct
106 Correct 1142 ms 19672 KB Output is correct
107 Correct 979 ms 19160 KB Output is correct
108 Correct 1647 ms 19032 KB Output is correct
109 Correct 1283 ms 19780 KB Output is correct
110 Correct 544 ms 19032 KB Output is correct
111 Correct 847 ms 19288 KB Output is correct
112 Correct 869 ms 18660 KB Output is correct
113 Correct 225 ms 19724 KB Output is correct