제출 #1321322

#제출 시각아이디문제언어결과실행 시간메모리
1321322jahinahnafArranging Shoes (IOI19_shoes)C++20
10 / 100
12 ms1936 KiB
#include "shoes.h"

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