結果
| 問題 | No.1079 まお |
| ユーザー |
 hitonanode
|
| 提出日時 | 2020-06-12 22:28:25 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 467 ms / 2,000 ms |
| コード長 | 5,923 bytes |
| コンパイル時間 | 2,657 ms |
| コンパイル使用メモリ | 228,260 KB |
| 最終ジャッジ日時 | 2025-01-11 02:43:03 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long int;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; returnos; }template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}";return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; returnos; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }template<typename TK, typename TV, typename HOGE> ostream &operator<<(ostream &os, const unordered_map<TK, TV, HOGE> &mp){ os << "{"; for (auto v :mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;/*#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/pb_ds/tag_and_trait.hpp>using namespace __gnu_pbds; // find_by_order(), order_of_key()template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;*/struct custom_hash{// <https://codeforces.com/blog/entry/62393>static uint64_t splitmix64(uint64_t x){// http://xorshift.di.unimi.it/splitmix64.cx += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const{static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};map<int, vector<int>> a2pos;unordered_map<int, vector<pint>, custom_hash> a2add;vector<lint> coeff;int main(){int N, K;cin >> N >> K;vector<lint> A(N);cin >> A;REP(i, N) a2pos[A[i]].emplace_back(i);set<int> s;s.insert(-1);s.insert(N);lint ret = 0;for (auto &p : a2pos){vector<int> v = p.second;s.insert(v.begin(), v.end());for (auto x : v){int l = *prev(s.lower_bound(x)) + 1, r = *s.upper_bound(x) - 1;if (x - l <= r - x){FOR(i, l, x + 1) if (a2pos.count(K - A[i])){int ll = x, rr = r;int n = (upper_bound(ALL(a2pos[K - A[i]]), rr) - lower_bound(ALL(a2pos[K - A[i]]), ll));if (n){ret -= 1LL * i * n;a2add[K - A[i]].emplace_back(ll, 1);a2add[K - A[i]].emplace_back(rr + 1, -1);}}}else{FOR(i, x, r + 1) if (a2pos.count(K - A[i])){int ll = l, rr = x;int n = (upper_bound(ALL(a2pos[K - A[i]]), rr) - lower_bound(ALL(a2pos[K - A[i]]), ll));if (n){ret += 1LL * (i + 2) * n;a2add[K - A[i]].emplace_back(ll, -1);a2add[K - A[i]].emplace_back(rr + 1, 1);}}}}}constexpr int INF = 1e9;for (auto p : a2add){vector<pint> v = p.second;for (auto x : a2pos[p.first]) v.emplace_back(x, INF);sort(ALL(v));lint n = 0;for (auto p : v){if (p.second == INF) ret += 1LL * (p.first + 1) * n;else n += p.second;}}cout << ret << '\n';}