結果

問題 No.1997 X Lighting
コンテスト
ユーザー eQe
提出日時 2025-02-22 18:08:46
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 217 ms / 2,000 ms
コード長 7,230 bytes
コンパイル時間 7,191 ms
コンパイル使用メモリ 332,808 KB
実行使用メモリ 13,668 KB
最終ジャッジ日時 2025-02-22 18:08:58
合計ジャッジ時間 11,781 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij-->0;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;if(s)r[2]*=-1;return r;}
constexpr char newline=10;
constexpr char space=32;
constexpr auto odd(auto x){return x&1;}
auto max(auto...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}
auto min(auto...a){return min(initializer_list<common_type_t<decltype(a)...>>{a...});}

template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(const std::pair<A,B>&p):a(p.first),b(p.second){}
  auto operator<=>(const pair&)const=default;
  pair operator+(const pair&p)const{return{a+p.a,b+p.b};}
  friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}
};

template<class F=less<>>auto&sort(auto&a,F f={}){ranges::sort(a,f);return a;}

template<class T>ostream&operator<<(ostream&o,const multiset<T>&s){fe(s,e)o<<e<<string(&e!=&*s.rbegin(),space);return o;}

template<class T>struct multiset:std::multiset<T>{
  multiset(const initializer_list<T>&a={}){fe(a,e)this->emplace(e);}
  multiset(const vector<T>&a){fe(a,e)this->emplace(e);}
  ll size()const{return std::multiset<T>::size();}
  auto between(const T&l,const T&r)const{return pair{this->lower_bound(l),this->lower_bound(r)};}
  T back()const{assert(size());return*this->rbegin();}
};

template<class T>struct set:multiset<T>{
  set(const initializer_list<T>&a={}){fe(a,e)this->emplace(e);}
  set(const vector<T>&a){fe(a,e)this->emplace(e);}
  template<class...A>auto emplace(A&&...a){
    T x(std::forward<A>(a)...);
    if(auto p=this->find(x);p!=this->end())return pair{p,0};
    return pair{multiset<T>::emplace(x),1};
  }
};

template<ll k>auto pack_kth(const auto&...a){return get<k>(make_tuple(a...));}
template<class T,ll n>auto pack_slice(const auto&...a){return[&]<size_t...I>(index_sequence<I...>){return array<T,n>{get<I>(forward_as_tuple(a...))...};}(make_index_sequence<n>{});}

template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct vec_attr{using core_type=T;static constexpr int rank=0;};
template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int rank=vec_attr<typename V::value_type>::rank+1;};
template<class T>using core_t=vec_attr<T>::core_type;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}

template<class V>struct vec;
template<ll rank,class T>struct tensor_helper{using type=vec<typename tensor_helper<rank-1,T>::type>;};
template<class T>struct tensor_helper<0,T>{using type=T;};
template<ll rank,class T>using tensor=typename tensor_helper<rank,T>::type;

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}

  template<class...A>requires(sizeof...(A)>=3)vec(A...a){const ll n=sizeof...(a)-1;auto t=pack_slice<ll,n>(a...);ll s[n];fo(i,n)s[i]=t[i];*this=make_vec(s,pack_kth<n>(a...));}
  template<class T,ll n,ll i=0>static auto make_vec(const ll(&s)[n],T x){if constexpr(i==n-1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec operator^(const vec&u)const{return vec{*this}^=u;}
  vec&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]-=u[i];return v;}
  vec operator+(const vec&u)const{return vec{*this}+=u;}
  vec operator-(const vec&u)const{return vec{*this}-=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}

  vec&operator%=(auto M){vec&v=*this;fe(v,e)e%=M;return v;}
  vec operator%(auto M)const{return vec{*this}%=M;}

  ll size()const{return vector<V>::size();}

  auto lower_bound(const V&x)const{return std::lower_bound(this->begin(),this->end(),x);}

  auto between(const V&x,const V&y)const{return pair{this->lower_bound(x),this->lower_bound(y)};}
  auto between_count(const V&x,const V&y)const{auto[p,q]=between(x,y);return my::max(q-p,0);}

  auto scan(const auto&f)const{pair<core_t<V>,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}
  auto max()const{return scan([](auto&a,auto b){a<b?a=b:0;}).a;}
  auto min()const{return scan([](auto&a,auto b){a>b?a=b:0;;}).a;}

  template<class F=less<>>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;}
};
template<class...A>requires(sizeof...(A)>=2)vec(A...a)->vec<tensor<sizeof...(a)-2,remove_reference_t<decltype(get<sizeof...(a)-1>(declval<tuple<A...>>()))>>>;
vec(ll)->vec<ll>;

void lin(auto&...a){(cin>>...>>a);}

void dec(auto&...a){((--a),...);}

void sort(auto&...a){vec<common_type_t<decltype(a)...>>v;(v.eb(a),...);sort(v);ll I=0;((a=v[I++]),...);}

template<class T>struct grid{
  ll H,W;
  grid(ll H,ll W):H(H),W(W){}

  ll sum_count(ll k)const{return min(k+1,H+W-1-k);}
  ll diff_count(ll k)const{return min(H-k,W+k);}

  ll sum_id(const pair<ll,ll>&p)const{return p.a+p.b;}
  ll diff_id(const pair<ll,ll>&p)const{return p.a-p.b;}

  ll sum_count(const pair<ll,ll>&p)const{return sum_count(sum_id(p));}
  ll diff_count(const pair<ll,ll>&p)const{return diff_count(diff_id(p));}

  auto sum_left_down(ll k)const{return k<=H-1?pair{k,0LL}:pair{H-1,k-(H-1)};}
  auto sum_right_up(ll k)const{return k<=W-1?pair{0LL,k}:pair{k-(W-1),W-1};}

  auto sum_cross_diff_range(ll k)const{return pair{diff_id(sum_right_up(k)),diff_id(sum_left_down(k))+1};}
};

void pp(auto&&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,space)),...);cout<<newline;}
single_testcase
void solve(){
  LL(K,N);

  grid<ll>g(K,K);

  ll ans=0;
  set<ll>sum_set,diff_set;
  fo(N){
    LL(x,y);dec(x,y);
    if(!sum_set.contains(x+y)){
      sum_set.emplace(x+y);
      ans+=g.sum_count(x+y);
    }

    if(!diff_set.contains(x-y)){
      diff_set.emplace(x-y);
      ans+=g.diff_count(x-y);
    }
  }

  array<vec<ll>,2>diff_vec;
  fe(diff_set,k)diff_vec[odd(k)].eb(k);
  fo(f,2)sort(diff_vec[f]);

  // 交点の個数を求めて引く．上でダブルカウントしているので．
  fe(sum_set,k){
    auto[l,r]=g.sum_cross_diff_range(k);
    ans-=diff_vec[odd(k)].between_count(l,r);
  }

  pp(ans);
}}
0