Submission #1570990


Source Code Expand

#include <functional>
#include <algorithm>
#include <iostream>
#include <memory.h>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <assert.h>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
#include <complex>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
using namespace std;

#define int64 long long
#define mp make_pair
#define ull unsigned long long

const int N = 510;
const int M = 100000;
const int64 INF = 1e18;

int n, cntIn, cntOut;
int a[N], b[N], degIn[N], degOut[N];
pair <int, int> p[N];
vector <int> g[N];
bool used[N];

void compress()
{
	for (int i = 0; i <= n; i++) p[i] = mp(a[i], i);
	for (int i = n + 1; i <= 2 * n; i++) p[i] = mp(b[i - n], i);
	sort(p, p + 2 * n + 1);
	int val = 1;
	for (int i = 0; i <= 2 * n; i++)
	{
		if (i > 1 && p[i].first != p[i - 1].first) val++;
		if (p[i].second <= n) a[p[i].second] = val;
		else b[p[i].second - n] = val;
	}
}

void dfs(int v)
{
	used[v] = true;
	if (degIn[v] > degOut[v]) cntIn++;
	else if (degIn[v] < degOut[v]) cntOut++;
	for (int i = 0; i < g[v].size(); i++)
		if (!used[g[v][i]])
		{
			dfs(g[v][i]);
		}
}

int main()
{
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	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]);
	int x = 0;
	for (int i = 1; i <= n; i++) x ^= a[i];
	a[0] = x;
	compress();
	int ans = 0;
	for (int i = 1; i <= n; i++) 
	{
		if (a[i] != b[i]) 
		{
			ans++;
			degOut[b[i]]++;
			degIn[a[i]]++;
			g[b[i]].push_back(a[i]);
			g[a[i]].push_back(b[i]);
		}
	}
	memset(used, false, sizeof(used));
	bool flag = false;
	for (int i = 0; i <= 2 * n; i++)
	{
		if (!used[i])
		{
			if (g[i].size() == 0) continue;
			cntIn = 0;
			cntOut = 0;
			dfs(i);
			if (!flag && used[i])
			{
				flag = true;
				bool correct = (cntIn == cntOut || (cntIn == 1 && cntOut == 1 && degOut[x] > degIn[x]));
				if (!correct) 
				{
					ans = -1;
					break;
				}
			}
			else
			{
				if (cntIn != 0 || cntOut != 0) 
				{
					ans = -1;
					break;
				}
				else 
				{
					ans++;
				}
			}
		}
	}
	for (int i = 0; i <= 2 * n; i++)
	{
		if (abs(degIn[i] - degOut[i]) > 1) 
		{
			ans = -1;
			break;
		}
	}
	cout << ans;
	return 0;
}

Submission Info

Submission Time
Task D - XOR Replace
User AleksBalobanov
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2488 Byte
Status RE
Exec Time 97 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:70:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:71:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
                                                 ^
./Main.cpp:72:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
                                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 4
AC × 9
WA × 7
RE × 58
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt WA 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt WA 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt RE 95 ms 256 KB
1_08.txt RE 95 ms 256 KB
1_09.txt RE 94 ms 256 KB
1_10.txt WA 1 ms 256 KB
1_11.txt WA 1 ms 256 KB
1_12.txt WA 1 ms 256 KB
1_13.txt WA 1 ms 256 KB
1_14.txt RE 94 ms 256 KB
1_15.txt WA 1 ms 256 KB
1_16.txt RE 94 ms 256 KB
1_17.txt RE 95 ms 256 KB
1_18.txt RE 95 ms 256 KB
1_19.txt RE 95 ms 256 KB
1_20.txt RE 94 ms 256 KB
1_21.txt RE 95 ms 256 KB
1_22.txt RE 94 ms 256 KB
1_23.txt RE 95 ms 256 KB
1_24.txt RE 95 ms 256 KB
1_25.txt RE 95 ms 256 KB
1_26.txt RE 95 ms 256 KB
1_27.txt RE 95 ms 256 KB
1_28.txt RE 94 ms 256 KB
1_29.txt RE 95 ms 256 KB
1_30.txt RE 95 ms 256 KB
1_31.txt RE 95 ms 256 KB
1_32.txt RE 94 ms 256 KB
1_33.txt RE 95 ms 256 KB
1_34.txt RE 95 ms 256 KB
1_35.txt RE 95 ms 256 KB
1_36.txt RE 95 ms 256 KB
1_37.txt RE 94 ms 256 KB
1_38.txt RE 94 ms 256 KB
1_39.txt RE 95 ms 256 KB
1_40.txt RE 95 ms 256 KB
1_41.txt RE 94 ms 256 KB
1_42.txt RE 94 ms 256 KB
1_43.txt RE 94 ms 256 KB
1_44.txt RE 95 ms 256 KB
1_45.txt RE 95 ms 256 KB
1_46.txt RE 94 ms 256 KB
1_47.txt RE 97 ms 256 KB
1_48.txt RE 95 ms 256 KB
1_49.txt RE 94 ms 256 KB
1_50.txt RE 94 ms 256 KB
1_51.txt RE 95 ms 256 KB
1_52.txt RE 94 ms 256 KB
1_53.txt RE 94 ms 256 KB
1_54.txt RE 95 ms 256 KB
1_55.txt RE 95 ms 256 KB
1_56.txt RE 95 ms 256 KB
1_57.txt RE 94 ms 256 KB
1_58.txt RE 95 ms 256 KB
1_59.txt RE 94 ms 256 KB
1_60.txt RE 96 ms 256 KB
1_61.txt RE 95 ms 256 KB
1_62.txt RE 96 ms 256 KB
1_63.txt RE 94 ms 256 KB
1_64.txt RE 95 ms 256 KB
1_65.txt RE 95 ms 256 KB
1_66.txt RE 95 ms 256 KB
1_67.txt RE 95 ms 256 KB
1_68.txt RE 95 ms 256 KB
1_69.txt RE 95 ms 256 KB