Submission #619791

#TimeUsernameProblemLanguageResultExecution timeMemory
619791UncoolAnonArranging Shoes (IOI19_shoes)C++14
50 / 100
1089 ms3924 KiB
#include "shoes.h"
#include <bits/stdc++.h> 

using namespace std; 
long long count_swaps(vector<int> s){
	int n=s.size(); 
	vector<int> marked(n); 
	long long answer=0; 
	for(int i=0;i<n;i++){
		if(!marked[i]){
			for(int j=i+1;j<n;j++){
				if(!marked[j]&&abs(s[j])==abs(s[i])&&(s[i]*s[j]<0)){
					marked[j]=1; 
					if(s[i]<0&&s[j]>0){}
					else ++answer; 
					break ; 
				}
				else{
					answer+=(marked[j]^1); 
				}
			}
		}
	}
	return answer; 
}

#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...