Submission #1274975

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

long long count_swaps(std::vector<int> s)
{
	int N = s.size(), p = 0, n = 0;

	for (int i = 0; i < N; i += 2)
	{
		if (s[i] > 0)
		{
			p++;
		}
		else if (s[i + 1] < 0)
		{
			n++;
		}
	}

	return std::max(p, n);
}
#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...