oj.uz

Submission #120908

# Submission time Handle Problem Language Result Execution time Memory
120908 2019-06-25T17:31:57 Z sebinkim Meetings (IOI18_meetings) C++14
100 / 100
 2011 ms 325512 KB 
#include "meetings.h"

#include <vector>
#include <algorithm>

using namespace std;

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

struct minseg{
	pii T[2202020];
	int sz = 1 << 20;
	
	void init(vector <int> &H)
	{
		int i;
		
		for(i=0; i<H.size(); i++){
			T[i + sz] = pii(H[i], i);
		}
		
		for(i=sz-1; i; i--){
			T[i] = max(T[i << 1], T[i << 1 | 1]);
		}
	}
	
	int getmax(int l, int r)
	{
		pii ret(-1, -1);
		
		l += sz; r += sz;
		for(; l<=r; ){
			if(l & 1) ret = max(ret, T[l]);
			if(~r & 1) ret = max(ret, T[r]);
			l = l + 1 >> 1;
			r = r - 1 >> 1;
		}
		
		return ret.second;
	}
};

struct line{
	ll x, a, b;
	line() {}
	line(ll x, ll a, ll b) : x(x), a(a), b(b) {}
};

struct deq{
	line D[808080];
	int S[808080], E[808080];
	ll V[808080];
	int n;
	bool t;
	
	void init(bool _t, int _n)
	{
		int i;
		
		t = _t; n = _n;
		
		for(i=0; i<n; i++){
			S[i] = i; E[i] = i;
			D[i] = line(i, 0, 0);
		}
	}
	
	void addval(int p, ll v)
	{
		if(t) p = n - 1 - p;
		V[p] += v;
	}
	
	void addline(int p, ll x, ll a, ll b)
	{
		if(t){
			p = n - 1 - p, x = n - 1 - x;
			b = (n - 1) * a + b; a = -a;
		}
		
		int &s = S[p], &e = E[p];
		
		b -= V[p];
		
		for(; s<=e; e--){
			if(D[e].a == a && D[e].b < b) return;
			if(D[e].a * D[e].x + D[e].b < a * D[e].x + b){
				D[++e] = line((D[e].b - b) / (a - D[e].a) + 1, a, b);
				return;
			}
		}
		
		D[++e] = line(x, a, b);
	}
	
	ll getval(int p, ll x)
	{
		if(t) p = n - 1 - p, x = n - 1 - x;
		
		int k = upper_bound(D + S[p], D + E[p] + 1, x, [&](ll x, line l){
			return x < l.x;
		}) - D - 1;
		
		return D[k].a * x + D[k].b + V[p];
	}
	
	void merge(int p, int q)
	{
		if(t) p = n - 1 - p, q = n - 1 - q;
		
		int i;
		
		if(E[p] - S[p] < E[q] - S[q]){
			swap(S[p], S[q]); swap(E[p], E[q]);
			swap(V[p], V[q]);
		}
		
		if(S[p] < S[q]){
			for(i=S[q]; i<=E[q]; i++){
				D[i].b += V[q] - V[p];
				D[++E[p]] = D[i];
			}
		}
		else{
			for(i=E[q]; i>=S[q]; i--){
				D[i].b += V[q] - V[p];
				D[--S[p]] = D[i];
			}
		}
	}
};

minseg T;
deq DL, DR;
vector <int> H, L, R;
vector <int> Q[808080];
vector <ll> A;
int n;

int dnc(int s, int e)
{
	if(s > e) return -1;
	
	int m, l, r;
	ll v, h;
	
	m = T.getmax(s, e);	h = H[m];
	l = dnc(s, m - 1); r = dnc(m + 1, e);
	
	for(int &q: Q[m]){
		if(L[q] == m && R[q] == m) A[q] = h;
		else if(L[q] == m) A[q] = DR.getval(r, R[q]) + h;
		else if(R[q] == m) A[q] = DL.getval(l, L[q]) + h;
		else A[q] = min(DL.getval(l, L[q]) + h * (R[q] - m + 1),
						DR.getval(r, R[q]) + h * (m - L[q] + 1));
	}
	
	if(l != -1) DL.merge(m, l);
	DL.addval(m, h * (e - m + 1));
	DL.addline(m, s, -h, (r != -1? DL.getval(r, m + 1) : 0) + h * (m + 1));
	if(r != -1) DL.merge(m, r);
	
	if(r != -1) DR.merge(m, r);
	DR.addval(m, h * (m - s + 1));
	DR.addline(m, e, h, (l != -1? DR.getval(l, m - 1) : 0) - h * (m - 1));
	if(l != -1) DR.merge(m, l);
	
	return m;
}

vector <ll> minimum_costs(vector <int> _H, vector <int> _L, vector <int> _R)
{
	int i;
	
	swap(H, _H); swap(L, _L); swap(R, _R);
	n = H.size(); A.resize(L.size());
	
	T.init(H); DL.init(0, n); DR.init(1, n);
	
	for(i=0; i<L.size(); i++){
		Q[T.getmax(L[i], R[i])].push_back(i);
	}
	
	dnc(0, n - 1);
	
	return A;
}

Compilation message

