#958454 (C++17) No.2667 Constrained Permutation

• 問題: No.2667 Constrained Permutation
• ユーザー: 沙耶花
• 提出日時: 2024-03-08 21:37:34
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,280 ms / 2,000 ms
• コード長: 1,156 bytes
• コンパイル時間: 4,489 ms
• コンパイル使用メモリ: 268,424 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-03-08 21:37:51
• 合計ジャッジ時間: 16,233 ms
• ジャッジサーバーID （参考情報）: judge12 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	2 ms; 6,676 KB
testcase_04	AC	4 ms; 6,676 KB
testcase_05	AC	2 ms; 6,676 KB
testcase_06	AC	3 ms; 6,676 KB
testcase_07	AC	2 ms; 6,676 KB
testcase_08	AC	3 ms; 6,676 KB
testcase_09	AC	3 ms; 6,676 KB
testcase_10	AC	2 ms; 6,676 KB
testcase_11	AC	3 ms; 6,676 KB
testcase_12	AC	250 ms; 6,676 KB
testcase_13	AC	9 ms; 6,676 KB
testcase_14	AC	886 ms; 6,676 KB
testcase_15	AC	90 ms; 6,676 KB
testcase_16	AC	60 ms; 6,676 KB
testcase_17	AC	20 ms; 6,676 KB
testcase_18	AC	1,027 ms; 6,676 KB
testcase_19	AC	600 ms; 6,676 KB
testcase_20	AC	759 ms; 6,676 KB
testcase_21	AC	105 ms; 6,676 KB
testcase_22	AC	111 ms; 6,676 KB
testcase_23	AC	107 ms; 6,676 KB
testcase_24	AC	478 ms; 6,676 KB
testcase_25	AC	942 ms; 6,676 KB
testcase_26	AC	1,280 ms; 6,676 KB
testcase_27	AC	1,122 ms; 6,676 KB
testcase_28	AC	57 ms; 6,676 KB
testcase_29	AC	53 ms; 6,676 KB
testcase_30	AC	59 ms; 6,676 KB
testcase_31	AC	37 ms; 6,676 KB
testcase_32	AC	9 ms; 6,676 KB
testcase_33	AC	92 ms; 6,676 KB
testcase_34	AC	52 ms; 6,676 KB
testcase_35	AC	59 ms; 6,676 KB
testcase_36	AC	60 ms; 6,676 KB
testcase_37	AC	57 ms; 6,676 KB
testcase_38	AC	86 ms; 6,676 KB
testcase_39	AC	3 ms; 6,676 KB
testcase_40	AC	44 ms; 6,676 KB
testcase_41	AC	80 ms; 6,676 KB
testcase_42	AC	215 ms; 6,676 KB
testcase_43	AC	366 ms; 6,676 KB
testcase_44	AC	285 ms; 6,676 KB
testcase_45	AC	10 ms; 6,676 KB

ソースコード

#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
vector<pair<int,int>> lr;
int check(long long k){
	
	int n = lr.size();
	int cp = 0;
	priority_queue<int,vector<int>,greater<int>> Q;
	rep(i,n){
		int cur = k + i;
		while(cp!=n){
			if(lr[cp].first <= cur){
				Q.push(lr[cp].second);
				cp++;
			}
			else break;
		}
			
		if(Q.size()==0)return -1;
		if(Q.top()<cur)return 1;
		Q.pop();
	}
	return 0;
	
	
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n;
	cin>>n;
	lr.resize(n);
	rep(i,n)cin>>lr[i].first>>lr[i].second;
	sort(lr.begin(),lr.end());
	
	long long ans = 0;
	
	{
		long long ok = -1,ng = 2000000000;
		while(ng-ok>1LL){
			
			long long mid = (ok+ng)/2;
			if(check(mid)<=0)ok = mid;
			else ng =mid;
		}
		ans += ok;
	}
	
	{
		long long ok = -1,ng = 2000000000;
		while(ng-ok>1LL){
			
			long long mid = (ok+ng)/2;
			if(check(mid)<=-1)ok = mid;
			else ng =mid;
		}
		ans -= ok;
	}
	cout<<ans<<endl;
	
	
	return 0;
}