Submission #1242568

#TimeUsernameProblemLanguageResultExecution timeMemory
1242568iyedooArranging Shoes (IOI19_shoes)C++20
10 / 100
12 ms1860 KiB
#include "shoes.h"

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll mn = LLONG_MAX;

ll count_swaps(vector<int> s) {
	int n = s.size();

	int spot = 0;

	int ans = 0;

	for (int i = 0; i < n; ++i) {
		if (s[i] < 0) {
			if (i == spot) continue;
			ans += i - spot;
			spot += 2;
		}
	}

	return ans;
}
#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...