Submission #401348


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ABC023
{
    public class C
    {
        private void Run()
        {
            int res = 0;
            string[] input = Console.ReadLine().Split(' ');
            int R = int.Parse(input[0]);
            int C = int.Parse(input[1]);
            int K = int.Parse(input[2]);
            List<Point> drops = new List<Point>();
            int N = int.Parse(Console.ReadLine());
            for (int i = 0; i < N; i++)
            {
                input = Console.ReadLine().Split(' ');
                drops.Add(new Point(int.Parse(input[0]), int.Parse(input[1])));
            }

            for (int i = 1; i <= R; i++)
                for (int j = 1; j <= C; j++)
                    if (CountDropsFromPos(drops, new Point(i, j),K) == K) { res++; }
            Console.WriteLine(res);
        }
        public int CountDropsFromPos(List<Point> drops,Point pos,int MAX)
        {
            int cnt = 0;
            for (int i = 0; i < drops.Count; i++)
            {
                if (drops[i].X == pos.X || drops[i].Y == pos.Y) cnt++;
                if (MAX < cnt) return -1;
            }
            return cnt;
        }
        private static void Main() { new C().Run(); }
    }
    public class Point
    {
        public int X; public int Y;
        public Point(int x, int y) { this.X = x; this.Y = y; }
    }
}

Submission Info

Submission Time
Task C - 収集王
User pattyo
Language C# (Mono 3.2.1.0)
Score 30
Code Size 1474 Byte
Status TLE
Exec Time 2036 ms
Memory 16892 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 18
AC × 18
TLE × 15
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 112 ms 8740 KB
subtask0-sample02.txt AC 110 ms 8716 KB
subtask0-sample03.txt AC 111 ms 8716 KB
subtask1-01.txt AC 110 ms 8800 KB
subtask1-02.txt AC 109 ms 8864 KB
subtask1-03.txt AC 109 ms 8740 KB
subtask1-04.txt AC 108 ms 8736 KB
subtask1-05.txt AC 113 ms 8720 KB
subtask1-06.txt AC 109 ms 8716 KB
subtask1-07.txt AC 109 ms 8732 KB
subtask1-08.txt AC 110 ms 8820 KB
subtask1-09.txt AC 109 ms 8860 KB
subtask1-10.txt AC 109 ms 8840 KB
subtask1-11.txt AC 111 ms 8844 KB
subtask1-12.txt AC 108 ms 8736 KB
subtask1-13.txt AC 109 ms 8740 KB
subtask1-14.txt AC 111 ms 8864 KB
subtask1-15.txt AC 112 ms 8864 KB
subtask2-01.txt TLE 2035 ms 12240 KB
subtask2-02.txt TLE 2035 ms 12708 KB
subtask2-03.txt TLE 2035 ms 13828 KB
subtask2-04.txt TLE 2036 ms 16892 KB
subtask2-05.txt TLE 2035 ms 16860 KB
subtask2-06.txt TLE 2036 ms 16760 KB
subtask2-07.txt TLE 2035 ms 16504 KB
subtask2-08.txt TLE 2035 ms 16760 KB
subtask2-09.txt TLE 2034 ms 16760 KB
subtask2-10.txt TLE 2036 ms 16680 KB
subtask2-11.txt TLE 2035 ms 16760 KB
subtask2-12.txt TLE 2036 ms 16756 KB
subtask2-13.txt TLE 2036 ms 16740 KB
subtask2-14.txt TLE 2036 ms 16764 KB
subtask2-15.txt TLE 2035 ms 16756 KB