Submission #319645
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(); if (N > 5001) { Console.WriteLine("GiveUp!"); return; } int[] f = new int[N]; int[] DP = new int[N+1]; DP[0] = 1; for (int i = 0; i < N; i++) { f[i] = sc.NextInt(); } for (int i = 0; i < N; i++) { HashSet<int> notDaburi = new HashSet<int>(); for (int j = i; j < N; j++) { if (!notDaburi.Contains(f[j])) { notDaburi.Add(f[j]); DP[j + 1] = (DP[j+1] + DP[i]) % 1000000007; } else break; } } Console.WriteLine(DP[N]); } } 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 | D - サプリメント |
User | pekoong |
Language | C# (Mono 2.10.8.1) |
Score | 30 |
Code Size | 3309 Byte |
Status | WA |
Exec Time | 2242 ms |
Memory | 10588 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt |
Subtask1 | 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, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.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, 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 135 ms | 10080 KB |
subtask0-sample02.txt | AC | 135 ms | 10084 KB |
subtask1-01.txt | AC | 146 ms | 10332 KB |
subtask1-02.txt | AC | 147 ms | 10316 KB |
subtask1-03.txt | AC | 142 ms | 10348 KB |
subtask1-04.txt | AC | 187 ms | 10336 KB |
subtask1-05.txt | AC | 145 ms | 10268 KB |
subtask1-06.txt | AC | 152 ms | 10336 KB |
subtask1-07.txt | AC | 199 ms | 10332 KB |
subtask1-08.txt | AC | 156 ms | 10336 KB |
subtask1-09.txt | AC | 152 ms | 10348 KB |
subtask1-10.txt | AC | 158 ms | 10332 KB |
subtask1-11.txt | AC | 144 ms | 10320 KB |
subtask1-12.txt | AC | 181 ms | 10348 KB |
subtask1-13.txt | AC | 189 ms | 10332 KB |
subtask1-14.txt | AC | 201 ms | 10280 KB |
subtask1-15.txt | AC | 151 ms | 10348 KB |
subtask1-16.txt | AC | 171 ms | 10332 KB |
subtask1-17.txt | AC | 250 ms | 10336 KB |
subtask1-18.txt | AC | 2242 ms | 10588 KB |
subtask1-19.txt | AC | 154 ms | 10344 KB |
subtask1-20.txt | AC | 149 ms | 10336 KB |
subtask2-01.txt | WA | 109 ms | 9356 KB |
subtask2-02.txt | WA | 110 ms | 9344 KB |
subtask2-03.txt | WA | 110 ms | 9352 KB |
subtask2-04.txt | WA | 111 ms | 9464 KB |
subtask2-05.txt | WA | 109 ms | 9472 KB |
subtask2-06.txt | WA | 110 ms | 9340 KB |
subtask2-07.txt | WA | 114 ms | 9356 KB |
subtask2-08.txt | WA | 109 ms | 9344 KB |
subtask2-09.txt | WA | 111 ms | 9472 KB |
subtask2-10.txt | WA | 110 ms | 9396 KB |
subtask2-11.txt | WA | 109 ms | 9352 KB |
subtask2-12.txt | WA | 111 ms | 9384 KB |
subtask2-13.txt | WA | 111 ms | 9340 KB |
subtask2-14.txt | WA | 110 ms | 9344 KB |
subtask2-15.txt | WA | 111 ms | 9356 KB |
subtask2-16.txt | WA | 113 ms | 9380 KB |
subtask2-17.txt | WA | 109 ms | 9340 KB |
subtask2-18.txt | WA | 115 ms | 9348 KB |
subtask2-19.txt | WA | 111 ms | 9384 KB |
subtask2-20.txt | WA | 110 ms | 9356 KB |