Submission #1237097

#TimeUsernameProblemLanguageResultExecution timeMemory
1237097Ghulam_JunaidArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1864 KiB
#include <bits/stdc++.h> #include "shoes.h" // #include "grader.cpp" using namespace std; typedef long long ll; ll count_swaps(vector<int> s) { ll ans = 0; for (int cur = 0; cur < s.size(); cur += 2){ int f = cur + 1; while (s[f] != -s[cur]) f ++; for (int i = f; i > cur + 1; i --) swap(s[i], s[i - 1]); ans += f - cur - 1; if (s[cur] > 0) ans++; } 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...