Submission #1338347

#TimeUsernameProblemLanguageResultExecution timeMemory
1338347uranhishigArranging Shoes (IOI19_shoes)C++20
10 / 100
12 ms1960 KiB
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;
// #define int long long


long long count_swaps(std::vector<int> s) {
	int n = s.size() / 2;
	if(n == 1){
		if(s[0] < 0){
			return 0;
		}
		else{
			return 1;
		}
	}
	int ans = 0;
	for (int i = 1; i < 2*n; i++) {
		if(i %2 == 1){
			if(s[i - 1] > 0) {
				swap(s[i], s[i - 1]);
				ans++;
			}
		}
		else{
			if(s[i - 1] < 0) {
				swap(s[i], s[i - 1]);
				ans++;
			}
		}
	}
	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...