제출 #314075

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