제출 #147398

#제출 시각아이디문제언어결과실행 시간메모리
147398mosiashvililukaArranging Shoes (IOI19_shoes)C++14
25 / 100
34 ms3448 KiB
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,f[200009];
long long count_swaps(vector <int> S){
a=S.size();
	for(b=1; b<=a; b++) f[b]=S[b-1];
	if(a==2){
	if(f[1]<0) return 0LL; else return 1LL;
	}else{
      a/=2;
		return (a-1)*a/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...