제출 #297314

#제출 시각아이디문제언어결과실행 시간메모리
297314amoo_safarArranging Shoes (IOI19_shoes)C++17
0 / 100
10 ms9984 KiB
#include "shoes.h"

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end();

using namespace std;

typedef long long ll;

const int N = 2e5 + 10;
vector<int> V[N];

ll count_swaps(vector<int> s) {
	int n = s.size() >> 1;
	for(int i = 0; i < n + n; i++){
		V[abs(i)].pb(i < 0 ? -1 : +1);
	}
	int sm = 0;
	ll res = 0;
	for(int i = 1; i <= n; i++){
		for(auto x : V[i]){
			sm += x;
			res += abs(sm);
		}
		assert(sm == 0);
	}
	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...