oj.uz

Submission #54356

# Submission time Handle Problem Language Result Execution time Memory
54356 2018-07-03T08:15:23 Z 윤교준(#1474) Sails (IOI07_sails) C++11
100 / 100
 410 ms 4604 KB 
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define INF (0x3f3f3f3f)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 100005;
const int MX = 131072;

struct NOD {
	NOD(int i, int s, int e, int mx, int mn, int x)
		: i(i), s(s), e(e), mx(mx), mn(mn), x(x) {}
	int i, s, e, mx, mn, x;
};
struct SEG {
	int d[MAXN*3], dmx[MAXN*3], dmn[MAXN*3];

	void _upd(int i, int s, int e) {
		if(s == e) {
			dmx[i] = dmn[i] = d[i];
		} else {
			dmx[i] = max(dmx[i*2], dmx[i*2+1]) + d[i];
			dmn[i] = min(dmn[i*2], dmn[i*2+1]) + d[i];
		}
	}
	void upd(int i, int s, int e, int p, int q, int r) {
		if(q < p || e < p || q < s) return;
		if(p <= s && e <= q) {
			d[i] += r;
			_upd(i, s, e);
			return;
		}
		int m = (s+e)/2;
		upd(i*2, s, m, p, q, r);
		upd(i*2+1, m+1, e, p, q, r);
		_upd(i, s, e);
	}
	void upd(int s, int e, int x) { upd(1, 1, 100000, s, e, x); }
	pii get(int i, int s, int e, int p, int q) {
	    if(q < p || e < p || q < s) return pii(-INF, INF);
		if(p <= s && e <= q) return pii(dmx[i], dmn[i]);
		int m = (s+e)/2;
		pii l = get(i*2, s, m, p, q), r = get(i*2+1, m+1, e, p, q);
		return pii(max(l.first, r.first) + d[i], min(l.second, r.second) + d[i]);
	}
	pii get(int s, int e) { return get(1, 1, 100000, s, e); }
	void getV(vector<NOD> &V, int i, int s, int e, int p, int q, int x) {
		if(q < p || e < p || q < s) return;
		if(p <= s && e <= q) {
			V.eb(i, s, e, dmx[i]+x, dmn[i]+x, x);
			return;
		}
		int m = (s+e)/2;
		getV(V, i*2, s, m, p, q, x + d[i]);
		getV(V, i*2+1, m+1, e, p, q, x + d[i]);
	}
	void getV(vector<NOD> &V, int s, int e) { getV(V, 1, 1, 100000, s, e, 0); }
	int _getMN(int i, int s, int e, int x, int h) {
		if(s == e) return s;
		int m = (s+e)/2;
		x += d[i];
		if(dmn[i*2] + x != h) {
			return _getMN(i*2, s, m, x, h);
		} else {
			return _getMN(i*2+1, m+1, e, x, h);
		}
	}
	int getMN(int s, int e, int h) {
		vector<NOD> V; getV(V, s, e);
		if(V.back().mn == h) return e;
		NOD nod(0, 0, 0, 0, 0, 0);
		for(auto &v : V) {
			if(v.mn == h) continue;
			nod = v;
			break;
		}
		return _getMN(nod.i, nod.s, nod.e, nod.x, h) - 1;
	}
	int _getMX(int i, int s, int e, int x, int h) {
		if(s == e) return s;
		int m = (s+e)/2;
		x += d[i];
		if(dmx[i*2+1] + x != h) {
			return _getMX(i*2+1, m+1, e, x, h);
		} else {
			return _getMX(i*2, s, m, x, h);
		}
	}
	int getMX(int s, int e, int h) {
		vector<NOD> V; getV(V, s, e);
		revv(V);
		if(V.back().mx == h) return s;
		NOD nod(0, 0, 0, 0, 0, 0);
		for(auto &v : V) {
			if(v.mx == h) continue;
			nod = v;
			break;
		}
		return _getMX(nod.i, nod.s, nod.e, nod.x, h) + 1;
	}
} seg;

int C[MAXN];
int A[MAXN], B[MAXN];

ll Ans;
int N;

int main() {
    //freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(false);

	cin >> N;

	{
	    vector<pii> V;
	    for(int i = 1, a, b; i <= N; i++) {
            cin >> a >> b;
            V.eb(a, b);
	    }
	    sorv(V);
        for(int i = 0; i < N; i++)
            tie(A[i+1], B[i+1]) = V[i];
	}

	for(int i = 1; i <= N; i++) {
		int ex = A[i], sx = ex-B[i]+1;
		int sl = sx, su = sx;
		int h = seg.get(sx, sx).first;

		//printf("i=%d, h=%d : %d %d\n", i, h, sx, ex);

		/*
		{
			int s = sx, e = ex; for(int m; s < e;) {
				m = (s+e+1)/2;
				if(seg.get(sx, m).second < h) e = m-1;
				else s = m;
			}
			su = s;
		}
		{
			int s = 1, e = sx; for(int m; s < e;) {
				m = (s+e)/2;
				if(seg.get(m, sx).first > h) s = m+1;
				else e = m;
			}
			sl = s;
		}
		*/

		su = seg.getMN(sx, ex, h);
		sl = seg.getMX(1, sx, h);

		//printf("%d : (%d %d) :: %d %d\n", i, sx, ex, sl, su);

		{
			int l = su-sx+1;
			seg.upd(sl, sl+l-1, 1);
		}
		seg.upd(su+1, ex, 1);
	}

	for(int i = 1; i <= 100000; i++) {
		int c = seg.get(i, i).first;
		//if(i <= 10) printf("%d : %d\n", i, c);
		Ans += ll(c) * (c-1) / 2;
	}

	cout << Ans << endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 376 KB Output is correct
2 Correct 19 ms 488 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 544 KB Output is correct
2 Correct 20 ms 572 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 580 KB Output is correct
2 Correct 18 ms 628 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 704 KB Output is correct
2 Correct 20 ms 704 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 832 KB Output is correct
2 Correct 24 ms 3664 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3664 KB Output is correct
2 Correct 104 ms 3664 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 3664 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 3664 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 4536 KB Output is correct
2 Correct 271 ms 4536 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 4536 KB Output is correct
2 Correct 175 ms 4536 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 4604 KB Output is correct
2 Correct 289 ms 4604 KB Output is correct