meetings.cpp: In member function 'void minseg::init(std::vector<int>&)':
meetings.cpp:19:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0; i<H.size(); i++){
            ~^~~~~~~~~
meetings.cpp: In member function 'int minseg::getmax(int, int)':
meetings.cpp:36:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    l = l + 1 >> 1;
        ~~^~~
meetings.cpp:37:10: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    r = r - 1 >> 1;
        ~~^~~
meetings.cpp: In member function 'void deq::addline(int, ll, ll, ll)':
meetings.cpp:89:7: warning: operation on 'e' may be undefined [-Wsequence-point]
     D[++e] = line((D[e].b - b) / (a - D[e].a) + 1, a, b);
       ^~~
meetings.cpp:89:7: warning: operation on 'e' may be undefined [-Wsequence-point]
meetings.cpp: In function 'int dnc(int, int)':
meetings.cpp:146:5: warning: unused variable 'v' [-Wunused-variable]
  ll v, h;
     ^
meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:181:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0; i<L.size(); i++){
           ~^~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 27624 KB Output is correct
2 Correct 33 ms 27864 KB Output is correct
3 Correct 33 ms 27948 KB Output is correct
4 Correct 33 ms 27948 KB Output is correct
5 Correct 33 ms 27912 KB Output is correct
6 Correct 33 ms 28252 KB Output is correct
7 Correct 33 ms 27940 KB Output is correct
8 Correct 33 ms 28280 KB Output is correct
9 Correct 33 ms 28108 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 27624 KB Output is correct
2 Correct 33 ms 27864 KB Output is correct
3 Correct 33 ms 27948 KB Output is correct
4 Correct 33 ms 27948 KB Output is correct
5 Correct 33 ms 27912 KB Output is correct
6 Correct 33 ms 28252 KB Output is correct
7 Correct 33 ms 27940 KB Output is correct
8 Correct 33 ms 28280 KB Output is correct
9 Correct 33 ms 28108 KB Output is correct
10 Correct 37 ms 28408 KB Output is correct
11 Correct 37 ms 28424 KB Output is correct
12 Correct 38 ms 28380 KB Output is correct
13 Correct 36 ms 28408 KB Output is correct
14 Correct 37 ms 29020 KB Output is correct
15 Correct 37 ms 28400 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 27612 KB Output is correct
2 Correct 69 ms 32348 KB Output is correct
3 Correct 176 ms 56124 KB Output is correct
4 Correct 151 ms 43932 KB Output is correct
5 Correct 204 ms 57968 KB Output is correct
6 Correct 218 ms 59064 KB Output is correct
7 Correct 188 ms 62280 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 27612 KB Output is correct
2 Correct 69 ms 32348 KB Output is correct
3 Correct 176 ms 56124 KB Output is correct
4 Correct 151 ms 43932 KB Output is correct
5 Correct 204 ms 57968 KB Output is correct
6 Correct 218 ms 59064 KB Output is correct
7 Correct 188 ms 62280 KB Output is correct
8 Correct 161 ms 44988 KB Output is correct
9 Correct 369 ms 44892 KB Output is correct
10 Correct 152 ms 44932 KB Output is correct
11 Correct 190 ms 43812 KB Output is correct
12 Correct 163 ms 43672 KB Output is correct
13 Correct 146 ms 43904 KB Output is correct
14 Correct 210 ms 56080 KB Output is correct
15 Correct 131 ms 43656 KB Output is correct
16 Correct 180 ms 56608 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 27624 KB Output is correct
2 Correct 33 ms 27864 KB Output is correct
3 Correct 33 ms 27948 KB Output is correct
4 Correct 33 ms 27948 KB Output is correct
5 Correct 33 ms 27912 KB Output is correct
6 Correct 33 ms 28252 KB Output is correct
7 Correct 33 ms 27940 KB Output is correct
8 Correct 33 ms 28280 KB Output is correct
9 Correct 33 ms 28108 KB Output is correct
10 Correct 37 ms 28408 KB Output is correct
11 Correct 37 ms 28424 KB Output is correct
12 Correct 38 ms 28380 KB Output is correct
13 Correct 36 ms 28408 KB Output is correct
14 Correct 37 ms 29020 KB Output is correct
15 Correct 37 ms 28400 KB Output is correct
16 Correct 32 ms 27612 KB Output is correct
17 Correct 69 ms 32348 KB Output is correct
18 Correct 176 ms 56124 KB Output is correct
19 Correct 151 ms 43932 KB Output is correct
20 Correct 204 ms 57968 KB Output is correct
21 Correct 218 ms 59064 KB Output is correct
22 Correct 188 ms 62280 KB Output is correct
23 Correct 161 ms 44988 KB Output is correct
24 Correct 369 ms 44892 KB Output is correct
25 Correct 152 ms 44932 KB Output is correct
26 Correct 190 ms 43812 KB Output is correct
27 Correct 163 ms 43672 KB Output is correct
28 Correct 146 ms 43904 KB Output is correct
29 Correct 210 ms 56080 KB Output is correct
30 Correct 131 ms 43656 KB Output is correct
31 Correct 180 ms 56608 KB Output is correct
32 Correct 1055 ms 139660 KB Output is correct
33 Correct 851 ms 140484 KB Output is correct
34 Correct 1054 ms 140508 KB Output is correct
35 Correct 1164 ms 142196 KB Output is correct
36 Correct 878 ms 141276 KB Output is correct
37 Correct 1035 ms 140748 KB Output is correct
38 Correct 1378 ms 234692 KB Output is correct
39 Correct 1709 ms 234424 KB Output is correct
40 Correct 1169 ms 151304 KB Output is correct
41 Correct 1705 ms 322464 KB Output is correct
42 Correct 2011 ms 325512 KB Output is correct
43 Correct 1960 ms 325408 KB Output is correct
44 Correct 1648 ms 233692 KB Output is correct