Submission #347979

#TimeUsernameProblemLanguageResultExecution timeMemory
347979ChaskaArranging Shoes (IOI19_shoes)C++17
10 / 100
0 ms364 KiB
#include "shoes.h" int n; long long count_swaps(std::vector<int> s) { n = s.size()/2; if (n==1) { if (s[0]>s[1]) return 1; else return 0; } else return 0; }
#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...