제출 #144695

#제출 시각아이디문제언어결과실행 시간메모리
144695AASGArranging Shoes (IOI19_shoes)C++14
0 / 100
2 ms256 KiB
#include "shoes.h" long long count_swaps(std::vector<int> s) { if(s[0]<1 && s.size()==1)return 0; else if(s[0]>1 && s.size()==1) return 1; int a; a=s.size(); return (a)*(a-1)/2; }
#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...