제출 #282683

#제출 시각아이디문제언어결과실행 시간메모리
282683medmdgArranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms256 KiB
#include <bits/stdc++.h> using namespace std; long long count_swaps(std::vector<int> S){ int n=S.size()/2; long long int ans=0; for(int i=0;i<2*n-1;i+=2){ if(S[i]>S[i+1]){ ans++; } } return ans; }
#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...