제출 #1237086

#제출 시각아이디문제언어결과실행 시간메모리
1237086Ghulam_JunaidArranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; typedef long long ll; long long count_swaps(vector<int> s) { int ans = 0; for (int cur = 0; cur < s.size(); cur ++){ int f = cur; while (f < s.size() and s[f] > 0) f++; for (int i = f; i > cur; i --) swap(s[i], s[i - 1]); ans += f - cur; f = cur + 1; while (f < s.size() and -s[f] != s[cur]) f++; for (int i = f; i > cur + 1; i --) swap(s[i], s[i - 1]); ans += f - cur - 1; } 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...