結果

問題 No.743 Segments on a Polygon
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-01-31 12:54:27
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 100 ms / 2,000 ms
コード長 2,304 bytes
コンパイル時間 882 ms
コンパイル使用メモリ 129,864 KB
実行使用メモリ 7,184 KB
最終ジャッジ日時 2024-06-13 04:08:32
合計ジャッジ時間 3,636 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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 bAdd(T)(T[] bit, int pos, T val)
in {
assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
for (int x = pos; x < bit.length; x |= x + 1) {
bit[x] += val;
}
}
// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
T sum = 0;
for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
sum += bit[x];
}
return sum;
}
int N, M;
int[] A, B;
void main() {
try {
for (; ; ) {
N = readInt();
M = readInt();
A = new int[N];
B = new int[N];
foreach (i; 0 .. N) {
A[i] = readInt();
B[i] = readInt();
}
auto ps = new Tuple!(int, int)[N];
foreach (i; 0 .. N) {
if (A[i] > B[i]) {
swap(A[i], B[i]);
}
ps[i] = tuple(A[i], B[i]);
}
ps.sort;
debug {
writeln("ps = ", ps);
}
auto bit = new long[M];
long ans;
foreach (i; 0 .. N) {
ans += (bit.bSum(ps[i][1]) - bit.bSum(ps[i][0]));
bit.bAdd(ps[i][1], 1);
}
writeln(ans);
}
} catch (EOFException e) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0