#557266 (C++11) No.1209 XOR Into You

• 問題: No.1209 XOR Into You
• ユーザー: ianCK
• 提出日時: 2020-09-23 17:39:33
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 103 ms / 2,000 ms
• コード長: 1,300 bytes
• コンパイル時間: 715 ms
• コンパイル使用メモリ: 44,288 KB
• 実行使用メモリ: 9,856 KB
• 最終ジャッジ日時: 2024-06-27 22:50:40
• 合計ジャッジ時間: 4,829 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	27 ms; 5,376 KB
testcase_05	AC	28 ms; 5,376 KB
testcase_06	AC	68 ms; 9,600 KB
testcase_07	AC	83 ms; 8,704 KB
testcase_08	AC	75 ms; 8,192 KB
testcase_09	AC	77 ms; 8,192 KB
testcase_10	AC	59 ms; 7,296 KB
testcase_11	AC	72 ms; 8,064 KB
testcase_12	AC	66 ms; 7,808 KB
testcase_13	AC	76 ms; 8,448 KB
testcase_14	AC	66 ms; 7,680 KB
testcase_15	AC	68 ms; 8,064 KB
testcase_16	AC	71 ms; 7,680 KB
testcase_17	AC	65 ms; 7,680 KB
testcase_18	AC	103 ms; 9,472 KB
testcase_19	AC	69 ms; 7,808 KB
testcase_20	AC	78 ms; 8,448 KB
testcase_21	AC	55 ms; 7,168 KB
testcase_22	AC	60 ms; 9,856 KB
testcase_23	AC	59 ms; 9,728 KB
testcase_24	AC	61 ms; 9,728 KB
testcase_25	AC	94 ms; 9,728 KB
testcase_26	AC	96 ms; 9,728 KB
testcase_27	AC	95 ms; 9,728 KB
testcase_28	AC	90 ms; 9,856 KB
testcase_29	AC	91 ms; 9,728 KB
testcase_30	AC	94 ms; 9,728 KB
testcase_31	AC	97 ms; 9,728 KB
testcase_32	AC	99 ms; 9,728 KB
testcase_33	AC	97 ms; 9,728 KB
testcase_34	AC	98 ms; 9,728 KB
testcase_35	AC	98 ms; 9,728 KB
testcase_36	AC	99 ms; 9,728 KB
testcase_37	AC	60 ms; 9,728 KB
testcase_38	AC	78 ms; 8,704 KB
testcase_39	AC	67 ms; 7,936 KB
testcase_40	AC	61 ms; 9,856 KB

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:44:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   44 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
main.cpp:45:43: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   45 |         for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
      |                                      ~~~~~^~~~~~~~~~~~~
main.cpp:46:43: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   46 |         for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
      |                                      ~~~~~^~~~~~~~~~~~~

ソースコード

#include <stdio.h>
#include <utility>
#include <string.h>
#include <set>
using namespace std;

#define F first
#define S second

typedef long long int ll;
constexpr int kN = int(1E5 + 10);

int ABS(int n) {return n >= 0 ? n : -n;}

struct BIT {
	int val[kN];
	void init() {memset(val, 0, sizeof(val));}
	void add(int pos) {
		while (pos < kN) {
			val[pos]++;
			pos += pos & -pos;
		}
		return ;
	}
	int ask(int pos) {
		int ans = 0;
		while (pos) {
			ans += val[pos];
			pos ^= pos & -pos;
		}
		return ans;
	}
};


int a[kN], b[kN], difa[kN], difb[kN];
set<pair<int, int>> se;
BIT bit;

int main() {
	int n;
	ll ans = 0;
	set<pair<int, int>>::iterator u;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
	if (a[1] != b[1] || a[n] != b[n]) {
		printf("-1\n");
		return 0;
	}
	for (int i = 2; i <= n; i++) difa[i] = a[i] ^ a[i - 1];
	for (int i = 2; i <= n; i++) difb[i] = b[i] ^ b[i - 1];
	for (int i = 2; i <= n; i++) se.insert({difa[i], i});
	bit.init();
	for (int i = 2; i <= n; i++) {
		u = se.lower_bound({difb[i], 0});
		if (u == se.end() || u -> F != difb[i]) {
			printf("-1\n");
			return 0;
		}
		else {
			ans += ABS(u -> S - bit.ask(u -> S) - 2);
			bit.add(u -> S);
			se.erase(u);
		}
	}
	printf("%lld\n", ans);
}