結果

問題 No.1888 Odd Insertion
ユーザー ygussanyygussany
提出日時 2022-03-06 17:19:15
言語 C
(gcc 12.3.0)
結果
TLE  
実行時間 -
コード長 2,137 bytes
コンパイル時間 277 ms
コンパイル使用メモリ 32,764 KB
実行使用メモリ 28,416 KB
最終ジャッジ日時 2024-07-21 03:04:20
合計ジャッジ時間 11,438 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
10,624 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 27 ms
5,376 KB
testcase_07 AC 28 ms
5,376 KB
testcase_08 AC 84 ms
20,480 KB
testcase_09 AC 83 ms
23,424 KB
testcase_10 AC 83 ms
18,432 KB
testcase_11 AC 82 ms
23,552 KB
testcase_12 AC 83 ms
18,428 KB
testcase_13 AC 84 ms
20,480 KB
testcase_14 AC 84 ms
23,552 KB
testcase_15 AC 83 ms
17,792 KB
testcase_16 AC 92 ms
19,200 KB
testcase_17 AC 84 ms
18,432 KB
testcase_18 AC 91 ms
19,336 KB
testcase_19 AC 89 ms
21,504 KB
testcase_20 AC 103 ms
17,664 KB
testcase_21 AC 88 ms
22,528 KB
testcase_22 AC 98 ms
17,024 KB
testcase_23 AC 97 ms
20,224 KB
testcase_24 AC 98 ms
20,352 KB
testcase_25 AC 98 ms
20,352 KB
testcase_26 AC 75 ms
17,280 KB
testcase_27 AC 78 ms
28,416 KB
testcase_28 AC 82 ms
6,400 KB
testcase_29 AC 41 ms
12,032 KB
testcase_30 TLE -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c: In function 'recursion':
main.c:33:56: warning: passing argument 5 of 'recursion' from incompatible pointer type [-Wincompatible-pointer-types]
   33 |                 if (recursion(N, l + 1, P_inv, BIT, ans[1]) != 0) return 1;
      |                                                        ^
      |                                                        |
      |                                                        int *
main.c:23:57: note: expected 'int (*)[2]' but argument is of type 'int *'
   23 | int recursion(int N, int l, int P_inv[], int BIT[], int ans[][2])
      |                                                     ~~~~^~~~~~~~
main.c:49:72: warning: passing argument 5 of 'recursion' from incompatible pointer type [-Wincompatible-pointer-types]
   49 |                                 if (recursion(N, i + 1, P_inv, BIT, ans[i-l+1]) != 0) return 1;
      |                                                                        ^
      |                                                                        |
      |                                                                        int *
main.c:23:57: note: expected 'int (*)[2]' but argument is of type 'int *'
   23 | int recursion(int N, int l, int P_inv[], int BIT[], int ans[][2])
      |                                                     ~~~~^~~~~~~~
main.c:66:72: warning: passing argument 5 of 'recursion' from incompatible pointer type [-Wincompatible-pointer-types]
   66 |                                 if (recursion(N, i + 1, P_inv, BIT, ans[i-l+1]) != 0) return 1;
      |                                                                        ^
      |                                                                        |
      |                                                                        int *
main.c:23:57: note: expected 'int (*)[2]' but argument is of type 'int *'
   23 | int recursion(int N, int l, int P_inv[], int BIT[], int ans[][2])
      |

ソースコード

diff # 

#include <stdio.h>

void add_BIT(int N, int BIT[], int i, int k)
{
	while (i <= N) {
		BIT[i] += k;
		i += (i & -i);
	}
}

int sum_BIT(int BIT[], int r)
{
	int sum = 0;
	while (r > 0) {
		sum += BIT[r];
		r -= (r & -r);
	}
	return sum;
}

int memo[200001], r;

int recursion(int N, int l, int P_inv[], int BIT[], int ans[][2])
{
	if (l > N) return 1;
	else if (memo[l] != 0) return 0;
	
	int i, k = sum_BIT(BIT, P_inv[l] - 1);
	if (k % 2 == 0) {
		add_BIT(N, BIT, P_inv[l], 1);
		ans[0][0] = l;
		ans[0][1] = k + 1;
		if (recursion(N, l + 1, P_inv, BIT, ans[1]) != 0) return 1;
		add_BIT(N, BIT, P_inv[l], -1);
	}
	if (P_inv[l] % 2 == 0) {
		for (i = l + 1; i < r; i++) {
			k = sum_BIT(BIT, P_inv[i] - 1);
			if (k % 2 != 0) break;
			add_BIT(N, BIT, P_inv[i], 1);
			ans[i-l-1][0] = i;
			ans[i-l-1][1] = k + 1;
		
			k = sum_BIT(BIT, P_inv[l] - 1);
			if (k % 2 == 0) {
				add_BIT(N, BIT, P_inv[l], 1);
				ans[i-l][0] = l;
				ans[i-l][1] = k + 1;
				if (recursion(N, i + 1, P_inv, BIT, ans[i-l+1]) != 0) return 1;
				add_BIT(N, BIT, P_inv[l], -1);
			}
		}
	} else {
		for (i = l + 1; i <= N; i++) {
			k = sum_BIT(BIT, P_inv[i] - 1);
			if (k % 2 != 0) break;
			add_BIT(N, BIT, P_inv[i], 1);
			ans[i-l-1][0] = i;
			ans[i-l-1][1] = k + 1;
		
			k = sum_BIT(BIT, P_inv[l] - 1);
			if (k % 2 == 0) {
				add_BIT(N, BIT, P_inv[l], 1);
				ans[i-l][0] = l;
				ans[i-l][1] = k + 1;
				if (recursion(N, i + 1, P_inv, BIT, ans[i-l+1]) != 0) return 1;
				add_BIT(N, BIT, P_inv[l], -1);
			}
		}
	}
	for (i--; i > l; i--) add_BIT(N, BIT, P_inv[i], -1);
	
	memo[l] = -1;
	while (memo[r] != 0) r--;
	return 0;
}

int solve(int N, int P[], int ans[][2])
{
	static int i, P_inv[200001], BIT[200001];
	for (i = 1, memo[0] = 0; i <= N; i++) {
		P_inv[P[i]] = i;
		BIT[i] = 0;
		memo[i] = 0;
	}
	r = N;
	return recursion(N, 1, P_inv, BIT, ans[1]);
}

int main()
{
	int i, N, P[200001], ans[200001][2];
	scanf("%d", &N);
	for (i = 1; i <= N; i++) scanf("%d", &(P[i]));
	if (solve(N, P, ans) == 0) printf("No\n");
	else {
		printf("Yes\n");
		for (i = 1; i <= N; i++) printf("%d %d\n", ans[i][0], ans[i][1]);
	}
	fflush(stdout);
	return 0;
}
0