結果

問題 No.1804 Intersection of LIS
ユーザー leaf_1415leaf_1415
提出日時 2022-01-07 23:00:33
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 10,751 bytes
コンパイル時間 1,680 ms
コンパイル使用メモリ 121,988 KB
実行使用メモリ 68,628 KB
最終ジャッジ日時 2024-11-14 09:04:59
合計ジャッジ時間 27,627 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
47,220 KB
testcase_01 AC 21 ms
47,740 KB
testcase_02 AC 20 ms
46,320 KB
testcase_03 AC 1,340 ms
56,824 KB
testcase_04 AC 1,365 ms
56,872 KB
testcase_05 AC 1,348 ms
56,704 KB
testcase_06 AC 1,338 ms
56,712 KB
testcase_07 AC 1,353 ms
56,792 KB
testcase_08 AC 1,364 ms
56,724 KB
testcase_09 AC 1,383 ms
56,852 KB
testcase_10 AC 1,354 ms
56,912 KB
testcase_11 AC 1,371 ms
56,768 KB
testcase_12 AC 1,369 ms
56,704 KB
testcase_13 AC 1,345 ms
56,776 KB
testcase_14 AC 1,348 ms
56,824 KB
testcase_15 AC 1,343 ms
56,760 KB
testcase_16 AC 1,353 ms
56,696 KB
testcase_17 AC 1,341 ms
56,836 KB
testcase_18 AC 31 ms
46,404 KB
testcase_19 AC 32 ms
47,336 KB
testcase_20 AC 32 ms
46,636 KB
testcase_21 AC 31 ms
46,424 KB
testcase_22 AC 33 ms
48,308 KB
testcase_23 AC 32 ms
47,176 KB
testcase_24 AC 31 ms
46,736 KB
testcase_25 AC 32 ms
46,572 KB
testcase_26 AC 32 ms
48,212 KB
testcase_27 AC 31 ms
46,808 KB
testcase_28 WA -
testcase_29 AC 21 ms
47,704 KB
testcase_30 AC 21 ms
46,696 KB
testcase_31 AC 21 ms
46,428 KB
testcase_32 AC 21 ms
46,216 KB
testcase_33 AC 21 ms
46,396 KB
testcase_34 AC 21 ms
46,492 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 972 ms
68,628 KB
testcase_38 AC 979 ms
68,252 KB
testcase_39 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fst first
#define snd second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

int mod = 100;
//const int mod = 1000000007;
//const int mod = 998244353;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t; return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }

vector<int> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll arith(ll x){return x*(x+1)/2;}
ll arith(ll l, ll r){return arith(r) - arith(l-1);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}

template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}

struct SegTree{
	typedef ll SEG;
	
	int size;
	vector<SEG> seg;
	
	SegTree(){}
	SegTree(int size){
		this->size = size;
		seg.resize(1<<(size+1));
	}
	
	SEG Ident(){  //identity element
		return -inf;
	}
	SEG ope(SEG a, SEG b){ //operator
		return max(a, b);
	}
	
	void init(){
		for(int i = 0; i < (1<<(size+1)); i++) seg[i] = Ident();
	}
	void update(int i, SEG val){
		i += (1 << size);
		seg[i] = val;
		while(i > 1){
			i /= 2;
			seg[i] = ope(seg[i*2], seg[i*2+1]);
		}
	}
	SEG query(int a, int b, int k, int l, int r){
		if(b < l || r < a) return Ident();
		if(a <= l && r <= b) return seg[k];
		SEG lval = query(a, b, k*2, l, (l+r)/2);
		SEG rval = query(a, b, k*2+1, (l+r)/2+1, r);
		return ope(lval, rval);
	}
	SEG query(int a, int b){
		if(a > b) return Ident();
		return query(a, b, 1, 0, (1<<size)-1);
	}
};

struct SegTree2{
	typedef mint SEG;
	
	int size;
	vector<SEG> seg;
	
	SegTree2(){}
	SegTree2(int size){
		this->size = size;
		seg.resize(1<<(size+1));
	}
	
