CSES - Datatähti 2021 alku - Results
Submission details
Task:Alitaulukot
Sender:T
Submission time:2020-09-28 15:56:15 +0300
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.10 s1, 2, 3details
#20.09 s1, 2, 3details
#30.08 s1, 2, 3details
#4ACCEPTED0.14 s1, 2, 3details
#5ACCEPTED0.17 s1, 2, 3details
#6--2, 3details
#70.15 s2, 3details
#80.13 s2, 3details
#9--2, 3details
#10--2, 3details
#11--3details
#12--3details
#130.86 s3details
#14--3details
#15--3details
#16--3details
#17--3details

Code

import java.util.*;
import java.io.*;
/**
 * Datatahti 2021 alku
 * Alitaulukot/Subtables
 * @author TRS
 */
public class Alitaulukot {
	//Constants
	static final int infinity = 0x3f3f3f3f;
	static final long linfinity = 0x3f3f3f3f3f3f3f3fL;
	static final int MOD = 1000000007;
	//Input
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st;
	public static void main(String[] args) throws IOException {
		int n = readInt();
		int k = readInt();
		int[] array = new int[n];
		for (int i = 0; i < n; i++) {
			array[i] = readInt();
		}
		System.out.println(solve(array, k));
	}
	static boolean containsArray(ArrayList<int[]> arrays, int[] array) {
		for (int[] a : arrays) {
			if (Arrays.equals(a, array)) {
				return true;
			}
		}
		return false;
	}
	static int solve(int[] array, int k) {
		ArrayList<int[]> counted = new ArrayList<int[]>();
		for (int i = 0; i < array.length; i++) {
			for (int j = i; j < array.length; j++) {
				int[] temporaryArray = Arrays.copyOfRange(array, i, j + 1);
				if (maximumElement(temporaryArray) - minimumElement(temporaryArray) <= k) {
					if (!containsArray(counted, temporaryArray)) {
						counted.add(temporaryArray);
					}
				}
				else {
					break;
				}
			}
		}
		return counted.size();
	}
	static int maximumElement(int[] array) {
		int maximum = array[0];
		for (int i = 1; i < array.length; i++) {
			if (array[i] > maximum) {
				maximum = array[i];
			}
		}
		return maximum;
	}
	static int minimumElement(int[] array) {
		int minimum = array[0];
		for (int i = 1; i < array.length; i++) {
			if (array[i] < minimum) {
				minimum = array[i];
			}
		}
		return minimum;
	}
	static String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine().trim());
		}
		return st.nextToken();
	}
	static long readLong() throws IOException {
		return Long.parseLong(next());
	}
	static int readInt() throws IOException {
		return Integer.parseInt(next());
	}
	static double readDouble() throws IOException {
		return Double.parseDouble(next());
	}
	static char readCharacter() throws IOException {
		return next().charAt(0);
	}
	static String readLine() throws IOException {
		return br.readLine().trim();
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
100 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5050

user output
100

Test 2

Group: 1, 2, 3

Verdict:

input
100 2
5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ...

correct output
317

user output
146

Test 3

Group: 1, 2, 3

Verdict:

input
100 10
71 60 61 96 25 10 10 9 84 85 1...

correct output
119

user output
82

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 990000000
111122929 961821360 578238211 ...

correct output
4006

user output
4006

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
100 1000000000
553190572 453407680 667300705 ...

correct output
5050

user output
5050

Test 6

Group: 2, 3

Verdict:

input
2000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
2001000

user output
(empty)

Test 7

Group: 2, 3

Verdict:

input
2000 2
4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ...

correct output
6340

user output
1197

Test 8

Group: 2, 3

Verdict:

input
2000 10
65 88 33 88 41 10 17 38 22 3 8...

correct output
2413

user output
484

Test 9

Group: 2, 3

Verdict:

input
2000 999000000
746120950 772769620 721488968 ...

correct output
1287776

user output
(empty)

Test 10

Group: 2, 3

Verdict:

input
2000 1000000000
621947980 510355354 756705418 ...

correct output
2001000

user output
(empty)

Test 11

Group: 3

Verdict:

input
100000 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
5000050000

user output
(empty)

Test 12

Group: 3

Verdict:

input
100000 2
3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ...

correct output
317066

user output
(empty)

Test 13

Group: 3

Verdict:

input
100000 10
10 3 6 3 43 60 5 48 15 27 86 4...

correct output
123292

user output
5474

Test 14

Group: 3

Verdict:

input
100000 999990000
460235639 963048588 47270983 3...

correct output
4946886742

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000 1000000000
885457070 18257718 927615960 3...

correct output
5000050000

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000 50000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
3750075000

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000 50000
100000 99999 99998 99997 99996...

correct output
3750075000

user output
(empty)