結果
問題 | No.2374 ASKT Subsequences |
ユーザー |
|
提出日時 | 2023-07-07 22:02:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,249 ms / 2,000 ms |
コード長 | 2,863 bytes |
コンパイル時間 | 2,143 ms |
コンパイル使用メモリ | 209,340 KB |
最終ジャッジ日時 | 2025-02-15 07:25:07 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")typedef long long ll;typedef long double ld;#define chmin(a,b) a = min(a,b);#define chmax(a,b) a = max(a,b);#define bit_count(x) __builtin_popcountll(x)#define leading_zero_count(x) __builtin_clz(x)#define trailing_zero_count(x) __builtin_ctz(x)#define gcd(a,b) __gcd(a,b)#define lcm(a,b) a / gcd(a,b) * b#define rep(i,n) for(int i = 0 ; i < n ; i++)#define rrep(i,a,b) for(int i = a ; i < b ; i++)#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)#define pt(a) cout << a << endl;#define debug(a) cout << #a << " " << a << endl;#define all(a) a.begin(), a.end()#define endl "\n";#define v1(n,a) vector<ll>(n,a)#define v2(n,m,a) vector<vector<ll>>(n,v1(m,a))#define v3(n,m,k,a) vector<vector<vector<ll>>>(n,v2(m,k,a))#define v4(n,m,k,l,a) vector<vector<vector<vector<ll>>>>(n,v3(m,k,l,a))template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}returnos;}void solve(){int n;cin >> n;vector<int> A(n);cin >> A;auto dp = v3(n+1,2020,4,0);ll res = 0;rep(i,n){vector<vector<int>> S(2020);vector<vector<int>> T(2020);rrep(j,i+1,n){int k = A[j] - A[i] - 10;if(k > 0) dp[j][k][1]++;}rrep(j,i+1,n){int k = A[i] - A[j];int l = A[j] - A[i] - 1;if(k > 0) S[k].push_back(j);if(l > 0) T[l].push_back(j);}rrep(j,1,2020){if(j > 0) for(int u : S[j]) dp[u][j][2] += dp[i][j][1];if(j > 0) for(int u : T[j]) dp[u][j][3] += dp[i][j][2];res += dp[i][j][3];}}pt(res);}int main(){fast_ioint t = 1;// cin >> t;rep(i,t) solve();}