oj.uz

Submission #62517

# Submission time Handle Problem Language Result Execution time Memory
62517 2018-07-28T20:44:38 Z qkxwsm Construction of Highway (JOI18_construction) C++17
16 / 100
 2000 ms 4640 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, T;
int arr[MAXN];
vector<int> compress;
vector<int> edge[MAXN];
int parent[MAXN];
int quer[MAXN];
int depth[MAXN];
int ancestor[25][MAXN];
ll fenwick[MAXN];
int sqr[MAXN], upd[MAXN];
int st[MAXN], ft[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;
}
void dfs(int u)
{
    st[u] = T;
    ft[u] = T;
    T++;
    for (int v : edge[u])
    {
        dfs(v);
        ft[u] = ft[v];
    }
    return;
}
int get(int l, int r)
{
    int res = -INF;
    for (int i = l; i <= r; i++)
    {
        ckmax(res, upd[i]);
    }
    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;
    st[N] = N;
    ft[N] = N;
    for (int i = 0; i < N - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u--; v--;
        parent[v] = u;
        edge[u].PB(v);
        depth[v] = depth[u] + 1;
        quer[i] = v;
    }
    dfs(0);
    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; i++)
    {
        upd[i] = -i - 1;
    }
    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)
        {
            ll freq = 1;
            for (int j = 20; j >= 0; j--)
            {
                if (get(st[v], ft[v]) == get(st[ancestor[j][v]], ft[ancestor[j][v]]))
                {
                    freq += (1 << j);
                    v = ancestor[j][v];
                }
            }
            ans += freq * query(arr[quer[get(st[v], ft[v])]] - 1);
            update(arr[quer[get(st[v], ft[v])]], freq);
            v = parent[v];
        }
        v = parent[u];
        while(v != N)
        {
            ll freq = 1;
            for (int j = 20; j >= 0; j--)
            {
                if (get(st[v], ft[v]) == get(st[ancestor[j][v]], ft[ancestor[j][v]]))
                {
                    freq += (1 << j);
                    v = ancestor[j][v];
                }
            }
            update(arr[quer[get(st[v], ft[v])]], -freq);
            v = parent[v];
        }
        upd[st[u]] = i;
        // while(v != N)
        // {
        //     arr[v] = arr[u];
        //     v = parent[v];
        // }
        //most recently updated time in subtree?
        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:202: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:203: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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 5 ms 2924 KB Output is correct
