結果
| 問題 | No.284 門松と魔法(2) |
| ユーザー |
 heno239
|
| 提出日時 | 2020-08-21 15:22:57 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 4,871 bytes |
| コンパイル時間 | 1,777 ms |
| コンパイル使用メモリ | 133,796 KB |
| 実行使用メモリ | 370,560 KB |
| 最終ジャッジ日時 | 2024-04-23 01:54:07 |
| 合計ジャッジ時間 | 20,626 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 439 ms
369,152 KB |
| testcase_01 | AC | 438 ms
363,648 KB |
| testcase_02 | AC | 434 ms
363,644 KB |
| testcase_03 | AC | 437 ms
363,624 KB |
| testcase_04 | AC | 438 ms
363,648 KB |
| testcase_05 | AC | 436 ms
363,776 KB |
| testcase_06 | AC | 434 ms
363,632 KB |
| testcase_07 | AC | 436 ms
363,772 KB |
| testcase_08 | AC | 439 ms
363,648 KB |
| testcase_09 | AC | 435 ms
363,648 KB |
| testcase_10 | AC | 455 ms
363,712 KB |
| testcase_11 | AC | 441 ms
363,672 KB |
| testcase_12 | AC | 449 ms
363,724 KB |
| testcase_13 | AC | 438 ms
363,760 KB |
| testcase_14 | AC | 445 ms
363,800 KB |
| testcase_15 | AC | 440 ms
363,672 KB |
| testcase_16 | AC | 447 ms
363,900 KB |
| testcase_17 | AC | 438 ms
363,768 KB |
| testcase_18 | AC | 449 ms
363,776 KB |
| testcase_19 | AC | 439 ms
363,776 KB |
| testcase_20 | AC | 445 ms
363,760 KB |
| testcase_21 | AC | 445 ms
363,740 KB |
| testcase_22 | AC | 466 ms
363,748 KB |
| testcase_23 | AC | 1,136 ms
365,144 KB |
| testcase_24 | TLE | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
ソースコード
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
ll mod_pow(ll x, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
while (b) {
ll r = a % b; a = b; b = r;
}
return a;
}
const int b = 4;
struct ste {
int val, pre, id;
};
struct SegT {
private:
int sz; vector<vector<ste>> node;
const vector<ste> init_c=vector<ste>(b, ste{0,-1,-1});
public:
SegT(int n) {
sz = 1;
while (sz < n)sz *= 2;
node.resize(2 * sz - 1, init_c);
}
vector<ste> f(vector<ste> a, vector<ste>b) {
vector<pair<int, P>> memo;
for (ste s : a)memo.push_back({ s.val,{s.pre,s.id} });
for (ste s : b)memo.push_back({ s.val,{s.pre,s.id} });
sort(all(memo), greater<pair<int, P>>());
vector<ste> res;
for(pair<int,P> p:memo) {
bool valid = true;
rep(j, res.size()) {
if (res[j].pre == p.second.first && res[j].id == p.second.second)valid = false;
}
if (valid)res.push_back({ p.first,p.second.first,p.second.second });
}
res.resize(4, ste{ 0,-1,-1 });
return res;
}
void update(int k, int v,int p,int id) {
k += sz - 1;
vector<ste> val(4, { 0,-1,-1 });
val[0] = { v,p,id };
node[k] = f(node[k],val);
while (k > 0) {
k = (k - 1) / 2;
node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
}
}
vector<ste> query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)r = sz;
if (r <= a || b <= l)return init_c;
else if (a <= l && r <= b)return node[k];
else {
vector<ste> vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
vector<ste> vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return f(vl, vr);
}
}
};
void solve() {
int n; cin >> n;
int sz = 1 << 20;
SegT up(sz), dw(sz);
vector<int> a(n);
rep(i, n)cin >> a[i];
rep(i, n) {
vector<ste> x = dw.query(a[i] + 1, sz);
for (ste s : x) {
if (s.pre == a[i])continue;
int v = s.val + 1;
int p = s.id;
int id = a[i];
up.update(a[i], v, p, id);
}
x = up.query(0, a[i]);
for (ste s : x) {
if (s.pre == a[i])continue;
int v = s.val + 1;
int p = s.id;
int id = a[i];
dw.update(a[i], v, p, id);
}
}
int ans = 0;
vector<ste> s = up.query(0, sz);
ans = max(ans, s[0].val);
s = dw.query(0, sz);
ans = max(ans, s[0].val);
if (ans < 3)ans = 0;
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//expr();
//int t; cin >> t; rep(i, t)
//while (cin >> n >> m>>s1>>s2>>t, n)
solve();
return 0;
}