제출 #143582

#제출 시각아이디문제언어결과실행 시간메모리
143582cfalasArranging Shoes (IOI19_shoes)C++14
0 / 100
79 ms6624 KiB
#include<bits/stdc++.h> using namespace std; #include "shoes.h" long long count_swaps(std::vector<int> s) { int n = s.size()/2; set<int> se; for(int i=0;i<n;i++){ se.insert(abs(s[i])); } if(n%2==0) return n/2; else{ return n/2 + se.size()-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...