(cache)Submission #76921808 - Polaris.AI Programming Contest 2026（AtCoder Beginner Contest 457）

Contest Duration: 2026-05-09(Sat) 21:00 - 2026-05-09(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #76921808

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include <stdio.h>
#include <inttypes.h>
int N;
uint64_t K;
uint64_t A[212345];
int main(void) {
  int i;
  /* i = 1 で、高々 2 * 10**18 にしかならない */
  uint64_t yes = 0, no = UINT64_C(2020202020202020202);
  if (scanf("%d%" SCNu64, &N, &K) != 2) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%" SCNu64, &A[i]) != 1) return 1;
  }
  while (yes + 1 < no) {
    uint64_t m = yes + (no - yes) / 2;
    uint64_t cnt = 0;
    for (i = 1; i <= N && cnt <= K; i++) {
      if (A[i] < m) cnt += (m - A[i] + i - 1) / i;
    }
    if (cnt <= K) yes = m; else no = m;
  }
  printf("%" PRIu64 "\n", yes);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <inttypes.h>

int N;
uint64_t K;
uint64_t A[212345];

int main(void) {
	int i;
	/* i = 1 で、高々 2 * 10**18 にしかならない */
	uint64_t yes = 0, no = UINT64_C(2020202020202020202);
	if (scanf("%d%" SCNu64, &N, &K) != 2) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%" SCNu64, &A[i]) != 1) return 1;
	}
	while (yes + 1 < no) {
		uint64_t m = yes + (no - yes) / 2;
		uint64_t cnt = 0;
		for (i = 1; i <= N && cnt <= K; i++) {
			if (A[i] < m) cnt += (m - A[i] + i - 1) / i;
		}
		if (cnt <= K) yes = m; else no = m;
	}
	printf("%" PRIu64 "\n", yes);
	return 0;
}

Submission Info

Submission Time	2026-06-24 09:15:43
Task	D - Raise Minimum
User	mikecat
Language	C23 (GCC 14.2.0)
Score	400
Code Size	633 Byte
Status	AC
Exec Time	59 ms
Memory	3336 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

400 / 400

Status

× 3

× 47

Set Name	Test Cases
Sample	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_corner_00.txt, 01_corner_01.txt, 01_corner_02.txt, 01_corner_03.txt, 01_corner_04.txt, 01_corner_05.txt, 01_corner_06.txt, 01_corner_07.txt, 01_corner_08.txt, 01_corner_09.txt, 01_corner_10.txt, 02_hack_00.txt, 02_hack_01.txt, 02_hack_02.txt, 02_hack_03.txt, 02_hack_04.txt, 02_hack_05.txt, 02_hack_06.txt, 02_hack_07.txt, 02_hack_08.txt, 02_hack_09.txt, 02_hack_10.txt, 02_hack_11.txt, 02_hack_12.txt, 03_random_00.txt, 03_random_01.txt, 03_random_02.txt, 03_random_03.txt, 03_random_04.txt, 03_random_05.txt, 03_random_06.txt, 03_random_07.txt, 03_random_08.txt, 03_random_09.txt, 03_random_10.txt, 03_random_11.txt, 03_random_12.txt, 03_random_13.txt, 03_random_14.txt, 03_random_15.txt, 03_random_16.txt, 03_random_17.txt, 03_random_18.txt, 03_random_19.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	0 ms	1672 KiB
00_sample_01.txt	AC	0 ms	1560 KiB
00_sample_02.txt	AC	0 ms	1668 KiB
01_corner_00.txt	AC	1 ms	1560 KiB
01_corner_01.txt	AC	8 ms	3240 KiB
01_corner_02.txt	AC	0 ms	1540 KiB
01_corner_03.txt	AC	47 ms	3332 KiB
01_corner_04.txt	AC	38 ms	3156 KiB
01_corner_05.txt	AC	38 ms	3156 KiB
01_corner_06.txt	AC	36 ms	3244 KiB
01_corner_07.txt	AC	36 ms	3332 KiB
01_corner_08.txt	AC	36 ms	3156 KiB
01_corner_09.txt	AC	36 ms	3200 KiB
01_corner_10.txt	AC	37 ms	3316 KiB
02_hack_00.txt	AC	0 ms	1584 KiB
02_hack_01.txt	AC	0 ms	1660 KiB
02_hack_02.txt	AC	0 ms	1660 KiB
02_hack_03.txt	AC	0 ms	1664 KiB
02_hack_04.txt	AC	7 ms	2940 KiB
02_hack_05.txt	AC	7 ms	2804 KiB
02_hack_06.txt	AC	3 ms	1788 KiB
02_hack_07.txt	AC	21 ms	2776 KiB
02_hack_08.txt	AC	27 ms	3060 KiB
02_hack_09.txt	AC	12 ms	2164 KiB
02_hack_10.txt	AC	38 ms	3072 KiB
02_hack_11.txt	AC	14 ms	2008 KiB
02_hack_12.txt	AC	16 ms	2164 KiB
03_random_00.txt	AC	54 ms	3328 KiB
03_random_01.txt	AC	52 ms	2900 KiB
03_random_02.txt	AC	40 ms	3188 KiB
03_random_03.txt	AC	9 ms	1832 KiB
03_random_04.txt	AC	53 ms	3248 KiB
03_random_05.txt	AC	29 ms	2352 KiB
03_random_06.txt	AC	41 ms	3336 KiB
03_random_07.txt	AC	2 ms	1780 KiB
03_random_08.txt	AC	59 ms	3156 KiB
03_random_09.txt	AC	14 ms	1864 KiB
03_random_10.txt	AC	25 ms	3188 KiB
03_random_11.txt	AC	14 ms	2180 KiB
03_random_12.txt	AC	58 ms	3328 KiB
03_random_13.txt	AC	32 ms	2456 KiB
03_random_14.txt	AC	49 ms	3204 KiB
03_random_15.txt	AC	18 ms	2568 KiB
03_random_16.txt	AC	47 ms	3332 KiB
03_random_17.txt	AC	46 ms	3316 KiB
03_random_18.txt	AC	46 ms	3316 KiB
03_random_19.txt	AC	46 ms	3204 KiB