Submission #64338557

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#define int long long
//#define USE_FREOPEN
#define MUL_TEST
#define FILENAME ""
using namespace std;
bool nok[400005];
int a[400005];
void solve() {
  map<pair<int,int>,int> mp;
  int n;
  cin >> n;
  for (int i = 0; i <= 2 * n; i++) {
    nok[i] = 0;
    a[i] = 0;
  }
  for (int i = 1; i <= 2 * n; i++) {
    cin >> a[i];
    if (a[i] == a[i - 1]) nok[a[i]] = 1;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#define int long long
//#define USE_FREOPEN
#define MUL_TEST
#define FILENAME ""
using namespace std;
bool nok[400005];
int a[400005];

void solve() {
	map<pair<int,int>,int> mp;
	int n;
	cin >> n;
	for (int i = 0; i <= 2 * n; i++) {
		nok[i] = 0;
		a[i] = 0;
	}
	for (int i = 1; i <= 2 * n; i++) {
		cin >> a[i];
		if (a[i] == a[i - 1]) nok[a[i]] = 1;
	}
	
	for (int i = 2; i <= 2 * n; i++) {
		int mx = max(a[i],a[i - 1]),mi = min(a[i],a[i - 1]);
		if (nok[mx] || nok[mi]) continue;
		mp[make_pair(mi,mx)]++;
	}
	int ans = 0;
	for (auto it : mp) {
		if (it.second >= 2) ans++;
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);

	#ifdef USE_FREOPEN
		freopen(FILENAME ".in","r",stdin);
		freopen(FILENAME ".out","w",stdout);
	#endif
	int _ = 1;
	#ifdef MUL_TEST
		cin >> _;
	#endif
	while (_--)
		solve();
	_^=_;
	return 0^_^0;
}

Submission Info

Judge Result