답안 #62552 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
62552	2018-07-29T05:25:11 Z	qkxwsm	Construction of Highway (JOI18_construction)	C++14	16 / 100	2000 ms	29368 KB

construction

/*
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();
	}
	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 seg[4 * MAXN];
int st[MAXN], ft[MAXN];
vector<int> clr;

void update(int idx, ll v)
{
    for (int e = idx + 1; e <= N; e += e & (-e))
    {
        fenwick[e] += v;
        clr.PB(e);
    }
    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 DNE = -INF; //MODIFY AS APPROPRIATE
int comb(int a, int b)
{
    return max(a, b);
}
void upd(int w, int L, int R, int a, int val)
{
    if (a < L || a > R)
    {
        return;
    }
    if (L > 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] = comb(seg[2 * w], seg[2 * w + 1]);
    return;
}
int qu(int w, int L, int R, int a, int b)
{
    if (L > R || a > b)
    {
        return DNE;
    }
    if (a > R || b < L)
    {
        return DNE;
    }
    if (a <= L && R <= b)
    {
        return seg[w];
    }
    int mid = (L + R)/2;
    return comb(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];
    }
    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 < 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(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]
        ll ans = 0;
        int u = quer[i], v = parent[u];
        while(v != N)
        {
            ll 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 : clr)
        {
            fenwick[x] = 0;
        }
        clr.clear();
        upd(1, 0, N, st[u], i);
        //most recently updated time in subtree?
        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:239: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:240: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

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2936 KB	Output is correct
2	Correct	5 ms	2936 KB	Output is correct
3	Correct	4 ms	2936 KB	Output is correct
4	Correct	5 ms	3000 KB	Output is correct
5	Correct	8 ms	3136 KB	Output is correct
6	Correct	7 ms	3136 KB	Output is correct
7	Correct	6 ms	3136 KB	Output is correct
8	Correct	6 ms	3208 KB	Output is correct
9	Correct	6 ms	3208 KB	Output is correct
10	Correct	7 ms	3208 KB	Output is correct
11	Correct	7 ms	3208 KB	Output is correct
12	Correct	7 ms	3208 KB	Output is correct
13	Correct	8 ms	3208 KB	Output is correct
14	Correct	6 ms	3208 KB	Output is correct
15	Correct	7 ms	3208 KB	Output is correct
16	Correct	8 ms	3208 KB	Output is correct
17	Correct	6 ms	3208 KB	Output is correct
18	Correct	7 ms	3308 KB	Output is correct
19	Correct	8 ms	3308 KB	Output is correct
20	Correct	7 ms	3308 KB	Output is correct
21	Correct	6 ms	3308 KB	Output is correct
22	Correct	6 ms	3308 KB	Output is correct
23	Correct	6 ms	3308 KB	Output is correct
24	Correct	6 ms	3308 KB	Output is correct
25	Correct	8 ms	3308 KB	Output is correct
26	Correct	6 ms	3308 KB	Output is correct
27	Correct	6 ms	3308 KB	Output is correct
28	Correct	6 ms	3308 KB	Output is correct
29	Correct	8 ms	3372 KB	Output is correct
30	Correct	7 ms	3372 KB	Output is correct
31	Correct	8 ms	3372 KB	Output is correct
32	Correct	37 ms	3372 KB	Output is correct
33	Correct	7 ms	3372 KB	Output is correct
34	Correct	7 ms	3372 KB	Output is correct
35	Correct	6 ms	3372 KB	Output is correct
36	Correct	38 ms	3372 KB	Output is correct
37	Correct	7 ms	3372 KB	Output is correct
38	Correct	6 ms	3372 KB	Output is correct
39	Correct	6 ms	3372 KB	Output is correct
40	Correct	8 ms	3372 KB	Output is correct
41	Correct	9 ms	3372 KB	Output is correct
42	Correct	7 ms	3372 KB	Output is correct
43	Correct	6 ms	3372 KB	Output is correct
44	Correct	5 ms	3372 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2936 KB	Output is correct
2	Correct	5 ms	2936 KB	Output is correct
3	Correct	4 ms	2936 KB	Output is correct
4	Correct	5 ms	3000 KB	Output is correct
5	Correct	8 ms	3136 KB	Output is correct
6	Correct	7 ms	3136 KB	Output is correct
7	Correct	6 ms	3136 KB	Output is correct
8	Correct	6 ms	3208 KB	Output is correct
9	Correct	6 ms	3208 KB	Output is correct
10	Correct	7 ms	3208 KB	Output is correct
11	Correct	7 ms	3208 KB	Output is correct
12	Correct	7 ms	3208 KB	Output is correct
13	Correct	8 ms	3208 KB	Output is correct
14	Correct	6 ms	3208 KB	Output is correct
15	Correct	7 ms	3208 KB	Output is correct
16	Correct	8 ms	3208 KB	Output is correct
17	Correct	6 ms	3208 KB	Output is correct
18	Correct	7 ms	3308 KB	Output is correct
19	Correct	8 ms	3308 KB	Output is correct
20	Correct	7 ms	3308 KB	Output is correct
21	Correct	6 ms	3308 KB	Output is correct
22	Correct	6 ms	3308 KB	Output is correct
23	Correct	6 ms	3308 KB	Output is correct
24	Correct	6 ms	3308 KB	Output is correct
25	Correct	8 ms	3308 KB	Output is correct
26	Correct	6 ms	3308 KB	Output is correct
27	Correct	6 ms	3308 KB	Output is correct
28	Correct	6 ms	3308 KB	Output is correct
29	Correct	8 ms	3372 KB	Output is correct
30	Correct	7 ms	3372 KB	Output is correct
31	Correct	8 ms	3372 KB	Output is correct
32	Correct	37 ms	3372 KB	Output is correct
33	Correct	7 ms	3372 KB	Output is correct
34	Correct	7 ms	3372 KB	Output is correct
35	Correct	6 ms	3372 KB	Output is correct
36	Correct	38 ms	3372 KB	Output is correct
37	Correct	7 ms	3372 KB	Output is correct
38	Correct	6 ms	3372 KB	Output is correct
39	Correct	6 ms	3372 KB	Output is correct
40	Correct	8 ms	3372 KB	Output is correct
41	Correct	9 ms	3372 KB	Output is correct
42	Correct	7 ms	3372 KB	Output is correct
43	Correct	6 ms	3372 KB	Output is correct
44	Correct	5 ms	3372 KB	Output is correct
45	Correct	9 ms	3376 KB	Output is correct
46	Correct	28 ms	3904 KB	Output is correct
47	Correct	31 ms	3980 KB	Output is correct
48	Correct	25 ms	4160 KB	Output is correct
49	Correct	16 ms	4292 KB	Output is correct
50	Correct	20 ms	4484 KB	Output is correct
51	Correct	18 ms	4576 KB	Output is correct
52	Correct	29 ms	4576 KB	Output is correct
53	Correct	26 ms	4596 KB	Output is correct
54	Correct	35 ms	4664 KB	Output is correct
55	Correct	25 ms	4860 KB	Output is correct
56	Correct	23 ms	4860 KB	Output is correct
57	Correct	44 ms	4860 KB	Output is correct
58	Correct	39 ms	4860 KB	Output is correct
59	Correct	44 ms	4928 KB	Output is correct
60	Correct	44 ms	5032 KB	Output is correct
61	Correct	24 ms	5128 KB	Output is correct
62	Correct	25 ms	5316 KB	Output is correct
63	Correct	27 ms	5392 KB	Output is correct
64	Correct	26 ms	5392 KB	Output is correct
65	Correct	27 ms	5392 KB	Output is correct
66	Correct	28 ms	5432 KB	Output is correct
67	Correct	24 ms	5432 KB	Output is correct
68	Correct	19 ms	5616 KB	Output is correct
69	Correct	23 ms	5664 KB	Output is correct
70	Correct	24 ms	5848 KB	Output is correct
71	Correct	27 ms	5848 KB	Output is correct
72	Correct	42 ms	5848 KB	Output is correct
73	Correct	45 ms	5848 KB	Output is correct
74	Correct	27 ms	5848 KB	Output is correct
75	Correct	26 ms	5968 KB	Output is correct
76	Correct	24 ms	5968 KB	Output is correct
77	Correct	22 ms	5968 KB	Output is correct
78	Correct	25 ms	6056 KB	Output is correct
79	Correct	21 ms	6084 KB	Output is correct
80	Correct	22 ms	6128 KB	Output is correct
81	Correct	23 ms	6176 KB	Output is correct
82	Correct	28 ms	6240 KB	Output is correct
83	Correct	21 ms	6368 KB	Output is correct
84	Correct	22 ms	6368 KB	Output is correct
85	Correct	23 ms	6464 KB	Output is correct
86	Correct	22 ms	6464 KB	Output is correct

Subtask #3
0 / 84.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2936 KB	Output is correct
2	Correct	5 ms	2936 KB	Output is correct
3	Correct	4 ms	2936 KB	Output is correct
4	Correct	5 ms	3000 KB	Output is correct
5	Correct	8 ms	3136 KB	Output is correct
6	Correct	7 ms	3136 KB	Output is correct
7	Correct	6 ms	3136 KB	Output is correct
8	Correct	6 ms	3208 KB	Output is correct
9	Correct	6 ms	3208 KB	Output is correct
10	Correct	7 ms	3208 KB	Output is correct
11	Correct	7 ms	3208 KB	Output is correct
12	Correct	7 ms	3208 KB	Output is correct
13	Correct	8 ms	3208 KB	Output is correct
14	Correct	6 ms	3208 KB	Output is correct
15	Correct	7 ms	3208 KB	Output is correct
16	Correct	8 ms	3208 KB	Output is correct
17	Correct	6 ms	3208 KB	Output is correct
18	Correct	7 ms	3308 KB	Output is correct
19	Correct	8 ms	3308 KB	Output is correct
20	Correct	7 ms	3308 KB	Output is correct
21	Correct	6 ms	3308 KB	Output is correct
22	Correct	6 ms	3308 KB	Output is correct
23	Correct	6 ms	3308 KB	Output is correct
24	Correct	6 ms	3308 KB	Output is correct
25	Correct	8 ms	3308 KB	Output is correct
26	Correct	6 ms	3308 KB	Output is correct
27	Correct	6 ms	3308 KB	Output is correct
28	Correct	6 ms	3308 KB	Output is correct
29	Correct	8 ms	3372 KB	Output is correct
30	Correct	7 ms	3372 KB	Output is correct
31	Correct	8 ms	3372 KB	Output is correct
32	Correct	37 ms	3372 KB	Output is correct
33	Correct	7 ms	3372 KB	Output is correct
34	Correct	7 ms	3372 KB	Output is correct
35	Correct	6 ms	3372 KB	Output is correct
36	Correct	38 ms	3372 KB	Output is correct
37	Correct	7 ms	3372 KB	Output is correct
38	Correct	6 ms	3372 KB	Output is correct
39	Correct	6 ms	3372 KB	Output is correct
40	Correct	8 ms	3372 KB	Output is correct
41	Correct	9 ms	3372 KB	Output is correct
42	Correct	7 ms	3372 KB	Output is correct
43	Correct	6 ms	3372 KB	Output is correct
44	Correct	5 ms	3372 KB	Output is correct
45	Correct	9 ms	3376 KB	Output is correct
46	Correct	28 ms	3904 KB	Output is correct
47	Correct	31 ms	3980 KB	Output is correct
48	Correct	25 ms	4160 KB	Output is correct
49	Correct	16 ms	4292 KB	Output is correct
50	Correct	20 ms	4484 KB	Output is correct
51	Correct	18 ms	4576 KB	Output is correct
52	Correct	29 ms	4576 KB	Output is correct
53	Correct	26 ms	4596 KB	Output is correct
54	Correct	35 ms	4664 KB	Output is correct
55	Correct	25 ms	4860 KB	Output is correct
56	Correct	23 ms	4860 KB	Output is correct
57	Correct	44 ms	4860 KB	Output is correct
58	Correct	39 ms	4860 KB	Output is correct
59	Correct	44 ms	4928 KB	Output is correct
60	Correct	44 ms	5032 KB	Output is correct
61	Correct	24 ms	5128 KB	Output is correct
62	Correct	25 ms	5316 KB	Output is correct
63	Correct	27 ms	5392 KB	Output is correct
64	Correct	26 ms	5392 KB	Output is correct
65	Correct	27 ms	5392 KB	Output is correct
66	Correct	28 ms	5432 KB	Output is correct
67	Correct	24 ms	5432 KB	Output is correct
68	Correct	19 ms	5616 KB	Output is correct
69	Correct	23 ms	5664 KB	Output is correct
70	Correct	24 ms	5848 KB	Output is correct
71	Correct	27 ms	5848 KB	Output is correct
72	Correct	42 ms	5848 KB	Output is correct
73	Correct	45 ms	5848 KB	Output is correct
74	Correct	27 ms	5848 KB	Output is correct
75	Correct	26 ms	5968 KB	Output is correct
76	Correct	24 ms	5968 KB	Output is correct
77	Correct	22 ms	5968 KB	Output is correct
78	Correct	25 ms	6056 KB	Output is correct
79	Correct	21 ms	6084 KB	Output is correct
80	Correct	22 ms	6128 KB	Output is correct
81	Correct	23 ms	6176 KB	Output is correct
82	Correct	28 ms	6240 KB	Output is correct
83	Correct	21 ms	6368 KB	Output is correct
84	Correct	22 ms	6368 KB	Output is correct
85	Correct	23 ms	6464 KB	Output is correct
86	Correct	22 ms	6464 KB	Output is correct
87	Correct	82 ms	7656 KB	Output is correct
88	Correct	311 ms	11312 KB	Output is correct
89	Correct	1455 ms	21764 KB	Output is correct
90	Correct	1437 ms	21804 KB	Output is correct
91	Correct	1380 ms	21804 KB	Output is correct
92	Correct	988 ms	25860 KB	Output is correct
93	Correct	874 ms	27992 KB	Output is correct
94	Correct	734 ms	29368 KB	Output is correct
95	Correct	1260 ms	29368 KB	Output is correct
96	Correct	1339 ms	29368 KB	Output is correct
97	Correct	1159 ms	29368 KB	Output is correct
98	Correct	1272 ms	29368 KB	Output is correct
99	Correct	1302 ms	29368 KB	Output is correct
100	Execution timed out	2055 ms	29368 KB	Time limit exceeded
101	Halted	0 ms	0 KB	-

답안 #62552

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 9.0 / 9.0

Subtask #3 0 / 84.0

Subtask #1
7.0 / 7.0

Subtask #2
9.0 / 9.0

Subtask #3
0 / 84.0