| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1288839 | muhammad-mutahir | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
// int n , m , k , q;
//
// void solve(int testcase_number){
// cin>>n;
//
// }
//
//
long long count_swaps(vector<int> s) {
vector<pair<int,int>>ord;
int ans = 0;
int n = s.size();
map<int,int>cnt;
for(int i = 0;i<n;i++){
cnt[abs(s[i])]++;
if(cnt[abs(s[i])]%2 == 0){
int x = i;
while(i-1>=0 and abs(s[i-1]) != abs(s[i])){
swap(s[i],s[i-1]);
i--;
ans++;
}
if(i-1>=0 and s[i]<s[i-1]){
swap(s[i],s[i-1]);
ans++;
}
}
}
// print(s);
return ans;
}
// signed main(){
// ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
// cin.tie(0), cout.tie(0);
// cout << fixed<<setprecision(9);
// cout<<count_swaps({-2,2,2,-2,-2,2})<<endl;
//
// int t = 1;
// cin>>t;
// for(int i = 1;i<=t;i++){
// solve(i);
// }
// }