Submission #229553
Source Code Expand
using System; using System.Collections.Generic; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; using System.Diagnostics; using Enu = System.Linq.Enumerable; class Program { static readonly int Max = (int)1e6; void Solve() { int N = reader.Int(); int[] A = new int[Max + 2]; for (int i = 0; i < N; i++) { int L = reader.Int(), R = reader.Int(); A[L]++; A[R + 1]--; } for (int i = 1; i <= Max; i++) A[i] += A[i - 1]; Console.WriteLine(A.Max()); } static void Main() { new Program().Solve(); } Reader reader = new Reader(Console.In); class Reader { private readonly TextReader reader; private readonly char[] separator = new char[] { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enumerable.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enumerable.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enumerable.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } } }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | eitaho |
Language | C# (Mono 2.10.8.1) |
Score | 100 |
Code Size | 2350 Byte |
Status | AC |
Exec Time | 649 ms |
Memory | 15976 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt |
Subtask2 | subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 170 ms | 12464 KB |
subtask0_sample02.txt | AC | 173 ms | 12448 KB |
subtask1_01.txt | AC | 171 ms | 12448 KB |
subtask1_02.txt | AC | 172 ms | 12580 KB |
subtask1_03.txt | AC | 310 ms | 12740 KB |
subtask1_04.txt | AC | 175 ms | 12832 KB |
subtask1_05.txt | AC | 179 ms | 12764 KB |
subtask1_06.txt | AC | 176 ms | 12904 KB |
subtask1_07.txt | AC | 180 ms | 12832 KB |
subtask1_08.txt | AC | 179 ms | 12952 KB |
subtask1_09.txt | AC | 179 ms | 12816 KB |
subtask1_10.txt | AC | 177 ms | 12848 KB |
subtask1_11.txt | AC | 178 ms | 12844 KB |
subtask1_12.txt | AC | 178 ms | 12820 KB |
subtask1_13.txt | AC | 180 ms | 12832 KB |
subtask1_14.txt | AC | 180 ms | 12836 KB |
subtask1_15.txt | AC | 178 ms | 12840 KB |
subtask2_01.txt | AC | 649 ms | 15928 KB |
subtask2_02.txt | AC | 288 ms | 15896 KB |
subtask2_03.txt | AC | 270 ms | 15908 KB |
subtask2_04.txt | AC | 289 ms | 15888 KB |
subtask2_05.txt | AC | 275 ms | 15896 KB |
subtask2_06.txt | AC | 295 ms | 15900 KB |
subtask2_07.txt | AC | 298 ms | 15916 KB |
subtask2_08.txt | AC | 297 ms | 15892 KB |
subtask2_09.txt | AC | 295 ms | 15976 KB |
subtask2_10.txt | AC | 295 ms | 15908 KB |
subtask2_11.txt | AC | 300 ms | 15976 KB |
subtask2_12.txt | AC | 295 ms | 15920 KB |
subtask2_13.txt | AC | 296 ms | 15976 KB |
subtask2_14.txt | AC | 298 ms | 15904 KB |
subtask2_15.txt | AC | 299 ms | 15888 KB |
subtask2_16.txt | AC | 302 ms | 15952 KB |
subtask2_17.txt | AC | 297 ms | 15892 KB |
subtask2_18.txt | AC | 298 ms | 15904 KB |
subtask2_19.txt | AC | 300 ms | 15912 KB |
subtask2_20.txt | AC | 293 ms | 15892 KB |
subtask2_21.txt | AC | 307 ms | 15900 KB |
subtask2_22.txt | AC | 298 ms | 15884 KB |
subtask2_23.txt | AC | 305 ms | 15904 KB |
subtask2_24.txt | AC | 298 ms | 15920 KB |
subtask2_25.txt | AC | 294 ms | 15920 KB |