제출 #1188753

#제출 시각아이디문제언어결과실행 시간메모리
1188753rhm_ganArranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif

long long count_swaps(vector<int> a) {
	int n = a.size();
	long long res = 0;
	vector<int> c(n + 1);
	for (int i = 0; i < n; i++) {
		if (a[i] < 0) {
			c[-a[i]]++;
			continue;
		}
		c[a[i]]--;
		if (c[a[i]] < 0) {
			int id = -1;
			for (int j = i + 1; j < n; j++) {
				if (a[j] == -a[i]) {
					id = j;
					break;
				}	
			}
			if (id != -1) {
				res += id - i;
			}
			for (int j = id; j >= i; j--) {
				swap(a[j], a[j - 1]);
			}
			c[a[i]] = 0;
			i++;
		}
	}
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...