#689536 (C++17) No.1649 Manhattan Square

提出ソース

結果

問題	No.1649 Manhattan Square
ユーザー	PCTprobability
提出日時	2021-08-13 23:08:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,159 bytes
コンパイル時間	7,757 ms
コンパイル使用メモリ	320,840 KB
実行使用メモリ	348,324 KB
最終ジャッジ日時	2024-10-03 22:36:07
合計ジャッジ時間	74,586 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	24 ms 11,008 KB
testcase_03	AC	24 ms 10,880 KB
testcase_04	AC	24 ms 11,008 KB
testcase_05	AC	24 ms 11,008 KB
testcase_06	AC	23 ms 10,880 KB
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	AC	998 ms 347,552 KB
testcase_43	AC	2 ms 5,248 KB
testcase_44	AC	2 ms 5,248 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 9100000000000000000ll;
const ld eps = ld(0.0000000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
using mint = modint998244353;
struct Node {
  Node *left, *right;
  mint v;

  Node() : left(nullptr), right(nullptr), v(0) {}
};

// Dynamic Segment Tree

class SegmentTree {
  Node *root;
  int n, n0;

  mint query(int a, int b, Node *n, int l, int r) {
    if(a <= l && r <= b) {
      return n->v;
    }
    if(r <= a || b <= l) {
      return 0;
    }

    mint lv = n->left ? query(a, b, n->left, l, (l + r) >> 1) : 0;
    mint rv = n->right ? query(a, b, n->right, (l + r) >> 1, r) : 0;
    return (lv + rv) ;
  }

public:
  SegmentTree(int n) : n(n) {
    n0 = 1;
    while(n0 < n) n0 <<= 1;
    root = new Node();
  }
  ~SegmentTree() {
    delete root; root = nullptr;
  }

  void update(int k, mint x) {
    Node *n = root;
    int l = 0, r = n0;
    n->v = (n->v + x) ;
    while(r-l > 1) {
      int m = (l + r) >> 1;
      if(k < m) {
        if(!n->left) n->left = new Node();
        n = n->left;

        r = m;
      } else {
        if(!n->right) n->right = new Node();
        n = n->right;

        l = m;
      }
      n->v = (n->v + x) ;
    }
  }

  mint query(int a, int b) {
    return query(a, b, root, 0, n0);
  }
};
int main() {
  cincout();
  ll n;
  cin>>n;
  vector<ll> a(n),b(n);
  for(int i=0;i<n;i++){
    ll x,y;
    cin>>x>>y;
    a[i]=x;
    b[i]=y;
  }
  mint ans=0;
  for(int i=0;i<n;i++){
    ans+=mint(mint(a[i]*a[i])+mint(b[i]*b[i]))*mint(n);
  }
  mint sum=0,sum2=0;
  for(int i=0;i<n;i++){
    sum+=a[i];
    sum2+=b[i];
  }
  ans-=(sum*sum+sum2*sum2);
  mint ans2=0;
  vector<P> s;
  for(int i=0;i<n;i++) s.pb({a[i],b[i]});
  vector<mint> x(n),y(n);
  vector<ll> z(n);
  sor(s);
  for(int i=0;i<n;i++){
    x[i]=s[i].fi;
    y[i]=s[i].se;
    z[i]=s[i].se;
  }
  SegmentTree seg(1001000000),seg2(1001000000),seg3(1001000000),seg4(1001000000);
  for(int i=0;i<n;i++){
    ans2-=x[i]*seg2.query(0,z[i]);
    ans2-=y[i]*seg.query(0,z[i]);
    ans2+=x[i]*seg2.query(z[i],1001000000);
    ans2+=y[i]*seg.query(z[i],1001000000);
  //  cout<<x[i].val()<<" "<<y[i].val()<<" "<<seg.query(0,y[i].val()).val()<<" "<<seg.query(y[i].val(),1001000000).val()<<endl;
   // cout<<ans2.val()<<endl;
    ans2+=seg3.query(0,z[i])*(x[i]*y[i])+(seg4.query(0,z[i]));
   // cout<<ans2.val()<<" "<<seg3.query(0,y[i])*(seg4.query(0,y[i])+x[i]*y[i])<<endl;
    ans2-=seg3.query(z[i],1001000000)*(x[i]*y[i])+(seg4.query(z[i],1001000000));
   // cout<<ans2.val()<<" "<<seg3.query(y[i],1001000000)<<endl;
    seg.update(z[i],seg.query(z[i],z[i]+1)+x[i]);
    seg2.update(z[i],seg2.query(z[i],z[i]+1)+y[i]);
    seg3.update(z[i],seg3.query(z[i],z[i]+1)+1);
    seg4.update(z[i],seg4.query(z[i],z[i]+1)+x[i]*y[i]);
  //  cout<<ans2.val()<<endl;
  }
 // cout<<ans2.val()<<endl;
  cout<<(ans+ans2*2).val()<<endl;
}

yukicoder

結果

テストケース

ソースコード