結果
問題 | No.1079 まお |
ユーザー |
|
提出日時 | 2020-06-13 01:13:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 533 ms / 2,000 ms |
コード長 | 2,288 bytes |
コンパイル時間 | 2,019 ms |
コンパイル使用メモリ | 136,524 KB |
最終ジャッジ日時 | 2025-01-11 03:23:40 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:85:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 85 | scanf("%lld %lld", &n, &k); | ~~~~~^~~~~~~~~~~~~~~~~~~~~ main.cpp:86:55: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 86 | a.resize(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]); | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <cstdio>#include <iostream>#include <string>#include <sstream>#include <stack>#include <algorithm>#include <cmath>#include <queue>#include <map>#include <set>#include <cstdlib>#include <bitset>#include <tuple>#include <assert.h>#include <deque>#include <bitset>#include <iomanip>#include <limits>#include <chrono>#include <random>#include <array>#include <unordered_map>#include <functional>#include <complex>#include <numeric>template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }constexpr long long MAX = 5100000;constexpr long long INF = 1LL << 60;constexpr int inf = 1000000007;constexpr long long mod = 1000000007LL;//constexpr long long mod = 998244353LL;const long double PI = acos((long double)(-1));using namespace std;typedef unsigned long long ull;typedef long long ll;typedef long double ld;ll n, k;vector<ll> a;ll calc(vector<ll> &v1, vector<ll> &v2) {ll idx = 0; //v2のidxll mn = INF; //最小値ll mn_cnt = 0; //minの最小値(1以外はout)ll res = 0;map<ll, pair<ll, ll>> mp; //値、個数、総和for (ll i = 0; i < v1.size(); i++) {if (chmin(mn, v1[i])) mn_cnt = 1;else if (mn == v1[i]) mn_cnt++;if (mn_cnt > 1) continue;while (idx < v2.size() and v2[idx] > mn) {mp[v2[idx]].first++;mp[v2[idx]].second += v1.size() + idx + 1;idx++;}if (mp.find(k - v1[i]) != mp.end()) res += mp[k - v1[i]].second - (v1.size() - i - 1) * mp[k - v1[i]].first;}return res;}ll f(int left, int right) {if (right - left <= 0) return 0;if (right - left == 1) return a[left] * 2 == k;ll mid = (left + right) >> 1;ll res = f(left, mid) + f(mid, right);vector<ll> v1, v2;for (int i = left; i < mid; i++) v1.emplace_back(a[i]);for (int i = mid; i < right; i++) v2.emplace_back(a[i]);reverse(v1.begin(), v1.end());res += calc(v1, v2); //v1側に最小値がある場合res += calc(v2, v1); //v2側に最小値がある場合return res;}int main(){/*cin.tie(nullptr);ios::sync_with_stdio(false);*/scanf("%lld %lld", &n, &k);a.resize(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);cout << f(0, n) << endl;return 0;}