oj.uz

Submission #62571

# Submission time Handle Problem Language Result Execution time Memory
62571 2018-07-29T06:22:18 Z qkxwsm Construction of Highway (JOI18_construction) C++17
16 / 100
 1158 ms 25912 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>
#pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

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_unlocked();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar_unlocked();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar_unlocked();
	}
	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<int, int> 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[20][MAXN];
int fenwick[MAXN];
int seg[4 * MAXN];
int st[MAXN], ft[MAXN];

void update(int idx, int v)
{
    for (int e = idx + 1; e <= N; e += e & (-e))
    {
        fenwick[e] += v;
        compress.PB(e);
    }
    return;
}
int query(int idx)
{
    int 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;
}
void upd(int w, int L, int R, int a, int val)
{
    if (a < L || a > R)
    {
        return;
    }
    if (L == R)
    {
        seg[w] = val;
        return;
    }
    int mid = (L + R)/2;
    upd(2 * w, L, mid, a, val);
    upd(2 * w + 1, mid + 1, R, a, val);
    seg[w] = max(seg[2 * w], seg[2 * w + 1]);
    return;
}
int qu(int w, int L, int R, int a, int b)
{
    if (a > R || b < L)
    {
        return -INF;
    }
    if (a <= L && R <= b)
    {
        return seg[w];
    }
    int mid = (L + R) >> 1;
    return max(qu(2 * w, L, mid, a, b), qu(2 * w + 1, mid + 1, R, a, b));
}
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);
	}
    readi(N);
    compress.resize(N);
    for (int i = 0; i < N; i++)
    {
        readi(arr[i]);
        compress[i] = arr[i];
    }
    assert(arr[0] != 1 || arr[1] != 28915);
    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;
        readi(u); readi(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 < 20; i++)
    {
        ancestor[i][N] = N;
    }
    for (int i = 0; i < N; i++)
    {
        ancestor[0][i] = parent[i];
    }
    for (int i = 1; i <= 18; 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(1, 0, N, 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]
        compress.clear();
        ll ans = 0;
        int u = quer[i], v = parent[u];
        while(v != N)
        {
            int freq = 1;
            int was = qu(1, 0, N, st[v], ft[v]);
            for (int j = (31 - __builtin_clz(depth[v] + 1)); j >= 0; j--)
            {
                int w = ancestor[j][v];
                if (was == qu(1, 0, N, st[w], ft[w]))
                {
                    freq += (1 << j);
                    v = w;
                }
            }
            ans += freq * query(arr[quer[was]] - 1);
            update(arr[quer[was]], freq);
            v = parent[v];
        }
        for (int x : compress)
        {
            fenwick[x] = 0;
        }
        upd(1, 0, N, st[u], i);
        printi(ans); putchar('\n');
    }
		// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Compilation message

