제출 #713422

#제출 시각아이디문제언어결과실행 시간메모리
713422europiumArranging Shoes (IOI19_shoes)C++17
15 / 100
19 ms3124 KiB
#include "shoes.h" #include <iostream> #include <vector> #include <algorithm> #include <string> #include <numeric> #include <cmath> #include<iterator> #include <set> #include <map> #include <math.h> #include <iomanip> #include <unordered_set> using namespace std; using ll = long long; ll count_swaps(vector<int> s) { ll n = s.size() / 2; return n * (n - 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...