Submission #64914


Source Code Expand

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		doIt();
	}

	static void doIt(){
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.nextLine());
		boolean[] days = new boolean[366];
		int[] month = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
		int[] months = new int[12];
		int sum = 0;
		for(int i = 0; i < 366; i+=7) days[i] = true;
		for(int i = 6; i < 366; i+=7) days[i] = true;
		for(int i = 0; i < 12; i++){
			months[i] = sum;
			sum += month[i];
		}
		CC[] ary = new CC[n];
		for(int i = 0; i < n; i++){
			String s = sc.nextLine();
			String[] ss = s.split("/");
			int m = Integer.parseInt(ss[0]);
			int d = Integer.parseInt(ss[1]);
			ary[i] = new CC(m, d);
		}
		Arrays.sort(ary);
		for(int i =0; i < n; i++){
			CC cc = ary[i];
			int m = cc.m;
			int d = cc.d;
			int p = months[m - 1] + d - 1;
			while(p < 366){
				if(days[p] == false){days[p] = true;break;}
				p++;
			}
		}
		int max = 0;
		int ii = 0;
		while(ii < 366){
			if(days[ii]){
				int count = 0;
				while(ii < 366 && days[ii]){
					count++;
					ii++;
				}
				max = max < count? count : max;
			}
			else ii++;
		}
		System.out.println(max);
	}
}

class CC implements Comparable {
	int m;
	int d;
	CC(int mm, int dd){
		m = mm;
		d = dd;
	}
	public int compareTo(Object other) {

		CC o = (CC) other;
		if(m == o.m) return d - o.d;
		else return m - o.m;
	}
}

Submission Info

Submission Time
Task B - 超大型連休
User mkiken
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 1512 Byte
Status AC
Exec Time 446 ms
Memory 18884 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 44
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_rand_00.txt, 01_rand_01.txt, 01_rand_02.txt, 01_rand_03.txt, 01_rand_04.txt, 01_rand_05.txt, 01_rand_06.txt, 01_rand_07.txt, 01_rand_08.txt, 01_rand_09.txt, 01_rand_10.txt, 01_rand_11.txt, 01_rand_12.txt, 01_rand_13.txt, 01_rand_14.txt, 01_rand_15.txt, 01_rand_16.txt, 01_rand_17.txt, 01_rand_18.txt, 01_rand_19.txt, 01_rand_20.txt, 01_rand_21.txt, 01_rand_22.txt, 01_rand_23.txt, 01_rand_24.txt, 01_rand_25.txt, 01_rand_26.txt, 01_rand_27.txt, 01_rand_28.txt, 01_rand_29.txt, 01_rand_30.txt, 01_rand_31.txt, 01_rand_32.txt, 01_rand_33.txt, 01_rand_34.txt, 01_rand_35.txt, 01_rand_36.txt, 01_rand_37.txt, 01_rand_38.txt, 01_rand_39.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 443 ms 17224 KB
00_sample_02.txt AC 413 ms 17192 KB
00_sample_03.txt AC 423 ms 17220 KB
00_sample_04.txt AC 398 ms 17232 KB
01_rand_00.txt AC 408 ms 17132 KB
01_rand_01.txt AC 397 ms 17144 KB
01_rand_02.txt AC 399 ms 17260 KB
01_rand_03.txt AC 401 ms 17272 KB
01_rand_04.txt AC 407 ms 17200 KB
01_rand_05.txt AC 398 ms 17240 KB
01_rand_06.txt AC 403 ms 17388 KB
01_rand_07.txt AC 408 ms 17376 KB
01_rand_08.txt AC 404 ms 17280 KB
01_rand_09.txt AC 402 ms 17380 KB
01_rand_10.txt AC 427 ms 17360 KB
01_rand_11.txt AC 410 ms 17484 KB
01_rand_12.txt AC 416 ms 17524 KB
01_rand_13.txt AC 402 ms 17496 KB
01_rand_14.txt AC 415 ms 17628 KB
01_rand_15.txt AC 413 ms 17492 KB
01_rand_16.txt AC 409 ms 17712 KB
01_rand_17.txt AC 420 ms 18120 KB
01_rand_18.txt AC 422 ms 18036 KB
01_rand_19.txt AC 415 ms 18140 KB
01_rand_20.txt AC 420 ms 18212 KB
01_rand_21.txt AC 434 ms 18292 KB
01_rand_22.txt AC 446 ms 18884 KB
01_rand_23.txt AC 446 ms 15452 KB
01_rand_24.txt AC 398 ms 16864 KB
01_rand_25.txt AC 403 ms 16864 KB
01_rand_26.txt AC 403 ms 17492 KB
01_rand_27.txt AC 399 ms 16896 KB
01_rand_28.txt AC 420 ms 17504 KB
01_rand_29.txt AC 415 ms 18192 KB
01_rand_30.txt AC 420 ms 17816 KB
01_rand_31.txt AC 415 ms 18184 KB
01_rand_32.txt AC 424 ms 18008 KB
01_rand_33.txt AC 414 ms 18144 KB
01_rand_34.txt AC 407 ms 18264 KB
01_rand_35.txt AC 433 ms 18140 KB
01_rand_36.txt AC 410 ms 18176 KB
01_rand_37.txt AC 420 ms 18648 KB
01_rand_38.txt AC 426 ms 18708 KB
01_rand_39.txt AC 415 ms 18272 KB