제출 #306605

#제출 시각아이디문제언어결과실행 시간메모리
306605syyArranging Shoes (IOI19_shoes)C++17
10 / 100
5 ms4992 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++) #define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--) typedef pair<int, int> pi; typedef pair<pi, int> pii; typedef pair<pi, pi> pipi; #define f first #define s second typedef vector<int> vi; typedef vector<pi> vpi; typedef vector<pii> vpii; #define pb push_back #define pf push_front #define all(v) v.begin(), v.end() #define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin()); #define INF (int) 1e9 + 100 #define LLINF (ll) 1e18 #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge"))) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng) inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss ll n, ans; vi lpos[100005], rpos[100005]; ll count_swaps(vector<int> v) { n = v.size()/2; FOR(i, 0, 2*n-1) { if (v[i] < 0) { if (!rpos[-v[i]].empty()) ans += i - rpos[-v[i]].back(), rpos[-v[i]].pop_back(); else lpos[-v[i]].pb(i); } else { if (!lpos[v[i]].empty()) ans += i - lpos[v[i]].back() - 1, lpos[v[i]].pop_back(); else rpos[v[i]].pb(i); } } 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...