제출 #1141135

#제출 시각아이디문제언어결과실행 시간메모리
1141135altern23Arranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms328 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; #define ll long long long long count_swaps(vector<int> s) { ll n = s.size(); vector<pair<ll, ll>> isi[n + 5]; for(int i = 0; i < n; i++){ isi[abs(s[i])].push_back({i, s[i]}); } ll ans = 0; for(ll i = 1; i <= n; i++){ stack<ll> pos, neg; for(auto [idx, val] : isi[i]){ // kalau - ketemu + if(val < 0){ if(!pos.empty()){ ans += idx - pos.top(); pos.pop(); } else{ neg.push(idx); } } else{ if(!neg.empty()){ neg.pop(); } else{ pos.push(idx); } } } } 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...