Submission #339385

#TimeUsernameProblemLanguageResultExecution timeMemory
339385israeladewuyiArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms364 KiB
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define PB push_back
#define pb pop_back
#define in insert 
#define endl "\n"
const unsigned int M = 1000000007;

ll count_swaps(vi s){
	int n = s.size();
	int swaps = 0;
	for(int i = 0; i < n;i+=2){
		int x = abs(s[i+1]);
		if(s[i] != -x)swaps++;
	}
	return swaps;
}

//int main(){
//	vi v;
//	v.PB(2);
//	v.PB(-2);
//	cout<<count_swaps(v);
//}
#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...