結果

問題 No.1997 X Lighting
ユーザー recososo
提出日時 2022-07-01 23:47:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 4,146 bytes
コンパイル時間 4,414 ms
コンパイル使用メモリ 256,860 KB
最終ジャッジ日時 2025-01-30 03:37:28
ジャッジサーバーID
（参考情報） 		judge1 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
#define ALLR(v) (v).rbegin(),(v).rend()
#define fi first
#define se second
#define PB push_back
#define EB emplace_back
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}};
template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;}
void foo() {cerr << endl;}
template <class Head, class... Tail>void foo(Head&& head, Tail&&... tail){cerr << head << " ";foo(move(tail)...);}
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; }
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
// const int mod=1e9+7;
const int mod=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
using mint=modint998244353;
// using mint=modint1000000007;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m;cin >> n >> m;
    vector<ll> x(m),y(m);
    vector<ll> a,b,c,d;
    REP(i,m){
        cin >> x[i] >> y[i];
        x[i]--,y[i]--;
        if((x[i]+y[i])%2==0) a.PB(x[i]+y[i]);
        else c.PB(x[i]+y[i]);
        if((x[i]+n-1-y[i]+n-1)%2==0) b.PB(x[i]+n-1-y[i]);
        else d.PB(x[i]+n-1-y[i]);
    }
    sort(ALL(a));
    a.erase(unique(ALL(a)),a.end());
    sort(ALL(b));
    b.erase(unique(ALL(b)),b.end());
    sort(ALL(c));
    c.erase(unique(ALL(c)),c.end());
    sort(ALL(d));
    d.erase(unique(ALL(d)),d.end());
    ll ans=0;
    REP(i,a.size()) ans+=min(a[i]+1,n*2-a[i]-1);
    REP(i,b.size()) ans+=min(b[i]+1,n*2-b[i]-1);
    REP(i,c.size()) ans+=min(c[i]+1,n*2-c[i]-1);
    REP(i,d.size()) ans+=min(d[i]+1,n*2-d[i]-1);
    // debug(a);
    // debug(b);
    // debug(c);
    // debug(d);
    // 0 n-1,n-1
    // n-1 0,2n-1
    // 2n-1 n-1,n-1
    // foo(ans);
    REP(i,a.size()){
        int l=lower_bound(ALL(b),abs(n-1-a[i]))-b.begin();
        int r=upper_bound(ALL(b),n*2-1-abs(n-1-a[i]))-b.begin();
        ans-=r-l;
        // foo(a[i],l,r,r-l);
        // FOR(j,l,r) cerr << b[j] << ",";
        // cerr << endl;
    }
    REP(i,c.size()){
        int l=lower_bound(ALL(d),abs(n-1-c[i]))-d.begin();
        int r=upper_bound(ALL(d),n*2-1-abs(n-1-c[i]))-d.begin();
        ans-=r-l;
        // foo(c[i],l,r,r-l);
        // FOR(j,l,r) cerr << d[j] << ",";
        // cerr << endl;
    }
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0