Submission #253434

#TimeUsernameProblemLanguageResultExecution timeMemory
253434BadrangiikhArranging Shoes (IOI19_shoes)C++14
0 / 100
38 ms3192 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 ( ) / 2 ; 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...