제출 #1242583

#제출 시각아이디문제언어결과실행 시간메모리
1242583iyedooArranging Shoes (IOI19_shoes)C++20
10 / 100
16 ms1864 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll mn = LLONG_MAX; ll count_swaps(vector<int> s) { int n = s.size(); int spot = 0; int ans = 0; for (int i = 0; i < n; ++i) { if (s[i] < 0) { // cout << i << " " << spot << "\n"; ans += abs(i - spot); spot += 2; } } 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...