Submission #351161


Source Code Expand

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		
		
		Scanner scan = new Scanner(System.in);
		
		int quizNum = scan.nextInt();
		List<Integer> costTime = new ArrayList<Integer>(quizNum);
		
		for(int i=0 ; i < quizNum ; i++){
			costTime.add(scan.nextInt());
		}
		
		//ソートして
		Collections.sort(costTime);		
		//総経過時間を足してく
		//おのれ暗黙的キャスト
		long allTime = 0;
		long penaltyTime = 0;
		long chainCombo = 1; //同じ数字の連続回数
		long prevTime = 0;//前の問題の経過時間
		long kumi = 1;
		for(int time : costTime){
			allTime += time;
			penaltyTime += allTime;
			if(prevTime == time){
				chainCombo += 1;
				kumi *= (long)chainCombo;
				kumi %= 1_000_000_007L;
			} else {
				chainCombo = 1;
			}
			prevTime = time;
		}
		
		System.out.println(penaltyTime);
		System.out.println(kumi);
		
	}
}

Submission Info

Submission Time
Task B - アットコーダー王国のコンテスト事情
User marshkip
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 1068 Byte
Status AC
Exec Time 881 ms
Memory 39680 KiB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 50 / 50 50 / 50
Status
AC × 3
AC × 23
AC × 42
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_sample_01.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, subtask1_21.txt, subtask1_22.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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, subtask1_21.txt, subtask1_22.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
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 537 ms 23980 KiB
subtask0_sample_02.txt AC 537 ms 24036 KiB
subtask0_sample_03.txt AC 538 ms 24076 KiB
subtask1_01.txt AC 542 ms 24024 KiB
subtask1_02.txt AC 571 ms 23980 KiB
subtask1_03.txt AC 616 ms 23840 KiB
subtask1_04.txt AC 545 ms 23968 KiB
subtask1_05.txt AC 548 ms 23964 KiB
subtask1_06.txt AC 535 ms 23964 KiB
subtask1_07.txt AC 535 ms 24016 KiB
subtask1_08.txt AC 529 ms 23984 KiB
subtask1_09.txt AC 861 ms 38056 KiB
subtask1_10.txt AC 824 ms 36688 KiB
subtask1_11.txt AC 812 ms 36368 KiB
subtask1_12.txt AC 804 ms 37784 KiB
subtask1_13.txt AC 859 ms 36480 KiB
subtask1_14.txt AC 845 ms 37088 KiB
subtask1_15.txt AC 804 ms 35892 KiB
subtask1_16.txt AC 835 ms 38740 KiB
subtask1_17.txt AC 852 ms 38884 KiB
subtask1_18.txt AC 881 ms 37792 KiB
subtask1_19.txt AC 818 ms 36912 KiB
subtask1_20.txt AC 526 ms 23984 KiB
subtask1_21.txt AC 537 ms 24056 KiB
subtask1_22.txt AC 526 ms 23972 KiB
subtask2_01.txt AC 852 ms 38836 KiB
subtask2_02.txt AC 811 ms 36008 KiB
subtask2_03.txt AC 807 ms 37152 KiB
subtask2_04.txt AC 824 ms 36672 KiB
subtask2_05.txt AC 801 ms 36100 KiB
subtask2_06.txt AC 832 ms 39064 KiB
subtask2_07.txt AC 811 ms 37940 KiB
subtask2_08.txt AC 840 ms 39680 KiB
subtask2_09.txt AC 811 ms 36924 KiB
subtask2_10.txt AC 818 ms 38588 KiB
subtask2_11.txt AC 806 ms 36980 KiB
subtask2_12.txt AC 808 ms 35172 KiB
subtask2_13.txt AC 821 ms 36568 KiB
subtask2_14.txt AC 860 ms 37884 KiB
subtask2_15.txt AC 854 ms 38036 KiB
subtask2_16.txt AC 842 ms 37988 KiB
subtask2_17.txt AC 841 ms 37308 KiB