提出 #77901016

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N;
char S[512345];
int nodes[512345];
int main(void) {
  int head = 1;
  int i;
  int prev;
  if (scanf("%d", &N) != 1) return 1;
  if (scanf("%512343s", S + 1) != 1) return 1;
  nodes[1] = 2;
  for (i = 2; i < N; i++) {
    nodes[i] = (i - 1) ^ (i + 1);
  }
  nodes[N] = N - 1;
  /* i=1 は、1項だけ反転してもどうせ変わらないので飛ばす */
  for (i = 2; i <= N; i++) {
    if (S[i] == 'o') {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
char S[512345];

int nodes[512345];

int main(void) {
	int head = 1;
	int i;
	int prev;
	if (scanf("%d", &N) != 1) return 1;
	if (scanf("%512343s", S + 1) != 1) return 1;
	nodes[1] = 2;
	for (i = 2; i < N; i++) {
		nodes[i] = (i - 1) ^ (i + 1);
	}
	nodes[N] = N - 1;
	/* i=1 は、1項だけ反転してもどうせ変わらないので飛ばす */
	for (i = 2; i <= N; i++) {
		if (S[i] == 'o') {
			if (i < N) {
				nodes[i + 1] ^= i ^ head;
				nodes[i] ^= i + 1;
				nodes[head] ^= i + 1;
			}
			head = i;
		}
	}
	for (prev = 0, i = head; i > 0; ) {
		int next;
		printf(" %d" + (i == head), i);
		next = nodes[i] ^ prev;
		prev = i;
		i = next;
	}
	putchar('\n');
	return 0;
}

/*

こういう時は……Rotateでおなじみ？xor線形リストや！

*/

提出情報

ジャッジ結果