제출 #900699

#제출 시각아이디문제언어결과실행 시간메모리
900699ozner77Arranging Shoes (IOI19_shoes)C++17
0 / 100
14 ms2652 KiB
#include "shoes.h" #include <bits/stdc++.h> #include <vector> #include <iostream> #include <string> #include <algorithm> using namespace std; long long count_swaps(vector<int> s) { long long swaps=0; int e=s.size(); e=e/2; swaps=((e-1)*(e))/2; if(e==1){ swaps=0; } return swaps; }
#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...