제출 #650152

#제출 시각아이디문제언어결과실행 시간메모리
650152activedeltorreArranging Shoes (IOI19_shoes)C++14
10 / 100
24 ms3128 KiB
#include <vector> using namespace std; long long count_swaps(vector<int>vec) { long long n=vec.size(); int cnt=0; int suma=0,i; for(i=0;i<n;i++) { if(vec[i]<0) { suma=suma+max(cnt-i,i-cnt); cnt=cnt+2; } } return suma; }
#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...