| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 485842 | arwaeystoamneg | Ideal city (IOI12_city) | 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.
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<unordered_set>
#include<unordered_map>
#include<chrono>
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
if (sz(s))
{
freopen((s + ".in").c_str(), "r", stdin);
if (s != "test1")
freopen((s + ".out").c_str(), "w", stdout);
}
#endif
}
int n;
vpi a;
vector<vi>adj;
vi sizes;
vector<pair<int, pii>>b;
vi c;
int m;
vi sub;
vi parent;
void dfs(int i, int p)
{
parent[i] = p;
sub[i] = sizes[i];
trav(x, adj[i])
{
if (x == p)continue;
dfs(x, i);
sub[i] += sub[x];
}
}
ll sum = 0;
ll solve()
{
sort(all(a));
vector<vi>x;
F0R(i, n)
{
if (sz(x) <= a[i].f)x.pb(vi());
x[a[i].f].pb(i);
}
c.pb(0);
F0R(i, sz(x))
{
int last = -2;
trav(j, x[i])
{
int y = a[j].s;
if (last == y - 1)
{
b.back().s.s++;
sizes[sz(b) - 1]++;
}
else
{
b.pb({ i,{y,y} });
sizes.pb(1);
}
last = y;
}
c.pb(sz(b));
}
m = sz(b);
adj.rsz(m);
F0R(i, sz(x) - 1)
{
int j = c[i], k = c[i + 1];
while (j < c[i + 1] && k < c[i + 2])
{
if ((b[j].s.s >= b[k].s.f && b[j].s.s <= b[k].s.s) || (b[k].s.s >= b[j].s.f && b[k].s.s <= b[j].s.s)) { adj[j].pb(k); adj[k].pb(j); }
if (b[j].s.s < b[k].s.s)j++;
else k++;
}
}
parent.rsz(m);
sub.rsz(m);
dfs(0, -1);
ll ans = 0;
FOR(i, 1, m)
{
ans += (sub[0] - sub[i]) * ((ll)sub[i]);
}
return ans;
}
int main()
{
setIO("test1");
cin >> n;
a.rsz(n);
int mx = inf, my = inf;
trav(x, a)cin >> x.f >> x.s, mx = min(mx, x.f), my = min(my, x.s);
trav(x, a)x.f -= mx, x.s -= my;
ll ans = 0;
ans = solve();
trav(x, a)swap(x.f, x.s);
adj.clear();
sizes.clear();
b.clear();
c.clear();
m = 0;
sub.clear();
parent.clear();
ans += solve();
cout << ans % 1000000000 << endl;
}