Submission #6627220

---

Source Code Expand

// Sample Code
// G Subtask3
// Writen by gotoloop

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)

signed main() {
	int n, m;
	cin >> n >> m;
	assert(1 <= n && n <= 1000000000);
	assert(0 <= m && m <= 1000);
	int p, q, r, s;
	cin >> p >> q >> r >> s;
	assert(1 <= p && p <= n);
	assert(1 <= q && q <= n);
	assert(1 <= r && r <= n);
	assert(1 <= s && s <= n);
	assert(p == 1 && r == 1);
	vector<int> t(m), a(m), b(m), c(m), d(m);
	rep(i, m) {
		cin >> t[i] >> a[i] >> b[i] >> c[i] >> d[i];
		assert(t[i] == 1 || t[i] == 2);
		if(t[i] == 1) {
			assert(1 <= a[i] && a[i] <= b[i] && b[i] <= n);
			assert(1 <= c[i] && c[i] < d[i] && d[i] <= n);
		}
		else {
			assert(1 <= a[i] && a[i] < b[i] && b[i] <= n);
			assert(1 <= c[i] && c[i] <= d[i] && d[i] <= n);
		}
		assert(t[i] == 1);
		assert(a[i] == 1 && b[i] == 1);
	}
	
	map<int, int> table;
	rep(i, m) {
		table[c[i]]++;
		table[d[i]]--;
	}
	
	int mi = min(q, s);
	int ma = max(q, s);
	int ans = ma - mi;
	int now = 0;
	int pre = 0;
	for(auto i: table) {
		if(now > 0) {
			if(i.first <= mi || ma <= pre) {}
			else if(pre <= mi) {
				if(i.first <= ma) {
					ans -= i.first - mi;
				}
				else {
					ans = 0;
				}
			}
			else {
				if(i.first <= ma) {
					ans -= i.first - pre;
				}
				else {
					ans -= ma - pre;
				}
			}
		}
		now += i.second;
		pre = i.first;
	}
	cout << ans << endl;
}

Submission Info

Judge Result