Submission #298237

#TimeUsernameProblemLanguageResultExecution timeMemory
298237RayaabualjamalArranging Shoes (IOI19_shoes)C++14
25 / 100
41 ms2808 KiB
#include "shoes.h" #include <iostream> #include <vector> #include <cstdio> #define rep(i,a,b) for(int i = a; i<b; i++) using namespace std; long long count_swaps(vector<int> s) { int n = s.size()/2; if(s.size()==2){ if(s[0]<0){ return 0; }else{ return 1; } } //vector <int> n(n), p(n), sum(n+n, 0); long long ans = 0; rep(i,0,n){ ans+= i; } 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...