Submission #991209

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
991209	2024-06-01T15:09:12 Z	model_code	Room Temperature (JOI24_ho_t1)	C++17	100 / 100	158 ms	2408 KB

Main

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	//入力
	int N, T;
	cin >> N >> T;
	vector<int> A(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}

    // A[i] mod T にしてソート
	for (int i = 0; i < N; i++) {
		A[i] %= T;
	}
	sort (A.begin(), A.end());

    //「カバーされない円環上の部分」を全探索
	int len_min = A[N-1] - A[0];
	for (int i = 0; i < N-1; i++) {
		len_min = min(len_min, T - (A[i+1] - A[i]));
	}

    // 2 で割って切り上げた値を出力
	cout << (len_min + 1) / 2 << endl;

	return 0;
}

Subtask #1

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct

Subtask #3

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	444 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #4

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	444 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	352 KB	Output is correct
33	Correct	1 ms	360 KB	Output is correct

Subtask #5

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	444 KB	Output is correct
27	Correct	1 ms	344 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	352 KB	Output is correct
44	Correct	1 ms	360 KB	Output is correct
45	Correct	148 ms	2404 KB	Output is correct
46	Correct	154 ms	2404 KB	Output is correct
47	Correct	156 ms	2408 KB	Output is correct
48	Correct	156 ms	2404 KB	Output is correct
49	Correct	158 ms	2404 KB	Output is correct
50	Correct	154 ms	2396 KB	Output is correct
51	Correct	157 ms	2396 KB	Output is correct
52	Correct	154 ms	2396 KB	Output is correct
53	Correct	154 ms	2396 KB	Output is correct