Submission #288874

#TimeUsernameProblemLanguageResultExecution timeMemory
288874mohammadArranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms384 KiB
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
// #define int long long

typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

int n ;
vector<pair<int , int >> v; 

// bool cn(auto a , auto b){
// 	if(abs(a.first) == abs(b.first)){
// 		if(a.first == b.first) return a
// 	}
// }

ll count_swaps(vector<int> s) {
	n = s.size();
	for(int i = 0 ; i < n ; ++i){
		v.push_back({s[i] , i});
	}
	return (s[0] == -1 ? 0ll : 1ll) ;
	// sort(v.begin(), v.end() , cn);
}
#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...