제출 #253432

#제출 시각아이디문제언어결과실행 시간메모리
253432BadrangiikhArranging Shoes (IOI19_shoes)C++14
0 / 100
1 ms256 KiB
#include<bits/stdc++.h> #include <deque> #include <cmath> using namespace std; #define ll long long /*freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);*/ int n , i ; int count_swaps ( vector < int > s ) { n = s . size ( ) ; return ( n - 1 ) * n / 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...