#775308 (C++17) No.1997 X Lighting

• 問題: No.1997 X Lighting
• ユーザー: kwm_t
• 提出日時: 2022-07-01 22:48:19
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 208 ms / 2,000 ms
• コード長: 1,885 bytes
• コンパイル時間: 2,914 ms
• コンパイル使用メモリ: 200,812 KB
• 最終ジャッジ日時: 2025-01-30 03:19:18
• ジャッジサーバーID （参考情報）: judge4 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 30

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long n, m; cin >> n >> m;
    set<long long>sx, sy;
    rep(i, m) {
        long long x, y; cin >> x >> y;
        x--, y--;
        sx.insert(x + y);
        sy.insert(x - y);
    }
    long long ans = 0;
    vector<long long>syv0;
    vector<long long>syv1;
    for (auto e : sy) {
        if (0 == abs(e) % 2)syv0.push_back(e);
        else syv1.push_back(e);
    }
    for (auto e : sx) {
        long long mnx, mny, mxx, mxy;
        if (e < n) {
            mnx = e;
            mny = 0;
            mxx = 0;
            mxy = e;
        }
        else {
            mnx = n - 1;
            mny = e - (n - 1);
            mxx = e - (n - 1);
            mxy = n - 1;
        }
        ans += mxy - mny + 1;
        if (0 == abs(mnx - mny) % 2) {
            ans -= (
                upper_bound(all(syv0), mnx - mny)
                - lower_bound(all(syv0), mxx - mxy)
                );
        }
        else {
            ans -= (
                upper_bound(all(syv1), mnx - mny)
                - lower_bound(all(syv1), mxx - mxy)
                );
        }
    }
    for (auto e : sy) {
        long long mn, mx;
        if (e <= 0) {
            mn = -e;
            mx = n - 1;
        }
        else {
            mn = 0;
            mx = (n - 1) - e;
        }
        ans += mx - mn + 1;
    }
    cout << ans << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX