# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387258 | ismoilov | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fv(c) for(int (a) = (1); (a) <= (c); (a)++)
#define fz(c) for(int (a) = (0); (a) < (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
#define pb push_back
#define in insert
#define ss second
#define ff first
ll S(vector <int> &s)
{
int n = s.size(), i = 0;
ll ans = 0;
while(!s.empty())
{
auto x = find(all(s), -s[i]);
ans += x - s.begin() - (s[i] < 0);
//cout << ans << " " << s[i] << " " << x-s.begin() <<" " << i << "\n";
s.erase(x);
s.erase(s.begin());
// i ++;
}
return ans;
}
int main()
{
IOS;
int n;
cin >> n;
vector <int> c(2*n);
fp(i,0,2*n)
cin >> c[i];
cout << S(c);
/*int t;
cin >> t;
while(t--)
S();*/
}