Submission #297886

#TimeUsernameProblemLanguageResultExecution timeMemory
297886erd1Arranging Shoes (IOI19_shoes)C++14
10 / 100
1 ms288 KiB
#include "shoes.h" #include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back #define all(x) (x).begin(), (x).end() typedef int64_t lld; typedef pair<int, int> pii; #include<bits/extc++.h> using namespace __gnu_pbds; template<typename T> using OST = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; map<int, int> cnt; bool operator<(pii a, pii b){ if(abs(a.ff) != abs(b.ff))return abs(a.ff) < abs(b.ff); if(a.ss != b.ss)return a.ss < b.ss; return a.ff < b.ff; } OST<pii> ost; long long count_swaps(vector<int> s) { lld ans = 0; for(auto i: s)ans += ost.size()-ost.order_of_key({i, cnt[i]}), ost.insert({i, cnt[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...