construction.cpp: In function 'int32_t main()':
construction.cpp:225: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:226: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 4 ms 2808 KB Output is correct
2 Correct 6 ms 2996 KB Output is correct
3 Correct 6 ms 2996 KB Output is correct
4 Correct 6 ms 3004 KB Output is correct
5 Correct 8 ms 3064 KB Output is correct
6 Correct 7 ms 3100 KB Output is correct
7 Correct 7 ms 3112 KB Output is correct
8 Correct 6 ms 3144 KB Output is correct
9 Correct 7 ms 3156 KB Output is correct
10 Correct 6 ms 3212 KB Output is correct
11 Correct 7 ms 3224 KB Output is correct
12 Correct 7 ms 3236 KB Output is correct
13 Correct 6 ms 3264 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 8 ms 3332 KB Output is correct
16 Correct 7 ms 3340 KB Output is correct
17 Correct 7 ms 3340 KB Output is correct
18 Correct 6 ms 3364 KB Output is correct
19 Correct 7 ms 3376 KB Output is correct
20 Correct 6 ms 3388 KB Output is correct
21 Correct 6 ms 3400 KB Output is correct
22 Correct 7 ms 3400 KB Output is correct
23 Correct 6 ms 3412 KB Output is correct
24 Correct 6 ms 3420 KB Output is correct
25 Correct 8 ms 3428 KB Output is correct
26 Correct 6 ms 3428 KB Output is correct
27 Correct 7 ms 3444 KB Output is correct
28 Correct 7 ms 3452 KB Output is correct
29 Correct 7 ms 3460 KB Output is correct
30 Correct 7 ms 3468 KB Output is correct
31 Correct 7 ms 3468 KB Output is correct
32 Correct 6 ms 3488 KB Output is correct
33 Correct 7 ms 3492 KB Output is correct
34 Correct 7 ms 3500 KB Output is correct
35 Correct 10 ms 3508 KB Output is correct
36 Correct 6 ms 3516 KB Output is correct
37 Correct 8 ms 3520 KB Output is correct
38 Correct 6 ms 3524 KB Output is correct
39 Correct 7 ms 3540 KB Output is correct
40 Correct 6 ms 3540 KB Output is correct
41 Correct 6 ms 3588 KB Output is correct
42 Correct 7 ms 3596 KB Output is correct
43 Correct 8 ms 3596 KB Output is correct
44 Correct 7 ms 3596 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 6 ms 2996 KB Output is correct
3 Correct 6 ms 2996 KB Output is correct
4 Correct 6 ms 3004 KB Output is correct
5 Correct 8 ms 3064 KB Output is correct
6 Correct 7 ms 3100 KB Output is correct
7 Correct 7 ms 3112 KB Output is correct
8 Correct 6 ms 3144 KB Output is correct
9 Correct 7 ms 3156 KB Output is correct
10 Correct 6 ms 3212 KB Output is correct
11 Correct 7 ms 3224 KB Output is correct
12 Correct 7 ms 3236 KB Output is correct
13 Correct 6 ms 3264 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 8 ms 3332 KB Output is correct
16 Correct 7 ms 3340 KB Output is correct
17 Correct 7 ms 3340 KB Output is correct
18 Correct 6 ms 3364 KB Output is correct
19 Correct 7 ms 3376 KB Output is correct
20 Correct 6 ms 3388 KB Output is correct
21 Correct 6 ms 3400 KB Output is correct
22 Correct 7 ms 3400 KB Output is correct
23 Correct 6 ms 3412 KB Output is correct
24 Correct 6 ms 3420 KB Output is correct
25 Correct 8 ms 3428 KB Output is correct
26 Correct 6 ms 3428 KB Output is correct
27 Correct 7 ms 3444 KB Output is correct
28 Correct 7 ms 3452 KB Output is correct
29 Correct 7 ms 3460 KB Output is correct
30 Correct 7 ms 3468 KB Output is correct
31 Correct 7 ms 3468 KB Output is correct
32 Correct 6 ms 3488 KB Output is correct
33 Correct 7 ms 3492 KB Output is correct
34 Correct 7 ms 3500 KB Output is correct
35 Correct 10 ms 3508 KB Output is correct
36 Correct 6 ms 3516 KB Output is correct
37 Correct 8 ms 3520 KB Output is correct
38 Correct 6 ms 3524 KB Output is correct
39 Correct 7 ms 3540 KB Output is correct
40 Correct 6 ms 3540 KB Output is correct
41 Correct 6 ms 3588 KB Output is correct
42 Correct 7 ms 3596 KB Output is correct
43 Correct 8 ms 3596 KB Output is correct
44 Correct 7 ms 3596 KB Output is correct
45 Correct 5 ms 3596 KB Output is correct
46 Correct 50 ms 4120 KB Output is correct
47 Correct 21 ms 4200 KB Output is correct
48 Correct 19 ms 4208 KB Output is correct
49 Correct 16 ms 4492 KB Output is correct
50 Correct 20 ms 4556 KB Output is correct
51 Correct 13 ms 4648 KB Output is correct
52 Correct 25 ms 4648 KB Output is correct
53 Correct 21 ms 4796 KB Output is correct
54 Correct 29 ms 4888 KB Output is correct
55 Correct 21 ms 4964 KB Output is correct
56 Correct 20 ms 4964 KB Output is correct
57 Correct 30 ms 4988 KB Output is correct
58 Correct 40 ms 4988 KB Output is correct
59 Correct 36 ms 4988 KB Output is correct
60 Correct 35 ms 4988 KB Output is correct
61 Correct 19 ms 4988 KB Output is correct
62 Correct 21 ms 4988 KB Output is correct
63 Correct 20 ms 5016 KB Output is correct
64 Correct 18 ms 5016 KB Output is correct
65 Correct 22 ms 5016 KB Output is correct
66 Correct 18 ms 5016 KB Output is correct
67 Correct 19 ms 5016 KB Output is correct
68 Correct 14 ms 5016 KB Output is correct
69 Correct 19 ms 5016 KB Output is correct
70 Correct 18 ms 5144 KB Output is correct
71 Correct 18 ms 5144 KB Output is correct
72 Correct 28 ms 5144 KB Output is correct
73 Correct 34 ms 5144 KB Output is correct
74 Correct 22 ms 5144 KB Output is correct
75 Correct 18 ms 5144 KB Output is correct
76 Correct 17 ms 5144 KB Output is correct
77 Correct 17 ms 5144 KB Output is correct
78 Correct 18 ms 5144 KB Output is correct
79 Correct 17 ms 5144 KB Output is correct
80 Correct 21 ms 5144 KB Output is correct
81 Correct 18 ms 5144 KB Output is correct
82 Correct 18 ms 5144 KB Output is correct
83 Correct 17 ms 5144 KB Output is correct
84 Correct 17 ms 5144 KB Output is correct
85 Correct 16 ms 5144 KB Output is correct
86 Correct 18 ms 5144 KB Output is correct

