Submission #72782349


Source Code Expand

Copy
#include <stdio.h>
struct meow {
int color;
int num;
} gorogoro[114514];
int main(void) {
int n;
int i;
int goronyan = 1;
int ans = 0;
gorogoro[0].color = -1;
gorogoro[0].num = 0;
if (scanf("%d", &n) != 1) return 1;
for (i = 1; i <= n; i++) {
int c;
if (scanf("%d", &c) != 1) return 1;
if (i % 2 == 0) {
if (gorogoro[goronyan - 1].color == c) {
gorogoro[goronyan - 1].num++;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <stdio.h>

struct meow {
	int color;
	int num;
} gorogoro[114514];

int main(void) {
	int n;
	int i;
	int goronyan = 1;
	int ans = 0;
	gorogoro[0].color = -1;
	gorogoro[0].num = 0;
	if (scanf("%d", &n) != 1) return 1;
	for (i = 1; i <= n; i++) {
		int c;
		if (scanf("%d", &c) != 1) return 1;
		if (i % 2 == 0) {
			if (gorogoro[goronyan - 1].color == c) {
				gorogoro[goronyan - 1].num++;
			} else {
				int num = gorogoro[goronyan - 1].num + 1;
				goronyan--;
				if (gorogoro[goronyan - 1].color == c) {
					gorogoro[goronyan - 1].num += num;
				} else {
					gorogoro[goronyan].color = c;
					gorogoro[goronyan].num = num;
					goronyan++;
				}
			}
		} else {
			if (gorogoro[goronyan - 1].color == c) {
				gorogoro[goronyan - 1].num++;
			} else {
				gorogoro[goronyan].color = c;
				gorogoro[goronyan].num = 1;
				goronyan++;
			}
		}
	}
	for (i = 1; i < goronyan; i++) {
		if (gorogoro[i].color == 0) ans += gorogoro[i].num;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task A - 碁石ならべ
User mikecat
Language C23 (GCC 14.2.0)
Score 20
Code Size 1039 Byte
Status AC
Exec Time 5 ms
Memory 1724 KiB

Judge Result

Set Name set01 set02 set03 set04 set05 set06 set07 set08 set09 set10
Score / Max Score 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2 2 / 2
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
set06 data6
set07 data7
set08 data8
set09 data9
set10 data10
Case Name Status Exec Time Memory
data1 AC 1 ms 1652 KiB
data10 AC 5 ms 1620 KiB
data2 AC 1 ms 1724 KiB
data3 AC 0 ms 1668 KiB
data4 AC 1 ms 1580 KiB
data5 AC 1 ms 1648 KiB
data6 AC 3 ms 1620 KiB
data7 AC 5 ms 1648 KiB
data8 AC 4 ms 1644 KiB
data9 AC 4 ms 1644 KiB


2026-01-27 (Tue)
07:54:44 +09:00