結果

問題 No.742 にゃんにゃんにゃん 猫の挨拶
ユーザー maimai
提出日時 2018-10-05 21:34:02
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 20 ms / 2,500 ms
コード長 8,570 bytes
コンパイル時間 12,271 ms
コンパイル使用メモリ 292,996 KB
最終ジャッジ日時 2025-01-06 14:17:02
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:63:9: warning: no return statement in function returning non-void [-Wreturn-type]
   63 |         }
      |         ^

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
mt19937 mt(8901016);
inline int rand_int(int l, int h) {
return uniform_int_distribution<>(l, h)(mt);
}
#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0;
T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var*sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) {
input_integer<int>(var);
return *this;
}
inline MaiScanner& operator>>(long long& var) {
input_integer<long long>(var);
return *this;
}
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiablechar(cc); cc = getchar_unlocked());
for (; isvisiablechar(cc); cc = getchar_unlocked())
var.push_back(cc);
}
template<typename IT> void in(IT begin, IT end) {
for (auto it = begin; it != end; ++it) *this >> *it;
}
};
}
MaiScanner scanner;
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<typename T> inline T lcm(T a, T b) { return a * b / gcd(a, b); }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) {
return distance(begin, min_element(begin, end));
}
template<typename iterator> inline size_t argmax(iterator begin, iterator end) {
return distance(begin, max_element(begin, end));
}
template<typename iterator, typename T, typename F>
T reduce(iterator begin, iterator end, T init, F func) {
T sum = init;
for (; begin != end; ++begin)
if (!func(sum, *begin)) break;
return sum;
}
template<typename T>
//typedef int T;
class segtree {
int size;
public:
struct VI {
T val;
int idx;
VI(T val = 0, int idx = 0) :val(val), idx(idx) {}
static const VI& max(const VI& a, const VI& b) {
return a.val == b.val ? (a.idx < b.idx ? a : b) : (a.val >= b.val ? a : b);
}
static const VI& min(const VI& a, const VI& b) {
return a.val == b.val ? (a.idx < b.idx ? a : b) : (a.val <= b.val ? a : b);
}
bool operator==(const VI& e) const {
return val == e.val && idx == e.idx;
}
bool operator<(const VI& e) const {
return (val < e.val) || (idx > e.idx);
}
};
private:
vector<int> mark;
vector<T> single; // max(min)
vector<pair<T, T>> addtree; // sum,lazy
vector<VI> maxtree; // val,idx
public:
segtree(int n) {
size = 8;
while (size < n) size <<= 1;
addtree.resize(size * 2);
mark.resize(size * 2);
single.resize(size * 2);
maxtree.resize(size * 2);
_flat();
}
void _flat() {
for (int i = 0; i < size; ++i) {
maxtree[i + size - 1] = VI(0, i);
}
for (int i = size - 2; 0 <= i; --i) {
int c = 2 * i + 1;
maxtree[i] = maxtree[c];
}
}
// [begin,end)val
void addvalrange(int begin, int end, T val, int ptr = 0, int rangebegin = 0, int rangeend = 0) {
if (rangeend <= rangebegin) { rangeend = size; }
if (rangeend <= begin || end <= rangebegin) return; // note:
if (begin <= rangebegin && rangeend <= end) {
addtree[ptr].first += val * (rangeend - rangebegin);
addtree[ptr].second += val * (rangeend - rangebegin) / 2;
mark[ptr] |= 3;
maxtree[ptr].val += val;
single[ptr] += val;
if (rangeend - rangebegin > 1) { //
_applyDown(ptr);
}
return;
}
_applyDown(ptr);
int rangemid = (rangebegin + rangeend) / 2;
addvalrange(begin, end, val, ptr * 2 + 1, rangebegin, rangemid);
addvalrange(begin, end, val, ptr * 2 + 2, rangemid, rangeend);
addtree[ptr].first += val * (min(rangeend, end) - max(rangebegin, begin));
maxtree[ptr] = VI::max(maxtree[ptr * 2 + 1], maxtree[ptr * 2 + 2]);
}
inline void _applyDown(int ptr) {
//if (size - 1 <= ptr) return;
if (mark[ptr] & 1) {
mark[ptr] ^= 1;
int c1 = ptr * 2 + 1;
int c2 = ptr * 2 + 2;
addtree[c1].first += addtree[ptr].second;
addtree[c1].second += addtree[ptr].second / 2;
mark[c1] |= 1;
addtree[c2].first += addtree[ptr].second;
addtree[c2].second += addtree[ptr].second / 2;
mark[c2] |= 1;
addtree[ptr].second = 0;
}
if (mark[ptr] & 2) {
mark[ptr] ^= 2;
int c1 = ptr * 2 + 1;
int c2 = ptr * 2 + 2;
maxtree[c1].val += single[ptr];
single[c1] += single[ptr];
mark[c1] |= 2;
maxtree[c2].val += single[ptr];
single[c2] += single[ptr];
mark[c2] |= 2;
single[ptr] = 0;
}
}
inline void _downward_applyDown(int ptr1) {
if (1 < ptr1) _downward_applyDown(ptr1 >> 1);
_applyDown(ptr1 - 1);
}
T getval(int index) {
T sum = 0;
_downward_applyDown((index + size) >> 1);
return addtree[index + size - 1].first;
}
T getsumrange(int begin, int end, int ptr = 0, int rangebegin = 0, int rangeend = 0) {
if (rangeend <= rangebegin) { rangeend = size; }
if (rangeend <= begin || end <= rangebegin) return 0; // note:
if (begin <= rangebegin && rangeend <= end) return addtree[ptr].first;
_applyDown(ptr);
int rangemid = (rangebegin + rangeend) / 2;
return getsumrange(begin, end, ptr * 2 + 1, rangebegin, rangemid)
+ getsumrange(begin, end, ptr * 2 + 2, rangemid, rangeend);
}
VI getmaxrange(int begin, int end, int ptr = 0, int rangebegin = 0, int rangeend = 0) {
if (rangeend <= rangebegin) { rangeend = size; }
if (rangeend <= begin || end <= rangebegin) return VI(0, -1); // note:
if (begin <= rangebegin && rangeend <= end) return maxtree[ptr];
_applyDown(ptr);
int rangemid = (rangebegin + rangeend) / 2;
VI l = getmaxrange(begin, end, ptr * 2 + 1, rangebegin, rangemid);
VI r = getmaxrange(begin, end, ptr * 2 + 2, rangemid, rangeend);
if (l.idx == -1) return r;
if (r.idx == -1) return l;
return VI::max(l, r);
}
};
ll n;
ll aa[100010];
int main() {
scanner >> n;
scanner.in(aa, aa + n);
segtree<ll> seg(n);
ll count = 0;
for (int i = 0; i < n; ++i) {
ll a = aa[i];
count += seg.getsumrange(a, n);
seg.addvalrange(a - 1, a, 1);
}
cout << count << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0