Submission #319375
Source Code Expand
using System; using System.Collections.Generic; using System.Linq; using System.Text; using sc = Scanner; class Program { static Tuple<string, double, string>[] dataSet; static void Main(string[] args) { int N = sc.NextInt(); int M = sc.NextInt(); Tuple<int, int[]>[] data = new Tuple<int,int[]>[N]; int answer =0; for (int i = 0; i < N; i++) { int l = sc.NextInt(); int r = sc.NextInt(); int s = sc.NextInt(); data[i] = new Tuple<int, int[]>(s,new int[]{l,r}); } Array.Sort(data, (a, b) => { return a.Item2[0] - b.Item2[0]; }); for (int i = 1; i < M+1; i++)//iを取るのを禁止したときの最大化を目指す 101は無理だけど100はいけるはず { int tmp = 0; for (int j = 0; j < data.Length; j++) { if (!( i >= data[j].Item2[0] && i <= data[j].Item2[1]) ) { tmp += data[j].Item1; } } answer = Math.Max(answer,tmp); } Console.WriteLine(answer); } static int[] Union(int[] a , int[] b) { return new int[]{a[0],b[1]}; } } public static class Scanner { public static string NextString() { string tmp = ""; while (true) { string readData = char.ConvertFromUtf32(Console.Read()); if (readData == " " || readData == "\n") break; tmp += readData; } return tmp; } public static string[] NextStrArray() { return Console.ReadLine().Split(' '); } public static long[] NextLongArray() { string[] s = NextStrArray(); long[] a = new long[s.Length]; for (int i = 0; i < a.Length; i++) { a[i] = long.Parse(s[i]); } return a; } public static int[] NextIntArray() { string[] s = NextStrArray(); int[] a = new int[s.Length]; for (int i = 0; i < a.Length; i++) { a[i] = int.Parse(s[i]); } return a; } public static int NextInt() { string tmp = ""; while (true) { string readData = char.ConvertFromUtf32(Console.Read()); if (readData == " " || readData == "\n") break; tmp += readData; } return int.Parse(tmp); } public static double NextDouble() { string tmp = ""; while (true) { string readData = char.ConvertFromUtf32(Console.Read()); if (readData == " " || readData == "\n") break; tmp += readData; } return double.Parse(tmp); } public static long NextLong() { string tmp = ""; while (true) { string readData = char.ConvertFromUtf32(Console.Read()); if (readData == " " || readData == "\n") break; tmp += readData; } return long.Parse(tmp); } public static double[] NextDoubleArray() { string[] s = NextStrArray(); double[] a = new double[s.Length]; for (int i = 0; i < a.Length; i++) { a[i] = double.Parse(s[i]); } return a; } }
Submission Info
Submission Time | |
---|---|
Task | C - ハイスコア |
User | pekoong |
Language | C# (Mono 2.10.8.1) |
Score | 100 |
Code Size | 3551 Byte |
Status | TLE |
Exec Time | 6040 ms |
Memory | 19320 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | 0 / 1 | ||||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt |
Subtask2 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.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 |
Subtask3 | subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.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, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.txt, subtask3-11.txt, subtask3-12.txt, subtask3-13.txt, subtask3-14.txt, subtask3-15.txt, subtask3-16.txt, subtask3-17.txt, subtask3-18.txt, subtask3-19.txt, subtask3-20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 152 ms | 7772 KB |
subtask0-sample02.txt | AC | 155 ms | 7832 KB |
subtask0-sample03.txt | AC | 153 ms | 7800 KB |
subtask1-01.txt | AC | 151 ms | 7852 KB |
subtask1-02.txt | AC | 151 ms | 7836 KB |
subtask1-03.txt | AC | 150 ms | 7836 KB |
subtask1-04.txt | AC | 154 ms | 7788 KB |
subtask1-05.txt | AC | 152 ms | 7808 KB |
subtask1-06.txt | AC | 149 ms | 7716 KB |
subtask1-07.txt | AC | 151 ms | 7740 KB |
subtask1-08.txt | AC | 149 ms | 7716 KB |
subtask1-09.txt | AC | 151 ms | 7788 KB |
subtask1-10.txt | AC | 150 ms | 7708 KB |
subtask1-11.txt | AC | 151 ms | 7724 KB |
subtask1-12.txt | AC | 149 ms | 7712 KB |
subtask1-13.txt | AC | 152 ms | 7728 KB |
subtask1-14.txt | AC | 148 ms | 7832 KB |
subtask1-15.txt | AC | 150 ms | 7832 KB |
subtask1-16.txt | AC | 152 ms | 7784 KB |
subtask1-17.txt | AC | 149 ms | 7832 KB |
subtask1-18.txt | AC | 150 ms | 7788 KB |
subtask1-19.txt | AC | 149 ms | 7748 KB |
subtask1-20.txt | AC | 152 ms | 7840 KB |
subtask2-01.txt | AC | 163 ms | 7980 KB |
subtask2-02.txt | AC | 155 ms | 7876 KB |
subtask2-03.txt | AC | 151 ms | 7844 KB |
subtask2-04.txt | AC | 255 ms | 8420 KB |
subtask2-05.txt | AC | 256 ms | 8416 KB |
subtask2-06.txt | AC | 340 ms | 8456 KB |
subtask2-07.txt | AC | 434 ms | 8416 KB |
subtask2-08.txt | AC | 508 ms | 8476 KB |
subtask2-09.txt | AC | 620 ms | 8472 KB |
subtask2-10.txt | AC | 583 ms | 8472 KB |
subtask2-11.txt | AC | 620 ms | 8368 KB |
subtask2-12.txt | AC | 580 ms | 8488 KB |
subtask2-13.txt | AC | 586 ms | 8432 KB |
subtask2-14.txt | AC | 583 ms | 8416 KB |
subtask2-15.txt | AC | 620 ms | 8424 KB |
subtask2-16.txt | AC | 621 ms | 8484 KB |
subtask2-17.txt | AC | 621 ms | 8488 KB |
subtask2-18.txt | AC | 582 ms | 8416 KB |
subtask2-19.txt | AC | 622 ms | 8408 KB |
subtask2-20.txt | AC | 579 ms | 8496 KB |
subtask3-01.txt | TLE | 6033 ms | 9676 KB |
subtask3-02.txt | TLE | 6033 ms | 13140 KB |
subtask3-03.txt | AC | 573 ms | 18720 KB |
subtask3-04.txt | TLE | 6032 ms | 18640 KB |
subtask3-05.txt | TLE | 6031 ms | 19172 KB |
subtask3-06.txt | TLE | 6033 ms | 18684 KB |
subtask3-07.txt | TLE | 6034 ms | 19316 KB |
subtask3-08.txt | TLE | 6032 ms | 18660 KB |
subtask3-09.txt | TLE | 6040 ms | 18608 KB |
subtask3-10.txt | TLE | 6034 ms | 18640 KB |
subtask3-11.txt | TLE | 6034 ms | 19304 KB |
subtask3-12.txt | TLE | 6033 ms | 19280 KB |
subtask3-13.txt | TLE | 6032 ms | 18672 KB |
subtask3-14.txt | TLE | 6032 ms | 19320 KB |
subtask3-15.txt | TLE | 6033 ms | 18648 KB |
subtask3-16.txt | TLE | 6035 ms | 19164 KB |
subtask3-17.txt | TLE | 6033 ms | 19284 KB |
subtask3-18.txt | TLE | 6035 ms | 18684 KB |
subtask3-19.txt | TLE | 6034 ms | 19176 KB |
subtask3-20.txt | TLE | 6032 ms | 18764 KB |