Submission #337293

#	Time	Username	Problem	Language	Result	Execution time	Memory
337293		super_j6	Port Facility (JOI17_port_facility)	C++14	78 / 100	1627 ms	1048576 KiB

port_facility

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <array>
#include <stack>
#include <deque>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

typedef array<deque<int>, 2> T;

const int mod = 1000000007;
const int mxn = 1000001;
int n, k;
pi a[mxn];
T stk[mxn / 2];

inline int f(int x){
	return stk[k - 1][x].empty() ? 2 * n + 2 : stk[k - 1][x].front();
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for(int i = 0; i < n; i++) cin >> a[i].f >> a[i].s;
	a[n] = {2 * n + 1, 2 * n + 1};
	
	sort(a, a + n);
	
	int ret = 1;
	for(int i = 0; i <= n; i++){
		while(k){
			for(int j = 0; j < 2; j++){
				while(f(j) < a[i].f) stk[k - 1][j].pop_front();
			}
			if(f(0) > f(1)) swap(stk[k - 1][0], stk[k - 1][1]);
			if(!stk[k - 1][0].empty()) break;
			k--, (ret *= 2) %= mod;
		}
		if(!k || a[i].s < f(0)){
			stk[k++][0].push_front(a[i].s);
		}else{
			while(k > 1 && stk[k - 1][1].empty()){
				T x;
				swap(stk[--k], x);
				if(a[i].s < f(0)){
					swap(stk[k++], x);
					break;
				}
				if(x[0].size() < stk[k - 1][0].size()){
					while(!x[0].empty()){
						stk[k - 1][0].push_front(x[0].back());
						x[0].pop_back();
					}
				}else{
					swap(x[0], stk[k - 1][0]);
					while(!x[0].empty()){
						stk[k - 1][0].push_back(x[0].front());
						x[0].pop_front();
					}
				}
			}
			if(a[i].s > f(1)){
				ret = 0;
				break;
			}
			stk[k - 1][1].push_front(a[i].s);
		}
	}
	
	cout << ret << endl;

	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 56 / 56
• Subtask 4: 0 / 22