제출 #200381

#제출 시각아이디문제언어결과실행 시간메모리
200381thiago4532Arranging Shoes (IOI19_shoes)C++17
10 / 100
5 ms376 KiB
#include "shoes.h"
#include <iostream>

using namespace std;

long long count_swaps(std::vector<int> s) {
	std::vector<int> mark(s.size());
	long long sum = 0;

	for (int i = 0; i < (int)s.size(); i++) {
		if (mark[i])
			continue;

		int j;
		for (j = i + 1; j < (int)s.size(); j++) {
			if(s[j] + s[i] == 0) break;
		}

		mark[j] = true;
		sum += (j - i);
		if (s[i] < 0) sum--;
	}
	return sum;
}
#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...