# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
286208 | 2020-08-30T08:24:33 Z | BeanZ | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "shoes.h" using namespace std; #define ll long long #define endl '\n' const int N = 2e5 + 5; ll a[200005]; ll count_swap(int S[]){ ll now = 0, ans = 0, n = S.size(); for (int i = 0; i < (2 * n); i++){ if (S[i] < 0){ ans = ans + abs(i - now); now += 2; } } return ans; } /* int main(){ ios_base::sync_with_stdio(false); cin.tie(0); if (fopen("VietCT.INP", "r")){ freopen("VietCT.INP", "r", stdin); freopen("VietCT.OUT", "w", stdout); } ll n; cin >> n; for (int i = 1; i <= 2 * n; i++) cin >> a[i]; ll now = 1, ans = 0; for (int i = 1; i <= (2 * n); i++){ if (a[i] < 0){ ans = ans + abs(i - now); now += 2; } } cout << ans; } */ /* */