oj.uz

Submission #62502

# Submission time Handle Problem Language Result Execution time Memory
62502 2018-07-28T19:56:29 Z qkxwsm Construction of Highway (JOI18_construction) C++17
0 / 100
 8 ms 832 KB 
/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
 */
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
    int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
    	return x ^ (x >> 7) ^ (x >> 4);
	}
	int operator()(long long x) const
	{
		return x ^ (x >> 32);
	}
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using hashtable = gp_hash_table<T, T, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T>
T normalize(T x, T mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N;
int arr[MAXN];
vector<int> compress;
int parent[MAXN];
int quer[MAXN];
int depth[MAXN];
int ancestor[25][MAXN];
ll fenwick[MAXN];

void update(int idx, ll v)
{
    for (int e = idx + 1; e <= N; e += e & (-e))
    {
        fenwick[e] += v;
    }
    return;
}
ll query(int idx)
{
    ll res = 0;
    for (int e = idx + 1; e; e -= e & (-e))
    {
        res += fenwick[e];
    }
    return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
    cin >> N;
    compress.resize(N);
    for (int i = 0; i < N; i++)
    {
        cin >> arr[i];
        compress[i] = arr[i];
    }
    sort(compress.begin(), compress.end());
    compress.erase(unique(compress.begin(), compress.end()), compress.end());
    for (int i = 0; i < N; i++)
    {
        arr[i] = LB(compress.begin(), compress.end(), arr[i]) - compress.begin();
    }
    arr[N] = N;
    parent[0] = N;
    depth[0] = 0;
    for (int i = 0; i < N - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u--; v--;
        parent[v] = u;
        depth[v] = depth[u] + 1;
        quer[i] = v;
    }
    for (int i = 0; i < 25; i++)
    {
        ancestor[i][N] = N;
    }
    for (int i = 0; i < N; i++)
    {
        ancestor[0][i] = parent[i];
    }
    for (int i = 1; i <= 21; i++)
    {
        for (int j = 0; j < N; j++)
        {
            ancestor[i][j] = ancestor[i - 1][ancestor[i - 1][j]];
        }
    }
    for (int i = 0; i < N - 1; i++)
    {
        //query inversions on path to u
        //update path to u to all be equal to arr[u]
        ll ans = 0;
        int u = quer[i], v = parent[u];
        while(v != N)
        {
            int freq = 1;
            for (int j = 20; j >= 0; j--)
            {
                if (arr[v] == arr[ancestor[j][v]])
                {
                    freq += (1 << j);
                    v = ancestor[j][v];
                }
            }
            ans += freq * query(arr[v] - 1);
            update(arr[v], freq);
            v = parent[v];
        }
        // v = parent[u];
        // while(v != N)
        // {
        //     int freq = 1;
        //     for (int j = 20; j >= 0; j--)
        //     {
        //         if (arr[v] == arr[ancestor[j][v]])
        //         {
        //             freq += (1 << j);
        //             v = ancestor[j][v];
        //         }
        //     }
        //     update(arr[v], -freq);
        //     v = parent[v];
        // }
        v = parent[u];
        while(v != N)
        {
            update(arr[v], -1);
            arr[v] = arr[u];
            v = parent[v];
        }
        cout << ans << '\n';
    }
	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

construction.cpp: In function 'int32_t main()':
construction.cpp:178:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
construction.cpp:179:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 3 ms 668 KB Output is correct
4 Correct 3 ms 744 KB Output is correct
5 Correct 4 ms 744 KB Output is correct
6 Correct 4 ms 756 KB Output is correct
7 Correct 4 ms 756 KB Output is correct
8 Correct 4 ms 808 KB Output is correct
9 Correct 4 ms 808 KB Output is correct
10 Correct 8 ms 832 KB Output is correct
11 Correct 4 ms 832 KB Output is correct
12 Correct 3 ms 832 KB Output is correct
13 Correct 4 ms 832 KB Output is correct
14 Correct 5 ms 832 KB Output is correct
15 Correct 4 ms 832 KB Output is correct
16 Correct 4 ms 832 KB Output is correct
17 Correct 4 ms 832 KB Output is correct
18 Correct 5 ms 832 KB Output is correct
19 Correct 4 ms 832 KB Output is correct
20 Correct 4 ms 832 KB Output is correct
21 Correct 4 ms 832 KB Output is correct
22 Incorrect 2 ms 832 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 3 ms 668 KB Output is correct
4 Correct 3 ms 744 KB Output is correct
5 Correct 4 ms 744 KB Output is correct
6 Correct 4 ms 756 KB Output is correct
7 Correct 4 ms 756 KB Output is correct
8 Correct 4 ms 808 KB Output is correct
9 Correct 4 ms 808 KB Output is correct
10 Correct 8 ms 832 KB Output is correct
11 Correct 4 ms 832 KB Output is correct
12 Correct 3 ms 832 KB Output is correct
13 Correct 4 ms 832 KB Output is correct
14 Correct 5 ms 832 KB Output is correct
15 Correct 4 ms 832 KB Output is correct
16 Correct 4 ms 832 KB Output is correct
17 Correct 4 ms 832 KB Output is correct
18 Correct 5 ms 832 KB Output is correct
19 Correct 4 ms 832 KB Output is correct
20 Correct 4 ms 832 KB Output is correct
21 Correct 4 ms 832 KB Output is correct
22 Incorrect 2 ms 832 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 3 ms 668 KB Output is correct
4 Correct 3 ms 744 KB Output is correct
5 Correct 4 ms 744 KB Output is correct
6 Correct 4 ms 756 KB Output is correct
7 Correct 4 ms 756 KB Output is correct
8 Correct 4 ms 808 KB Output is correct
9 Correct 4 ms 808 KB Output is correct
10 Correct 8 ms 832 KB Output is correct
11 Correct 4 ms 832 KB Output is correct
12 Correct 3 ms 832 KB Output is correct
13 Correct 4 ms 832 KB Output is correct
14 Correct 5 ms 832 KB Output is correct
15 Correct 4 ms 832 KB Output is correct
16 Correct 4 ms 832 KB Output is correct
17 Correct 4 ms 832 KB Output is correct
18 Correct 5 ms 832 KB Output is correct
19 Correct 4 ms 832 KB Output is correct
20 Correct 4 ms 832 KB Output is correct
21 Correct 4 ms 832 KB Output is correct
22 Incorrect 2 ms 832 KB Output isn't correct
23 Halted 0 ms 0 KB -