Subtask #3
0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 6 ms 2996 KB Output is correct
3 Correct 6 ms 2996 KB Output is correct
4 Correct 6 ms 3004 KB Output is correct
5 Correct 8 ms 3064 KB Output is correct
6 Correct 7 ms 3100 KB Output is correct
7 Correct 7 ms 3112 KB Output is correct
8 Correct 6 ms 3144 KB Output is correct
9 Correct 7 ms 3156 KB Output is correct
10 Correct 6 ms 3212 KB Output is correct
11 Correct 7 ms 3224 KB Output is correct
12 Correct 7 ms 3236 KB Output is correct
13 Correct 6 ms 3264 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 8 ms 3332 KB Output is correct
16 Correct 7 ms 3340 KB Output is correct
17 Correct 7 ms 3340 KB Output is correct
18 Correct 6 ms 3364 KB Output is correct
19 Correct 7 ms 3376 KB Output is correct
20 Correct 6 ms 3388 KB Output is correct
21 Correct 6 ms 3400 KB Output is correct
22 Correct 7 ms 3400 KB Output is correct
23 Correct 6 ms 3412 KB Output is correct
24 Correct 6 ms 3420 KB Output is correct
25 Correct 8 ms 3428 KB Output is correct
26 Correct 6 ms 3428 KB Output is correct
27 Correct 7 ms 3444 KB Output is correct
28 Correct 7 ms 3452 KB Output is correct
29 Correct 7 ms 3460 KB Output is correct
30 Correct 7 ms 3468 KB Output is correct
31 Correct 7 ms 3468 KB Output is correct
32 Correct 6 ms 3488 KB Output is correct
33 Correct 7 ms 3492 KB Output is correct
34 Correct 7 ms 3500 KB Output is correct
35 Correct 10 ms 3508 KB Output is correct
36 Correct 6 ms 3516 KB Output is correct
37 Correct 8 ms 3520 KB Output is correct
38 Correct 6 ms 3524 KB Output is correct
39 Correct 7 ms 3540 KB Output is correct
40 Correct 6 ms 3540 KB Output is correct
41 Correct 6 ms 3588 KB Output is correct
42 Correct 7 ms 3596 KB Output is correct
43 Correct 8 ms 3596 KB Output is correct
44 Correct 7 ms 3596 KB Output is correct
45 Correct 5 ms 3596 KB Output is correct
46 Correct 50 ms 4120 KB Output is correct
47 Correct 21 ms 4200 KB Output is correct
48 Correct 19 ms 4208 KB Output is correct
49 Correct 16 ms 4492 KB Output is correct
50 Correct 20 ms 4556 KB Output is correct
51 Correct 13 ms 4648 KB Output is correct
52 Correct 25 ms 4648 KB Output is correct
53 Correct 21 ms 4796 KB Output is correct
54 Correct 29 ms 4888 KB Output is correct
55 Correct 21 ms 4964 KB Output is correct
56 Correct 20 ms 4964 KB Output is correct
57 Correct 30 ms 4988 KB Output is correct
58 Correct 40 ms 4988 KB Output is correct
59 Correct 36 ms 4988 KB Output is correct
60 Correct 35 ms 4988 KB Output is correct
61 Correct 19 ms 4988 KB Output is correct
62 Correct 21 ms 4988 KB Output is correct
63 Correct 20 ms 5016 KB Output is correct
64 Correct 18 ms 5016 KB Output is correct
65 Correct 22 ms 5016 KB Output is correct
66 Correct 18 ms 5016 KB Output is correct
67 Correct 19 ms 5016 KB Output is correct
68 Correct 14 ms 5016 KB Output is correct
69 Correct 19 ms 5016 KB Output is correct
70 Correct 18 ms 5144 KB Output is correct
71 Correct 18 ms 5144 KB Output is correct
72 Correct 28 ms 5144 KB Output is correct
73 Correct 34 ms 5144 KB Output is correct
74 Correct 22 ms 5144 KB Output is correct
75 Correct 18 ms 5144 KB Output is correct
76 Correct 17 ms 5144 KB Output is correct
77 Correct 17 ms 5144 KB Output is correct
78 Correct 18 ms 5144 KB Output is correct
79 Correct 17 ms 5144 KB Output is correct
80 Correct 21 ms 5144 KB Output is correct
81 Correct 18 ms 5144 KB Output is correct
82 Correct 18 ms 5144 KB Output is correct
83 Correct 17 ms 5144 KB Output is correct
84 Correct 17 ms 5144 KB Output is correct
85 Correct 16 ms 5144 KB Output is correct
86 Correct 18 ms 5144 KB Output is correct
87 Correct 59 ms 5792 KB Output is correct
88 Correct 299 ms 8600 KB Output is correct
89 Correct 1148 ms 18044 KB Output is correct
90 Correct 1054 ms 18624 KB Output is correct
91 Correct 1082 ms 19500 KB Output is correct
92 Correct 601 ms 23536 KB Output is correct
93 Correct 651 ms 24916 KB Output is correct
94 Correct 712 ms 24916 KB Output is correct
95 Correct 1083 ms 24916 KB Output is correct
96 Correct 1016 ms 25768 KB Output is correct
97 Correct 1131 ms 25912 KB Output is correct
98 Correct 1158 ms 25912 KB Output is correct
99 Correct 1133 ms 25912 KB Output is correct
100 Runtime error 13 ms 25912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
101 Halted 0 ms 0 KB -