Submission #1242520

#TimeUsernameProblemLanguageResultExecution timeMemory
1242520mohamedboukerche55Arranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#include<bits/stdc++.h> #include "shoes.h" using namespace std; long long count_swaps(std::vector<int> S) { //long long N = S.size() / 2; //return N * (N-1) / 2; if(S[0] > S[1] && abs(S[0])== abs(S[1])) { return 1; } 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...