| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1112072 | FIFI_cpp | Nile (IOI24_nile) | 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>
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
#include <numeric>
#define all(a) a.begin(), a.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ppi pair<int,pair<int,int>>
#define int int64_t
using namespace std;
// /\_/\
// (= ._.)
// / > \>
// encouraging cat
const int INF = 10000000000000000;
const int mod = 1000000007;
//const int mod = 998244353;
const int MAXN = 200005;
//ifstream fin('xor.in');
//ofstream fout('xor.out');
int curr_res = 0;
struct Index {
int a,b,w;
};
struct Node {
int parent, max_value, max_index, size, sb;
};
vector<Index> vals;
vector<Node> info;
vector<pair<int,int>> e;
bool cmp(const Index &x, const Index &y) { return x.w < y.w; }
int find_parent(int x)
{
if (x == info[x].parent)
{
return x;
}
return info[x].parent == find_parent(info[x].parent);
}
void remove(Node x)
{
if (x.size % 2 == 0)
{
curr_res -= x.sb;
}
else
{
curr_res -= x.sb - vals[x.max_index].b + vals[x.max_index].a;
}
}
void add(Node x)
{
if (x.size % 2 == 0)
{
curr_res += x.sb;
}
else
{
curr_res += x.sb - x.max_value;
}
}
pair<Node, Node> merge(Node x,Node y, int ix, int iy)
{
y.parent = ix;
x.size += y.size;
if (y.max_value > x.max_value)
{
x.max_value = y.max_value;
x.max_index = y.max_index;
}
x.sb += y.sb;
return {x,y};
}
void onion (int x, int y)
{
x = find_parent(x);
y = find_parent(y);
if (x == y)
return ;
remove(info[x]);
remove(info[y]);
if (info[y].size > info[x].size)
{
swap(x,y);
}
pair<Node, Node> m = merge(info[x], info[y], x, y);
info[x] = m.first;
info[y] = m.second;
add(info[x]);
}
vector<int> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E)
{
int n = A.size();
info.resize(n);
vals.resize(n);
for (int i = 0;i < n;i++)
{
vals[i].a = A[i];
vals[i].b = B[i];
vals[i].w = W[i];
}
sort(all(vals), cmp);
for (int i = 0;i < n;i++)
{
info[i].parent = i;
info[i].max_index = i;
info[i].max_value = vals[i].b - vals[i].a;
info[i].sb = vals[i].b;
info[i].size = 1;
curr_res += vals[i].a;
}
int q = E.size();
e.resize(q);
for (int i = 0;i < q;i++)
{
e[i].first = E[i];
e[i].second = i;
}
sort(all(e));
vector<pair<int,int>> diff; //
for (int i = 0;i < n - 1;i++)
{
diff.push_back({vals[i + 1].w - vals[i].w, i});
}
sort(all(diff));
vector<int> res(q);
int e_index = 0;
for (int i = 0;i < diff.size();i++)
{
if (diff[i].first <= e[e_index].first)
{
int a = diff[i].second;
int b = diff[i].second + 1;
onion(a,b);
}
else
{
res[e[e_index].second] = curr_res;
e_index++;
i--;
}
}
for (e_index; e_index < q;e_index++)
{
res[e[e_index].second] = curr_res;
}
return res;
}