	SEG Ident(){  //identity element
		return 0;
	}
	SEG ope(SEG a, SEG b){ //operator
		return a+b;
	}
	
	void init(){
		for(int i = 0; i < (1<<(size+1)); i++) seg[i] = Ident();
	}
	void update(int i, SEG val){
		i += (1 << size);
		seg[i] = val;
		while(i > 1){
			i /= 2;
			seg[i] = ope(seg[i*2], seg[i*2+1]);
		}
	}
	SEG query(int a, int b, int k, int l, int r){
		if(b < l || r < a) return Ident();
		if(a <= l && r <= b) return seg[k];
		SEG lval = query(a, b, k*2, l, (l+r)/2);
		SEG rval = query(a, b, k*2+1, (l+r)/2+1, r);
		return ope(lval, rval);
	}
	SEG query(int a, int b){
		if(a > b) return Ident();
		return query(a, b, 1, 0, (1<<size)-1);
	}
};

ll n;
ll p[300005], q[300005];
bool b[300005];
ll dp[300005], dp2[300005];
SegTree seg(19), seg2(19);
vector<ll> vec[300005], vec2[300005];
ll len;

mint ep[300005], ep2[300005];
void calc(ll m)
{
	mod = m;
	
	mint all;
	SegTree2 seg(19);
	seg.init();
	
	ep[0] = 1;
	rep(i, 1, n){
		vector<P> tmp;
		for(auto x : vec[i-1]) tmp.pb(P(p[x], x));
		for(auto x : vec[i]) tmp.pb(P(p[x], x));
		sort(all(tmp));
		
		for(auto p : tmp){
			ll x = p.snd;
			if(dp[x] == i-1) seg.update(x, ep[x]);
			else ep[x] = seg.query(0, x-1);
		}
		if(i == len+1) all = seg.query(0, n+1);
		
		for(auto p : tmp) if(dp[p.snd] == i-1) seg.update(p.snd, 0);
	}
	
	ep2[n+1] = 1;
	rep(i, 1, n){
		vector<P> tmp;
		for(auto x : vec2[i-1]) tmp.pb(P(p[x], x));
		for(auto x : vec2[i]) tmp.pb(P(p[x], x));
		sort(all(tmp)), reverse(all(tmp));
		
		//outl(tmp);
		
		for(auto p : tmp){
			ll x = p.snd;
			if(dp2[x] == i-1) seg.update(x, ep2[x]);
			else ep2[x] = seg.query(x+1, n+1);
		}
		for(auto p : tmp) if(dp2[p.snd] == i-1) seg.update(p.snd, 0);
	}
	
	/*outa(ep, 0, n+1);
	outa(ep2, 0, n+1);
	outl(all);*/
	
	rep(i, 1, n){
		if(ep[i] * ep2[i] != all) b[i] = false;
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	rep(i, 1, n) cin >> p[i];
	rep(i, 1, n) q[p[i]] = i;
	p[n+1] = n+1;
	
	seg.init();
	dp[0] = 0, seg.update(0, 0);
	rep(i, 1, n){
		dp[q[i]] = seg.query(0, q[i]-1)+1;
		seg.update(q[i], dp[q[i]]);
	}
	rep(i, 0, n) vec[dp[i]].pb(i);
	
	seg2.init();
	dp2[n+1] = 0, seg2.update(n+1, 0);
	per(i, n, 1){
		dp2[q[i]] = seg2.query(q[i]+1, n+1)+1;
		seg2.update(q[i], dp2[q[i]]);
	}
	rep(i, 1, n+1) vec2[dp2[i]].pb(i);
	rep(i, 0, n+1) reverse(all(vec2[i]));
	
	len = seg.query(1, n);
	
	/*outa(dp, 0, n+1);
	outa(dp2, 0, n+1);
	outl(len);*/
	
	rep(i, 1, n) b[i] = (len == dp[i]+dp2[i]-1);
	ll a[] = {950009857, 943718401, 935329793};
	rep(i, 0, 2) calc(a[i]);
	
	vector<ll> ans;
	rep(i, 1, n) if(b[i]) ans.pb(p[i]);
	outl(sz(ans));
	outl(ans);
	
	return 0;
}
0