Submission #1263482
Source Code Expand
import std.stdio, std.array, std.string, std.conv, std.algorithm; import std.typecons, std.range, std.random, std.math, std.container; import std.numeric, std.bigint, core.bitop; void main() { auto s = readln.split.map!(to!int); auto N = s[0]; auto M = s[1]; auto A = new int[](N+1); foreach (i; 0..M) { s = readln.split.map!(to!int); A[s[0]-1] += 1; A[s[1]-1] -= 1; } foreach (i; 0..N) { A[i+1] += A[i]; } writeln((N-1).iota.map!(i => A[i] % 2 == 0).all ? "YES" : "NO"); }
Submission Info
Submission Time | |
---|---|
Task | B - Unplanned Queries |
User | nebukuro09 |
Language | D (DMD64 v2.070.1) |
Score | 500 |
Code Size | 568 Byte |
Status | AC |
Exec Time | 77 ms |
Memory | 3708 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 76 ms | 1660 KB |
in10.txt | AC | 75 ms | 1660 KB |
in11.txt | AC | 71 ms | 1276 KB |
in12.txt | AC | 75 ms | 3452 KB |
in13.txt | AC | 77 ms | 3580 KB |
in14.txt | AC | 75 ms | 1660 KB |
in15.txt | AC | 1 ms | 256 KB |
in16.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 75 ms | 1660 KB |
in3.txt | AC | 75 ms | 3708 KB |
in4.txt | AC | 76 ms | 3708 KB |
in5.txt | AC | 76 ms | 3324 KB |
in6.txt | AC | 75 ms | 1660 KB |
in7.txt | AC | 75 ms | 1660 KB |
in8.txt | AC | 75 ms | 1660 KB |
in9.txt | AC | 75 ms | 1660 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |