Submission #283211

#TimeUsernameProblemLanguageResultExecution timeMemory
283211IWANTTOGETGOLDINIOIArranging Shoes (IOI19_shoes)C++14
10 / 100
33 ms3064 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; int count_swaps( vector < int > vc ){ int n = vc.size() / 2; int res = 0; if(n == 1) { if (vc[0] < vc[1]) { return 0; } else if (vc[0] > vc[1]) { return 1; } } for (int i = 1;i < n; i++){ res += i; } return res; }
#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...