3 Correct 6 ms 2976 KB Output is correct
4 Correct 9 ms 3052 KB Output is correct
5 Correct 21 ms 3128 KB Output is correct
6 Correct 18 ms 3180 KB Output is correct
7 Correct 19 ms 3180 KB Output is correct
8 Correct 17 ms 3180 KB Output is correct
9 Correct 18 ms 3236 KB Output is correct
10 Correct 15 ms 3236 KB Output is correct
11 Correct 20 ms 3304 KB Output is correct
12 Correct 23 ms 3304 KB Output is correct
13 Correct 18 ms 3304 KB Output is correct
14 Correct 22 ms 3304 KB Output is correct
15 Correct 32 ms 3304 KB Output is correct
16 Correct 31 ms 3304 KB Output is correct
17 Correct 42 ms 3304 KB Output is correct
18 Correct 33 ms 3304 KB Output is correct
19 Correct 18 ms 3304 KB Output is correct
20 Correct 20 ms 3308 KB Output is correct
21 Correct 19 ms 3308 KB Output is correct
22 Correct 19 ms 3308 KB Output is correct
23 Correct 19 ms 3308 KB Output is correct
24 Correct 23 ms 3308 KB Output is correct
25 Correct 20 ms 3308 KB Output is correct
26 Correct 15 ms 3308 KB Output is correct
27 Correct 19 ms 3308 KB Output is correct
28 Correct 18 ms 3308 KB Output is correct
29 Correct 19 ms 3308 KB Output is correct
30 Correct 43 ms 3308 KB Output is correct
31 Correct 33 ms 3308 KB Output is correct
32 Correct 19 ms 3308 KB Output is correct
33 Correct 15 ms 3308 KB Output is correct
34 Correct 12 ms 3308 KB Output is correct
35 Correct 10 ms 3308 KB Output is correct
36 Correct 16 ms 3308 KB Output is correct
37 Correct 13 ms 3308 KB Output is correct
38 Correct 9 ms 3308 KB Output is correct
39 Correct 16 ms 3308 KB Output is correct
40 Correct 15 ms 3308 KB Output is correct
41 Correct 13 ms 3308 KB Output is correct
42 Correct 14 ms 3308 KB Output is correct
43 Correct 18 ms 3308 KB Output is correct
44 Correct 14 ms 3308 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 5 ms 2924 KB Output is correct
3 Correct 6 ms 2976 KB Output is correct
4 Correct 9 ms 3052 KB Output is correct
5 Correct 21 ms 3128 KB Output is correct
6 Correct 18 ms 3180 KB Output is correct
7 Correct 19 ms 3180 KB Output is correct
8 Correct 17 ms 3180 KB Output is correct
9 Correct 18 ms 3236 KB Output is correct
10 Correct 15 ms 3236 KB Output is correct
11 Correct 20 ms 3304 KB Output is correct
12 Correct 23 ms 3304 KB Output is correct
13 Correct 18 ms 3304 KB Output is correct
14 Correct 22 ms 3304 KB Output is correct
15 Correct 32 ms 3304 KB Output is correct
16 Correct 31 ms 3304 KB Output is correct
17 Correct 42 ms 3304 KB Output is correct
18 Correct 33 ms 3304 KB Output is correct
19 Correct 18 ms 3304 KB Output is correct
20 Correct 20 ms 3308 KB Output is correct
21 Correct 19 ms 3308 KB Output is correct
22 Correct 19 ms 3308 KB Output is correct
23 Correct 19 ms 3308 KB Output is correct
24 Correct 23 ms 3308 KB Output is correct
25 Correct 20 ms 3308 KB Output is correct
26 Correct 15 ms 3308 KB Output is correct
27 Correct 19 ms 3308 KB Output is correct
28 Correct 18 ms 3308 KB Output is correct
29 Correct 19 ms 3308 KB Output is correct
30 Correct 43 ms 3308 KB Output is correct
31 Correct 33 ms 3308 KB Output is correct
32 Correct 19 ms 3308 KB Output is correct
33 Correct 15 ms 3308 KB Output is correct
34 Correct 12 ms 3308 KB Output is correct
35 Correct 10 ms 3308 KB Output is correct
36 Correct 16 ms 3308 KB Output is correct
37 Correct 13 ms 3308 KB Output is correct
38 Correct 9 ms 3308 KB Output is correct
39 Correct 16 ms 3308 KB Output is correct
40 Correct 15 ms 3308 KB Output is correct
41 Correct 13 ms 3308 KB Output is correct
42 Correct 14 ms 3308 KB Output is correct
43 Correct 18 ms 3308 KB Output is correct
44 Correct 14 ms 3308 KB Output is correct
45 Correct 56 ms 3308 KB Output is correct
46 Correct 985 ms 3852 KB Output is correct
47 Correct 927 ms 3964 KB Output is correct
48 Correct 828 ms 3980 KB Output is correct
49 Correct 708 ms 4124 KB Output is correct
50 Correct 693 ms 4128 KB Output is correct
51 Correct 704 ms 4140 KB Output is correct
52 Correct 945 ms 4140 KB Output is correct
53 Correct 922 ms 4140 KB Output is correct
54 Correct 955 ms 4140 KB Output is correct
55 Correct 1044 ms 4140 KB Output is correct
56 Correct 971 ms 4140 KB Output is correct
57 Correct 1669 ms 4140 KB Output is correct
58 Correct 1718 ms 4140 KB Output is correct
59 Correct 1919 ms 4140 KB Output is correct
60 Correct 1947 ms 4140 KB Output is correct
61 Correct 1000 ms 4140 KB Output is correct
62 Correct 1042 ms 4140 KB Output is correct
63 Correct 986 ms 4140 KB Output is correct
64 Correct 916 ms 4140 KB Output is correct
65 Correct 900 ms 4140 KB Output is correct
66 Correct 911 ms 4140 KB Output is correct
67 Correct 924 ms 4140 KB Output is correct
68 Correct 766 ms 4140 KB Output is correct
69 Correct 1022 ms 4140 KB Output is correct
70 Correct 943 ms 4140 KB Output is correct
71 Correct 959 ms 4140 KB Output is correct
72 Correct 1650 ms 4140 KB Output is correct
73 Correct 1727 ms 4140 KB Output is correct
74 Correct 926 ms 4140 KB Output is correct
75 Correct 500 ms 4140 KB Output is correct
76 Correct 362 ms 4140 KB Output is correct
77 Correct 344 ms 4140 KB Output is correct
78 Correct 544 ms 4140 KB Output is correct
79 Correct 380 ms 4140 KB Output is correct
80 Correct 294 ms 4140 KB Output is correct
81 Correct 657 ms 4140 KB Output is correct
82 Correct 586 ms 4140 KB Output is correct
83 Correct 586 ms 4140 KB Output is correct
84 Correct 777 ms 4140 KB Output is correct
85 Correct 612 ms 4140 KB Output is correct
86 Correct 606 ms 4140 KB Output is correct

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 5 ms 2924 KB Output is correct
3 Correct 6 ms 2976 KB Output is correct
4 Correct 9 ms 3052 KB Output is correct
5 Correct 21 ms 3128 KB Output is correct
6 Correct 18 ms 3180 KB Output is correct
7 Correct 19 ms 3180 KB Output is correct
8 Correct 17 ms 3180 KB Output is correct
9 Correct 18 ms 3236 KB Output is correct
10 Correct 15 ms 3236 KB Output is correct
11 Correct 20 ms 3304 KB Output is correct
12 Correct 23 ms 3304 KB Output is correct
13 Correct 18 ms 3304 KB Output is correct
14 Correct 22 ms 3304 KB Output is correct
15 Correct 32 ms 3304 KB Output is correct
16 Correct 31 ms 3304 KB Output is correct
17 Correct 42 ms 3304 KB Output is correct
18 Correct 33 ms 3304 KB Output is correct
19 Correct 18 ms 3304 KB Output is correct
20 Correct 20 ms 3308 KB Output is correct
21 Correct 19 ms 3308 KB Output is correct
22 Correct 19 ms 3308 KB Output is correct
23 Correct 19 ms 3308 KB Output is correct
24 Correct 23 ms 3308 KB Output is correct
25 Correct 20 ms 3308 KB Output is correct
26 Correct 15 ms 3308 KB Output is correct
27 Correct 19 ms 3308 KB Output is correct
28 Correct 18 ms 3308 KB Output is correct
29 Correct 19 ms 3308 KB Output is correct
30 Correct 43 ms 3308 KB Output is correct
31 Correct 33 ms 3308 KB Output is correct
32 Correct 19 ms 3308 KB Output is correct
33 Correct 15 ms 3308 KB Output is correct
34 Correct 12 ms 3308 KB Output is correct
35 Correct 10 ms 3308 KB Output is correct
36 Correct 16 ms 3308 KB Output is correct
37 Correct 13 ms 3308 KB Output is correct
38 Correct 9 ms 3308 KB Output is correct
39 Correct 16 ms 3308 KB Output is correct
40 Correct 15 ms 3308 KB Output is correct
41 Correct 13 ms 3308 KB Output is correct
42 Correct 14 ms 3308 KB Output is correct
43 Correct 18 ms 3308 KB Output is correct
44 Correct 14 ms 3308 KB Output is correct
45 Correct 56 ms 3308 KB Output is correct
46 Correct 985 ms 3852 KB Output is correct
47 Correct 927 ms 3964 KB Output is correct
48 Correct 828 ms 3980 KB Output is correct
49 Correct 708 ms 4124 KB Output is correct
50 Correct 693 ms 4128 KB Output is correct
51 Correct 704 ms 4140 KB Output is correct
52 Correct 945 ms 4140 KB Output is correct
53 Correct 922 ms 4140 KB Output is correct
54 Correct 955 ms 4140 KB Output is correct
55 Correct 1044 ms 4140 KB Output is correct
56 Correct 971 ms 4140 KB Output is correct
57 Correct 1669 ms 4140 KB Output is correct
58 Correct 1718 ms 4140 KB Output is correct
59 Correct 1919 ms 4140 KB Output is correct
60 Correct 1947 ms 4140 KB Output is correct
61 Correct 1000 ms 4140 KB Output is correct
62 Correct 1042 ms 4140 KB Output is correct
63 Correct 986 ms 4140 KB Output is correct
64 Correct 916 ms 4140 KB Output is correct
65 Correct 900 ms 4140 KB Output is correct
66 Correct 911 ms 4140 KB Output is correct
67 Correct 924 ms 4140 KB Output is correct
68 Correct 766 ms 4140 KB Output is correct
69 Correct 1022 ms 4140 KB Output is correct
70 Correct 943 ms 4140 KB Output is correct
71 Correct 959 ms 4140 KB Output is correct
72 Correct 1650 ms 4140 KB Output is correct
73 Correct 1727 ms 4140 KB Output is correct
74 Correct 926 ms 4140 KB Output is correct
75 Correct 500 ms 4140 KB Output is correct
76 Correct 362 ms 4140 KB Output is correct
77 Correct 344 ms 4140 KB Output is correct
78 Correct 544 ms 4140 KB Output is correct
79 Correct 380 ms 4140 KB Output is correct
80 Correct 294 ms 4140 KB Output is correct
81 Correct 657 ms 4140 KB Output is correct
82 Correct 586 ms 4140 KB Output is correct
83 Correct 586 ms 4140 KB Output is correct
84 Correct 777 ms 4140 KB Output is correct
85 Correct 612 ms 4140 KB Output is correct
86 Correct 606 ms 4140 KB Output is correct
87 Execution timed out 2064 ms 4640 KB Time limit exceeded
88 Halted 0 ms 0 KB -