oj.uz

Submission #40015

# Submission time Handle Problem Language Result Execution time Memory
40015 2018-01-25T09:02:40 Z krauch ČVENK (COI15_cvenk) C++14
100 / 100
 1879 ms 374612 KB 
/*
 _    _    _______   _    _
| |  / /  |  _____| | |  / /
| | / /   | |       | | / /
| |/ /    | |_____  | |/ /
| |\ \    |  _____| | |\ \
| | \ \   | |       | | \ \
| |  \ \  | |_____  | |  \ \
|_|   \_\ |_______| |_|   \_\

*/
#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair < ll, int > PLI;


#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define right(x) x << 1 | 1
#define left(x) x << 1
#define forn(x, a, b) for (int x = a; x <= b; ++x)
#define for1(x, a, b) for (int x = a; x >= b; --x)
#define mkp make_pair
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define y1 kekekek

#define fname ""

const ll ool = 1e18 + 9;
const int oo = 1e9 + 9, base = 1e9 + 7;
const ld eps = 1e-7;
const int N = 5e6 + 6;

int n;
vector < PII > vec;
vector < pair < PII, int > > a;
ll d[N], sz[N], ans = ool;
vector < pair < int, ll > > g[N];
map < PII, int > cnt;

bool cmp(pair < PII, int > a, pair < PII, int > b) {
    if (a.F.S != b.F.S) return a.F.S < b.F.S;
    return a.F.F < b.F.F;
}

void calc(int v, int par) {
    for (auto it : g[v]) {
        int to = it.F;
        if (to == par) continue;
//        cerr << vec[v - 1].F << " " << vec[v - 1].S << " --" << it.S << "--> " << vec[to - 1].F << " " << vec[to - 1].S << "\n";
        calc(to, v);
        sz[v] += sz[to];
        d[v] += d[to] + sz[to] * it.S;
    }
}

void dfs(int v, int par, ll up) {
    for (auto it : g[v]) {
        int to = it.F;
        if (to == par) continue;
        ans = min(ans, up + d[v] - sz[to] * it.S + min(sz[to], n - sz[to]) * it.S);
        dfs(to, v, up + d[v] - d[to] - sz[to] * it.S + (n - sz[to]) * it.S);
    }
}

int main() {
	#ifdef krauch
        freopen("input.txt", "r", stdin);
    #else
        //freopen(fname".in", "r", stdin);
        //freopen(fname".out", "w", stdout);
    #endif

    cin >> n;
    forn(i, 1, n) {
        int x, y;
        cin >> x >> y;
        cnt[PII(x, y)]++;
        vec.eb(x, y);
        forn(i, 0, 31) {
            if (!((x >> i) & 1) && !(y >> i) & 1) continue;
            if ((x >> i) & 1) x -= 1 << i;
            if ((y >> i) & 1) y -= 1 << i;
            vec.eb(x, y);
        }
    }

    sort(all(vec));
    vec.erase(unique(all(vec)), vec.end());
    forn(i, 0, sz(vec) - 1) {
        a.eb(vec[i], i + 1);
        sz[i + 1] = cnt[PII(vec[i].F, vec[i].S)];
        if (i && vec[i - 1].F == vec[i].F) {
            bool ok = 0;
            forn(j, 0, 31) {
                if (!vec[i].S || ((vec[i].S >> j) & 1)) ok = 1;
                if (((vec[i].F >> j) & 1) || ((vec[i].S >> j) & 1)) break;
            }
            if (ok) g[i].eb(i + 1, vec[i].S - vec[i - 1].S);
        }
    }

    sort(all(a), cmp);

    forn(i, 1, sz(a) - 1) {
        if (a[i - 1].F.S == a[i].F.S) {
            bool ok = 0;
            forn(j, 0, 31) {
                if (!a[i].F.F || ((a[i].F.F >> j) & 1)) ok = 1;
                if (((a[i].F.F >> j) & 1) || ((a[i].F.S >> j) & 1)) break;
            }
            if (ok) g[a[i - 1].S].eb(a[i].S, a[i].F.F - a[i - 1].F.F);
        }
    }

    calc(1, -1);
    ans = d[1];
    dfs(1, -1, 0);

    cout << ans << "\n";

	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 197340 KB Output is correct
2 Correct 24 ms 197340 KB Output is correct
3 Correct 26 ms 197340 KB Output is correct
4 Correct 34 ms 197340 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 197612 KB Output is correct
2 Correct 30 ms 197480 KB Output is correct
3 Correct 45 ms 197472 KB Output is correct
4 Correct 38 ms 197480 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 210036 KB Output is correct
2 Correct 175 ms 210036 KB Output is correct
3 Correct 129 ms 203576 KB Output is correct
4 Correct 113 ms 203572 KB Output is correct
5 Correct 139 ms 209740 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1841 ms 374612 KB Output is correct
2 Correct 1879 ms 374596 KB Output is correct
3 Correct 737 ms 338388 KB Output is correct
4 Correct 936 ms 334844 KB Output is correct
5 Correct 1022 ms 335176 KB Output is correct