Submission #1242649

#TimeUsernameProblemLanguageResultExecution timeMemory
1242649mohamedboukerche55Arranging Shoes (IOI19_shoes)C++20
50 / 100
1097 ms1864 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; long long count_swaps(vector<int> s) { int n = s.size(); long long ans = 0; for (int i = 0; i < n; i += 2) { for (int j = i+1; j < n; j++) { if (s[j] == -s[i]) { for (int k = j-1; k > i; k--) { swap(s[k], s[k+1]); ans++; } if (s[i] > s[i+1]) { swap(s[i], s[i+1]); ans++; } break; } } } 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...