| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 824493 | caganyanmaz | Rectangles (IOI19_rect) | C++17 | 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>
#define mp(x...) array<int, 2>({x})
#define pb push_back
#define int int64_t
#define vi vector<int32_t>
using namespace std;
#include "shoes.h"
constexpr static int MXSIZE = 1e6;
struct Fenwick
{
int v[MXSIZE];
void set(int i, int val) { for (++i;i<MXSIZE;i+=i&(-i)) v[i] += val; }
int get(int i) { int res = 0; for(++i;i>0;i-=i&(-i)) res += v[i]; return res; }
};
int subtask1(vi& s)
{
if (s[0] > 0)
return 1;
else
return 0;
}
Fenwick fw;
int last[MXSIZE];
map<int, int> pos;
int subtask4(vi& s)
{
int n = s.size() / 2;
return n * (n-1) / 2;
}
long long count_swaps(vi s)
{
if (s.size() == 2)
return subtask1(s);
return subtask4(s);
}