Submission #4061757


Source Code Expand

import java.util.*;
public class Main {
	
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int C = sc.nextInt();
        int K = sc.nextInt();
        
        int[] map = new int[N];
        for (int i = 0; i < N; i++) {
        	map[i] = sc.nextInt();
        }
        
        Arrays.sort(map);
        
        int ans = 0;
        int first = map[0];
        int count = 1;
        for (int i = 1; i < N; i++) {
        	
        	if (first + K < map[i]) {
        		ans++;
        		count = 1;
        		first = map[i];
        	} else {
        		if (count == C) {
            		ans++;
            		count = 1;
            		first = map[i];
            	} else {
            		count++;
            	}
        	}
        }
        
        System.out.println(ans+1);
    }
}

Submission Info

Submission Time
Task A - Airport Bus
User kanekoshinn
Language Java8 (OpenJDK 1.8.0)
Score 300
Code Size 910 Byte
Status AC
Exec Time 512 ms
Memory 50552 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 12
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 120 ms 20436 KB
in2.txt AC 480 ms 48092 KB
in3.txt AC 501 ms 49064 KB
in4.txt AC 481 ms 46884 KB
in5.txt AC 147 ms 22736 KB
in6.txt AC 512 ms 50552 KB
in7.txt AC 448 ms 48012 KB
in8.txt AC 487 ms 48588 KB
sample1.txt AC 101 ms 20052 KB
sample2.txt AC 98 ms 21716 KB