結果
| 問題 | No.924 紲星 |
| ユーザー |
 hitonanode
|
| 提出日時 | 2019-11-08 22:23:44 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 5,488 bytes |
| コンパイル時間 | 2,059 ms |
| コンパイル使用メモリ | 181,060 KB |
| 実行使用メモリ | 56,624 KB |
| 最終ジャッジ日時 | 2024-09-15 01:37:08 |
| 合計ジャッジ時間 | 19,933 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge6 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 9 ms
22,552 KB |
| testcase_01 | AC | 11 ms
22,528 KB |
| testcase_02 | AC | 10 ms
22,400 KB |
| testcase_03 | AC | 17 ms
22,528 KB |
| testcase_04 | AC | 12 ms
22,424 KB |
| testcase_05 | AC | 18 ms
22,548 KB |
| testcase_06 | AC | 16 ms
22,528 KB |
| testcase_07 | AC | 11 ms
22,656 KB |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | AC | 3,110 ms
50,748 KB |
| testcase_14 | AC | 3,148 ms
38,912 KB |
| testcase_15 | AC | 3,006 ms
42,900 KB |
| testcase_16 | RE | - |
| testcase_17 | TLE | - |
| testcase_18 | AC | 9 ms
22,556 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx")
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 SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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 mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(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; }
///// This part below is only for debug, not used /////
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 << "}"; return os; }
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 << ")"; return os; }
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> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
vector<lint> v[400002];
vector<lint> acc[400002];
int N;
int head;
void merge_node(int pos)
{
// Here, you have to calculate vvalue[pos] from children (vvalue[l], vvalue[r]),
// Assumptions: `vdelay[pos] = vdelay[l] = vdelay[r] = zero_delay`
int l = pos * 2 + 1, r = pos * 2 + 2;
v[pos].insert(v[pos].end(), ALL(v[l]));
v[pos].insert(v[pos].end(), v[r].begin(), v[r].end());
sort(ALL(v[pos]));
acc[pos].assign(v[pos].size() + 1, 0);
REP(i, v[pos].size()) acc[pos][i + 1] = acc[pos][i] + v[pos][i];
}
plint calc_retval(int pos, lint query)
{
// Assumption: `vdelay[pos] = zero_delay`
auto itr = lower_bound(ALL(v[pos]), query);
int i = itr - v[pos].begin();
return make_pair(i, acc[pos][i]); // query未満の数の個数、総和
}
////// general description //////
void Init(const vector<lint> &val_init)
{
int N_tmp = 1;
while (N_tmp < N) N_tmp <<= 1;
head = N_tmp - 1;
REP(i, val_init.size())
{
v[head + i].push_back(val_init[i]);
acc[head + i].push_back(0);
acc[head + i].push_back(val_init[i]);
}
for (int pos = head - 1; pos >= 0; pos--)
{
merge_node(pos);
}
}
plint getvalue(int begin, int end, lint query, int pos=0, int l=0, int r=-1) // Get value in [begin, end)
{
if (r < 0) r = head + 1;
if (begin <= l and r <= end) return calc_retval(pos, query);
else if (begin < r and l < end) {
plint vl = getvalue(begin, end, query, pos * 2 + 1, l, (l + r) / 2);
plint vr = getvalue(begin, end, query, pos * 2 + 2, (l + r) / 2, r);
return vl + vr;
}
else return plint(0, 0);
}
int main()
{
int Q;
cin >> N >> Q;
vector<lint> A(N);
cin >> A;
Init(A);
REP(_, Q)
{
int L, R;
cin >> L >> R;
L--;
lint lo = -1e9 - 10, hi = 1e9 + 10;
while (hi > lo + 1)
{
lint c = (lo + hi) / 2;
plint p = getvalue(L, R, c);
if (p.first <= (R - L) / 2) lo = c;
else hi = c;
}
plint upper = getvalue(L, R, 1e9 + 10);
lint q = lo;
plint lower = getvalue(L, R, q);
lint ret = (upper.second - lower.second) - (upper.first - lower.first) * q + lower.first * q - lower.second;
printf("%lld\n", ret);
}
}