結果
問題 | No.742 にゃんにゃんにゃん 猫の挨拶 |
ユーザー |
![]() |
提出日時 | 2024-01-03 15:17:08 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 6 ms / 2,500 ms |
コード長 | 3,350 bytes |
コンパイル時間 | 1,102 ms |
コンパイル使用メモリ | 124,188 KB |
最終ジャッジ日時 | 2025-02-18 16:01:50 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 |
ソースコード
#include <iostream>#include <string>#include <vector>#include <algorithm>#include <array>#include <cctype>#include <cstring>#include <cstdlib>#include <cassert>#include <cmath>#include <ctime>#include <iomanip>#include <numeric>#include <stack>#include <queue>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <bitset>#include <random>#include <utility>#include <functional>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};/* using mint = modint<998244353>; */using mint = modint<1000000007>;template<class T> struct BIT{private:int N;vector<T> node;public:BIT() : N(0) {}BIT(int N) : N(N), node(N) {}void add(int pos,T x){assert(0 <= pos && pos < N);pos++;while(pos <= N){node[pos-1] += x;pos += pos & -pos;}}T sum(int l,int r){assert(0 <= l && l <= N && r <= N);return sum(r) - sum(l);}T sum(int r){T ret = 0;while(r > 0){ret += node[r-1];r -= r & -r;}return ret;}T sum() {return sum(N);}};void solve(){int N;cin >> N;int ans = 0;BIT<int> bit(N);for(int i = 0;i < N;i++){int M;cin >> M;M--;ans += bit.sum(M,N);bit.add(M,1);}cout << ans << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;/* cin >> tt; */while(tt--) solve();}