Submission #401358
Source Code Expand
using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace AtCoderBeginnerContest023 { class Program { static void A() { int a = int.Parse(Console.ReadLine()); Console.WriteLine(a % 10 + a / 10); } static void B() { int N = int.Parse(Console.ReadLine()); string s = Console.ReadLine(); int ans = -1; string o = "b"; for(int i = 0;i<N;i++) { if(i % 3 == 0 && i > 0) { o = "b" + o + "b"; }else if(i % 3 == 1) { o = "a"+o+"c"; }else if(i % 3 == 2) { o = "c" + o + "a"; } if(s.Equals(o)) { ans = i; break; } } Console.WriteLine(ans); } static void C() { string[] str = Console.ReadLine().Split(' '); int R = int.Parse(str[0]); int C = int.Parse(str[1]); int K = int.Parse(str[2]); int N = int.Parse(Console.ReadLine()); int[,] table = new int[R+1,C+1]; for(int i = 0;i<N;i++) { string[] s = Console.ReadLine().Split(' '); int r = int.Parse(s[0]); int c = int.Parse(s[1]); table[r, c] = 1; } int count = 0; for (int i = 1; i < R + 1; i++) { for (int j = 1; j < C + 1; j++) { int rows = 0; int columns = 0; int sum = 0; for(int ii = i + 1;ii<R+1;ii++) { if (table[ii, j] == 1) rows++; } for(int ii=i-1;ii>=1;ii--) { if (table[ii, j] == 1) rows++; } for(int jj = j + 1;jj<C+1;jj++) { if (table[i, jj] == 1) columns++; } for(int jj = j -1;jj >= 1;jj--) { if (table[i, jj] == 1) columns++; } if (table[i, j] == 1) sum++; if (sum + rows + columns == K) count++; } } Console.WriteLine(count); } static void Main(string[] args) { //A(); //B(); C(); } } }
Submission Info
Submission Time | |
---|---|
Task | C - 収集王 |
User | tookunn |
Language | C# (Mono 3.2.1.0) |
Score | 30 |
Code Size | 2871 Byte |
Status | TLE |
Exec Time | 2061 ms |
Memory | 156944 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, 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 |
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, 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 103 ms | 8884 KB |
subtask0-sample02.txt | AC | 102 ms | 8856 KB |
subtask0-sample03.txt | AC | 102 ms | 8880 KB |
subtask1-01.txt | AC | 102 ms | 8884 KB |
subtask1-02.txt | AC | 103 ms | 8796 KB |
subtask1-03.txt | AC | 101 ms | 8880 KB |
subtask1-04.txt | AC | 104 ms | 8884 KB |
subtask1-05.txt | AC | 101 ms | 8788 KB |
subtask1-06.txt | AC | 102 ms | 8884 KB |
subtask1-07.txt | AC | 102 ms | 8884 KB |
subtask1-08.txt | AC | 102 ms | 8880 KB |
subtask1-09.txt | AC | 103 ms | 8876 KB |
subtask1-10.txt | AC | 100 ms | 8884 KB |
subtask1-11.txt | AC | 101 ms | 8884 KB |
subtask1-12.txt | AC | 104 ms | 8884 KB |
subtask1-13.txt | AC | 107 ms | 8880 KB |
subtask1-14.txt | AC | 106 ms | 8860 KB |
subtask1-15.txt | AC | 106 ms | 8860 KB |
subtask2-01.txt | TLE | 2033 ms | 9804 KB |
subtask2-02.txt | TLE | 2034 ms | 10576 KB |
subtask2-03.txt | TLE | 2035 ms | 21960 KB |
subtask2-04.txt | TLE | 2035 ms | 13460 KB |
subtask2-05.txt | TLE | 2061 ms | 156944 KB |
subtask2-06.txt | RE | 108 ms | 8648 KB |
subtask2-07.txt | AC | 684 ms | 13184 KB |
subtask2-08.txt | RE | 117 ms | 8648 KB |
subtask2-09.txt | RE | 110 ms | 8648 KB |
subtask2-10.txt | RE | 117 ms | 8640 KB |
subtask2-11.txt | RE | 106 ms | 8540 KB |
subtask2-12.txt | RE | 105 ms | 8648 KB |
subtask2-13.txt | RE | 103 ms | 8648 KB |
subtask2-14.txt | RE | 108 ms | 8632 KB |
subtask2-15.txt | RE | 108 ms | 8644 KB |