結果
問題 | No.2374 ASKT Subsequences |
ユーザー |
|
提出日時 | 2023-07-07 22:28:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,023 ms / 2,000 ms |
コード長 | 3,135 bytes |
コンパイル時間 | 4,088 ms |
コンパイル使用メモリ | 252,264 KB |
最終ジャッジ日時 | 2025-02-15 07:48:29 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;// inputtemplate<class T>istream &operator>>(istream &is, vector<T> &v){for(T &in : v) is >> in;return is;}template<class T, class S>istream &operator>>(istream &is, pair<T, S> &p){is >> p.first >> p.second;return is;}template<class... T> void input(T&... a) {(cin >> ... >> a);}//outputtemplate<class T>ostream & operator<<(ostream &os, const vector<T> &v){for(int i = 0; i < (int)v.size(); i++) os << (i == 0 ? "" : " ") << v[i];return os;}template<class T, class S>ostream &operator<<(ostream &os, const pair<T, S> &p){os << p.first << " " << p.second;return os;}template<class T, class S>ostream &operator<<(ostream &os, const map<T, S> &mp){for(auto &[key, val] : mp) os << key << ":" << val << " ";return os;}template<class T>ostream &operator<<(ostream &os, const set<T> &st){for(auto itr = st.begin(); itr != st.end(); itr++) os << (itr == st.begin() ? "" : " ") << *itr;return os;}template<class T>ostream &operator<<(ostream &os, const multiset<T> &st){for(auto itr = st.begin(); itr != st.end(); itr++) os << (itr == st.begin() ? "" : " ") << *itr;return os;}template<class T>ostream &operator<<(ostream &os, queue<T> que){while(!que.empty()) {os << que.front(); que.pop();if(!que.empty()) os << " ";}return os;}template<class T>ostream &operator<<(ostream &os, stack<T> st){while(!st.empty()) {os << st.top(); st.pop();if(!st.empty()) os << " ";}return os;}template <class T, class Container, class Compare>ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){while (!pq.empty()){os << pq.top(); pq.pop();if(!pq.empty()) os << " ";}return os;}void print() {cout << "\n";}template<class T> void print(const T& a) {cout << a << '\n';}template<class T, class... Ts> void print(const T& a, const Ts&... b) {cout << a; (..., (cout << ' ' << b)); cout << '\n';}#define debug(var) cout << #var << " = ";print(var);typedef long long lint;#define _overload3(_1,_2,_3,name,...) name#define _rep(i,n) repi(i,0,n)#define repi(i,a,b) for(int i=int(a);i<int(b);++i)#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)#define _overload3(_1,_2,_3,name,...) name#define _rrep(i,n) rrepi(i,n,0)#define rrepi(i,a,b) for(int i=int(a-1);i>=int(b);--i)#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }int main() {int N; input(N);vector<int> A(N); input(A);lint ans = 0;rep(i, N){rep(j, i+1, N){if(A[j] <= A[i] + 10) continue;lint cnt = 0;rep(k, j+1, N){if(A[k] == A[i] + 10) cnt++;if(A[k] == A[j] + 1) ans += cnt;}}}print(ans);}