(cache)Submission #70509457 - Polaris.AI Programming Contest 2025（AtCoder Beginner Contest 429）

Contest Duration: 2025-10-25(Sat) 21:00 - 2025-10-25(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #70509457

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
#include <stdio.h>
#include <inttypes.h>
int N;
int A[212345];
int count[212345];
int main(void) {
  int i;
  int max = 0;
  uint64_t ans = 0;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 0; i < N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
    count[A[i]]++;
    if (max < A[i]) max = A[i];
  }
  for (i = 1; i <= max; i++) {
    ans += (uint64_t)count[i] * (count[i] - 1) / 2 * (N - count[i]);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

int N;
int A[212345];

int count[212345];

int main(void) {
	int i;
	int max = 0;
	uint64_t ans = 0;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		count[A[i]]++;
		if (max < A[i]) max = A[i];
	}
	for (i = 1; i <= max; i++) {
		ans += (uint64_t)count[i] * (count[i] - 1) / 2 * (N - count[i]);
	}
	printf("%" PRIu64 "\n", ans);
	return 0;
}

Submission Info

Submission Time	2025-10-28 07:18:29
Task	C - Odd One Subsequence
User	mikecat
Language	C (gcc 12.2.0)
Score	300
Code Size	466 Byte
Status	AC
Exec Time	19 ms
Memory	3288 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

300 / 300

Status

× 2

× 28

Set Name	Test Cases
Sample	example_00.txt, example_01.txt
All	example_00.txt, example_01.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt

Case Name	Status	Exec Time	Memory
example_00.txt	AC	0 ms	1564 KiB
example_01.txt	AC	0 ms	1708 KiB
hand_00.txt	AC	19 ms	3136 KiB
hand_01.txt	AC	13 ms	2380 KiB
hand_02.txt	AC	12 ms	2400 KiB
hand_03.txt	AC	0 ms	1620 KiB
hand_04.txt	AC	0 ms	1624 KiB
hand_05.txt	AC	13 ms	2512 KiB
random_00.txt	AC	18 ms	3288 KiB
random_01.txt	AC	18 ms	3180 KiB
random_02.txt	AC	18 ms	3200 KiB
random_03.txt	AC	19 ms	3192 KiB
random_04.txt	AC	18 ms	3264 KiB
random_05.txt	AC	16 ms	2496 KiB
random_06.txt	AC	15 ms	2560 KiB
random_07.txt	AC	16 ms	2432 KiB
random_08.txt	AC	16 ms	2492 KiB
random_09.txt	AC	15 ms	2436 KiB
random_10.txt	AC	12 ms	2400 KiB
random_11.txt	AC	12 ms	2408 KiB
random_12.txt	AC	13 ms	2512 KiB
random_13.txt	AC	12 ms	2408 KiB
random_14.txt	AC	12 ms	2400 KiB
random_15.txt	AC	10 ms	2408 KiB
random_16.txt	AC	10 ms	2392 KiB
random_17.txt	AC	10 ms	2404 KiB
random_18.txt	AC	11 ms	2408 KiB
random_19.txt	AC	10 ms	2404 KiB