#775115 (D) No.1997 X Lighting

• 問題: No.1997 X Lighting
• ユーザー: 👑 hos.lyric
• 提出日時: 2022-07-01 22:02:30
• 言語: D (dmd 2.109.1)
• 結果: AC
• 実行時間: 172 ms / 2,000 ms
• コード長: 2,760 bytes
• コンパイル時間: 990 ms
• コンパイル使用メモリ: 125,208 KB
• 実行使用メモリ: 23,500 KB
• 最終ジャッジ日時: 2024-06-22 15:35:39
• 合計ジャッジ時間: 5,523 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
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
83
84
85
86
87
88
89
90
91
92
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons
    ;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens
    .popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }
bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }
int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; 
    (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }
void main() {
  try {
    for (; ; ) {
      const N = readLong;
      const M = readInt;
      auto X = new long[M];
      auto Y = new long[M];
      foreach (i; 0 .. M) {
        X[i] = readLong;
        Y[i] = readLong;
      }
      
      int[long] onA, onB;
      foreach (i; 0 .. M) {
        // onA[X[i] + Y[i]] ^= 1;
        // onB[X[i] - Y[i]] ^= 1;
        onA[X[i] + Y[i]] = 1;
        onB[X[i] - Y[i]] = 1;
      }
      long[] as, bs;
      foreach (key, val; onA) if (val) as ~= key;
      foreach (key, val; onB) if (val) bs ~= key;
      as.sort;
      bs.sort;
      debug {
        writeln("as = ", as);
        writeln("bs = ", bs);
      }
      long[][2] bss;
      foreach (b; bs) {
        bss[cast(int)(b & 1)] ~= b;
      }
      
      long ans;
      foreach (a; as) {
        ans += N - abs(a - (N + 1));
      }
      foreach (b; bs) {
        ans += N - abs(b);
      }
      foreach (a; as) {
        // x + y = a
        // min (x - y), max (x - y)
        const s = cast(int)(a & 1);
        const d = N - 1 - abs(a - (N + 1));
        const posL = bss[s].lowerBound(-d);
        const posR = bss[s].lowerBound(d + 1);
        debug {
          writeln(a, ": ", bss[s][posL .. posR]);
        }
        // ans -= 2 * (posR - posL);
        ans -= (posR - posL);
      }
      /*
      debug {
        writeln("ans = ", ans);
      }
      foreach (i; 0 .. M) {
        if (onA[X[i] + Y[i]] ^ onB[X[i] - Y[i]]) {
          --ans;
        } else {
          ++ans;
        }
      }
      */
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX