oj.uz

Submission #154911

# Submission time Handle Problem Language Result Execution time Memory
154911 2019-09-25T13:03:56 Z leatherman Birthday gift (IZhO18_treearray) C++14
56 / 100
 4000 ms 224836 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define ll long long
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sqr(x) (x)*(x)
#define PB push_back
#define endl "\n"
#define y1 sfsdaf
#define pll pair<ll, ll>
using namespace std;
typedef double ld;
const ll N = 2e5 + 200;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());
ll h[N],ft[N],n,d[N],m,Q,x,y,st[3 * N];
pair<ll, ll> T[3 * N][25];
vector<pair<ll, ll> > a;
vector<ll> v[N];
set<ll> s[N],pisos[N];
set<ll> :: iterator it;
void dfs(ll x,ll y)
{
    h[x] = h[y] + 1;
    T[a.size()][0] = {h[x], x};
    ft[x] = a.size();
    a.PB({h[x], x});
    for(auto to : v[x]) if(!h[to])
    {
        dfs(to, x);
        T[a.size()][0] = {h[x], x};
        a.PB({h[x], x});
    }
}
ll lca(ll a,ll b)
{
    ll l,r,k;
    l = ft[a];
    r = ft[b];
    if(l > r) swap(l, r);
    k = st[r - l + 1];
    return min(T[l][k], T[r - (1 << k) + 1][k]).se;
}
void ins(ll val,ll pos)
{
    s[val].insert(pos);
}
void ers(ll val,ll pos)
{
    if(!s[val].empty() && s[val].find(pos) != s[val].end()) s[val].erase(pos);
}
void build(ll m)
{
    for(int i = 1; i <= m; i++) ins(lca(d[i], d[i + 1]), i);
}
int main()
{
    ios_base::sync_with_stdio();cin.tie(0);cout.tie(0);
    cin>>n>>m>>Q;
    for(int i = 1; i < n; i++)
    {
        cin>>x>>y;
        v[x].PB(y);
        v[y].PB(x);
    }
    dfs(1, 1);
    for(int i = 1; i < 2 * N; i++)
    {
        st[i] = st[i - 1];
        if(1 << (st[i] + 1) <= i) st[i]++;
    }
    for(int j = 1; j < 20; j++)
    {
        x = (1 << (j - 1));
        for(int i = 0; i + x < a.size(); i++) T[i][j] = min(T[i][j - 1], T[i + x][j - 1]);
    }
    for(int i = 1; i <= m; i++)
    {
        cin>>d[i];
        pisos[d[i]].insert(i);
    }
    m--;
    if(m) build(m);
    while(Q--)
    {
        ll t,pos,x,l,r,v;
        cin>>t;
        if(t == 1)
        {
            cin>>pos>>x;
            if(pos <= m) ers(lca(d[pos], d[pos + 1]), pos);
            if(pos - 1 > 0) ers(lca(d[pos - 1], d[pos]), pos - 1);

            pisos[d[pos]].erase(pos);
            d[pos] = x;
            pisos[d[pos]].insert(pos);

            if(pos <= m) ins(lca(d[pos], d[pos + 1]), pos);
            if(pos - 1 > 0) ins(lca(d[pos - 1], d[pos]), pos - 1);
        } else
        {
            cin>>l>>r>>v;
            if(!pisos[v].empty())
            {
                it = lower_bound(all(pisos[v]), l);
                if(it != pisos[v].end()) x = *it;
                else x = 1e9;
                if(x <= r)
                {
                    cout<<x<<" "<<x<<endl;
                    continue;
                }
            }
            if(!s[v].empty())
            {
                it = lower_bound(all(s[v]), l);
                if(it != s[v].end()) x = *it;
                else x = 1e9;
                if(x + 1 <= r)
                {
                    cout<<x<<" "<<x + 1<<endl;
                    continue;
                }
            }
            cout<<"-1 -1"<<endl;
        }
    }
    return 0;
}
/*
1 1 1
1
2 1 1 1
*/

Compilation message

treearray.cpp: In function 'int main()':
treearray.cpp:79:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i + x < a.size(); i++) T[i][j] = min(T[i][j - 1], T[i + x][j - 1]);
                        ~~~~~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27000 KB n=5
2 Correct 29 ms 27128 KB n=100
3 Correct 28 ms 27128 KB n=100
4 Correct 29 ms 27128 KB n=100
5 Correct 29 ms 27128 KB n=100
6 Correct 31 ms 27128 KB n=100
7 Correct 29 ms 27128 KB n=100
8 Correct 29 ms 27052 KB n=100
9 Correct 28 ms 27128 KB n=100
10 Correct 29 ms 27128 KB n=100
11 Correct 29 ms 27128 KB n=100
12 Correct 29 ms 27256 KB n=100
13 Correct 29 ms 27176 KB n=100
14 Correct 29 ms 27128 KB n=100
15 Correct 29 ms 27100 KB n=100
16 Correct 29 ms 27128 KB n=100
17 Correct 29 ms 27128 KB n=100
18 Correct 29 ms 27128 KB n=100
19 Correct 29 ms 27228 KB n=100
20 Correct 29 ms 27084 KB n=100
21 Correct 29 ms 27048 KB n=100
22 Correct 29 ms 27128 KB n=100
23 Correct 29 ms 27116 KB n=100
24 Correct 29 ms 27128 KB n=100
25 Correct 29 ms 27128 KB n=100
26 Correct 29 ms 27000 KB n=12
27 Correct 35 ms 27128 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27000 KB n=5
2 Correct 29 ms 27128 KB n=100
3 Correct 28 ms 27128 KB n=100
4 Correct 29 ms 27128 KB n=100
5 Correct 29 ms 27128 KB n=100
6 Correct 31 ms 27128 KB n=100
7 Correct 29 ms 27128 KB n=100
8 Correct 29 ms 27052 KB n=100
9 Correct 28 ms 27128 KB n=100
10 Correct 29 ms 27128 KB n=100
11 Correct 29 ms 27128 KB n=100
12 Correct 29 ms 27256 KB n=100
13 Correct 29 ms 27176 KB n=100
14 Correct 29 ms 27128 KB n=100
15 Correct 29 ms 27100 KB n=100
16 Correct 29 ms 27128 KB n=100
17 Correct 29 ms 27128 KB n=100
18 Correct 29 ms 27128 KB n=100
19 Correct 29 ms 27228 KB n=100
20 Correct 29 ms 27084 KB n=100
21 Correct 29 ms 27048 KB n=100
22 Correct 29 ms 27128 KB n=100
23 Correct 29 ms 27116 KB n=100
24 Correct 29 ms 27128 KB n=100
25 Correct 29 ms 27128 KB n=100
26 Correct 29 ms 27000 KB n=12
27 Correct 35 ms 27128 KB n=100
28 Correct 32 ms 27512 KB n=500
29 Correct 31 ms 27640 KB n=500
30 Correct 30 ms 27468 KB n=500
31 Correct 31 ms 27512 KB n=500
32 Correct 33 ms 27508 KB n=500
33 Correct 30 ms 27512 KB n=500
34 Correct 32 ms 27488 KB n=500
35 Correct 30 ms 27512 KB n=500
36 Correct 31 ms 27468 KB n=500
37 Correct 31 ms 27556 KB n=500
38 Correct 35 ms 27488 KB n=500
39 Correct 30 ms 27484 KB n=500
40 Correct 30 ms 27400 KB n=500
41 Correct 31 ms 27644 KB n=500
42 Correct 31 ms 27512 KB n=500
43 Correct 30 ms 27512 KB n=500
44 Correct 30 ms 27512 KB n=500
45 Correct 31 ms 27456 KB n=500
46 Correct 31 ms 27640 KB n=500
47 Correct 31 ms 27512 KB n=500
48 Correct 31 ms 27512 KB n=500
49 Correct 30 ms 27512 KB n=500
50 Correct 30 ms 27472 KB n=500
51 Correct 30 ms 27512 KB n=500
52 Correct 30 ms 27512 KB n=500
53 Correct 30 ms 27512 KB n=500
54 Correct 30 ms 27500 KB n=500
55 Correct 29 ms 27384 KB n=278
56 Correct 30 ms 27520 KB n=500
57 Correct 30 ms 27512 KB n=500
58 Correct 30 ms 27472 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27000 KB n=5
2 Correct 29 ms 27128 KB n=100
3 Correct 28 ms 27128 KB n=100
4 Correct 29 ms 27128 KB n=100
5 Correct 29 ms 27128 KB n=100
6 Correct 31 ms 27128 KB n=100
7 Correct 29 ms 27128 KB n=100
8 Correct 29 ms 27052 KB n=100
9 Correct 28 ms 27128 KB n=100
10 Correct 29 ms 27128 KB n=100
11 Correct 29 ms 27128 KB n=100
12 Correct 29 ms 27256 KB n=100
13 Correct 29 ms 27176 KB n=100
14 Correct 29 ms 27128 KB n=100
15 Correct 29 ms 27100 KB n=100
16 Correct 29 ms 27128 KB n=100
17 Correct 29 ms 27128 KB n=100
18 Correct 29 ms 27128 KB n=100
19 Correct 29 ms 27228 KB n=100
20 Correct 29 ms 27084 KB n=100
21 Correct 29 ms 27048 KB n=100
22 Correct 29 ms 27128 KB n=100
23 Correct 29 ms 27116 KB n=100
24 Correct 29 ms 27128 KB n=100
25 Correct 29 ms 27128 KB n=100
26 Correct 29 ms 27000 KB n=12
27 Correct 35 ms 27128 KB n=100
28 Correct 32 ms 27512 KB n=500
29 Correct 31 ms 27640 KB n=500
30 Correct 30 ms 27468 KB n=500
31 Correct 31 ms 27512 KB n=500
32 Correct 33 ms 27508 KB n=500
33 Correct 30 ms 27512 KB n=500
34 Correct 32 ms 27488 KB n=500
35 Correct 30 ms 27512 KB n=500
36 Correct 31 ms 27468 KB n=500
37 Correct 31 ms 27556 KB n=500
38 Correct 35 ms 27488 KB n=500
39 Correct 30 ms 27484 KB n=500
40 Correct 30 ms 27400 KB n=500
41 Correct 31 ms 27644 KB n=500
42 Correct 31 ms 27512 KB n=500
43 Correct 30 ms 27512 KB n=500
44 Correct 30 ms 27512 KB n=500
45 Correct 31 ms 27456 KB n=500
46 Correct 31 ms 27640 KB n=500
47 Correct 31 ms 27512 KB n=500
48 Correct 31 ms 27512 KB n=500
49 Correct 30 ms 27512 KB n=500
50 Correct 30 ms 27472 KB n=500
51 Correct 30 ms 27512 KB n=500
52 Correct 30 ms 27512 KB n=500
53 Correct 30 ms 27512 KB n=500
54 Correct 30 ms 27500 KB n=500
55 Correct 29 ms 27384 KB n=278
56 Correct 30 ms 27520 KB n=500
57 Correct 30 ms 27512 KB n=500
58 Correct 30 ms 27472 KB n=500
59 Correct 58 ms 29020 KB n=2000
60 Correct 38 ms 29176 KB n=2000
61 Correct 38 ms 29048 KB n=2000
62 Correct 38 ms 29048 KB n=2000
63 Correct 69 ms 29048 KB n=2000
64 Correct 38 ms 29176 KB n=2000
65 Correct 72 ms 29076 KB n=2000
66 Correct 45 ms 29048 KB n=2000
67 Correct 53 ms 29048 KB n=2000
68 Correct 38 ms 29068 KB n=2000
69 Correct 37 ms 29048 KB n=2000
70 Correct 41 ms 29048 KB n=2000
71 Correct 37 ms 29048 KB n=2000
72 Correct 37 ms 29048 KB n=2000
73 Correct 36 ms 29048 KB n=2000
74 Correct 58 ms 29052 KB n=1844
75 Correct 37 ms 29048 KB n=2000
76 Correct 38 ms 29048 KB n=2000
77 Correct 38 ms 28920 KB n=2000
78 Correct 38 ms 29048 KB n=2000
79 Correct 50 ms 29020 KB n=2000
80 Correct 37 ms 29048 KB n=2000
81 Correct 38 ms 29052 KB n=2000
82 Correct 51 ms 28920 KB n=2000
83 Correct 38 ms 29048 KB n=2000
84 Correct 38 ms 29048 KB n=2000
85 Correct 38 ms 29048 KB n=2000
86 Correct 38 ms 29052 KB n=2000
87 Correct 38 ms 29048 KB n=2000
88 Correct 37 ms 29176 KB n=2000
89 Correct 37 ms 29180 KB n=2000
90 Correct 37 ms 29176 KB n=2000
91 Correct 37 ms 29048 KB n=2000

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27000 KB n=5
2 Correct 29 ms 27128 KB n=100
3 Correct 28 ms 27128 KB n=100
4 Correct 29 ms 27128 KB n=100
5 Correct 29 ms 27128 KB n=100
6 Correct 31 ms 27128 KB n=100
7 Correct 29 ms 27128 KB n=100
8 Correct 29 ms 27052 KB n=100
9 Correct 28 ms 27128 KB n=100
10 Correct 29 ms 27128 KB n=100
11 Correct 29 ms 27128 KB n=100
12 Correct 29 ms 27256 KB n=100
13 Correct 29 ms 27176 KB n=100
14 Correct 29 ms 27128 KB n=100
15 Correct 29 ms 27100 KB n=100
16 Correct 29 ms 27128 KB n=100
17 Correct 29 ms 27128 KB n=100
18 Correct 29 ms 27128 KB n=100
19 Correct 29 ms 27228 KB n=100
20 Correct 29 ms 27084 KB n=100
21 Correct 29 ms 27048 KB n=100
22 Correct 29 ms 27128 KB n=100
23 Correct 29 ms 27116 KB n=100
24 Correct 29 ms 27128 KB n=100
25 Correct 29 ms 27128 KB n=100
26 Correct 29 ms 27000 KB n=12
27 Correct 35 ms 27128 KB n=100
28 Correct 32 ms 27512 KB n=500
29 Correct 31 ms 27640 KB n=500
30 Correct 30 ms 27468 KB n=500
31 Correct 31 ms 27512 KB n=500
32 Correct 33 ms 27508 KB n=500
33 Correct 30 ms 27512 KB n=500
34 Correct 32 ms 27488 KB n=500
35 Correct 30 ms 27512 KB n=500
36 Correct 31 ms 27468 KB n=500
37 Correct 31 ms 27556 KB n=500
38 Correct 35 ms 27488 KB n=500
39 Correct 30 ms 27484 KB n=500
40 Correct 30 ms 27400 KB n=500
41 Correct 31 ms 27644 KB n=500
42 Correct 31 ms 27512 KB n=500
43 Correct 30 ms 27512 KB n=500
44 Correct 30 ms 27512 KB n=500
45 Correct 31 ms 27456 KB n=500
46 Correct 31 ms 27640 KB n=500
47 Correct 31 ms 27512 KB n=500
48 Correct 31 ms 27512 KB n=500
49 Correct 30 ms 27512 KB n=500
50 Correct 30 ms 27472 KB n=500
51 Correct 30 ms 27512 KB n=500
52 Correct 30 ms 27512 KB n=500
53 Correct 30 ms 27512 KB n=500
54 Correct 30 ms 27500 KB n=500
55 Correct 29 ms 27384 KB n=278
56 Correct 30 ms 27520 KB n=500
57 Correct 30 ms 27512 KB n=500
58 Correct 30 ms 27472 KB n=500
59 Correct 58 ms 29020 KB n=2000
60 Correct 38 ms 29176 KB n=2000
61 Correct 38 ms 29048 KB n=2000
62 Correct 38 ms 29048 KB n=2000
63 Correct 69 ms 29048 KB n=2000
64 Correct 38 ms 29176 KB n=2000
65 Correct 72 ms 29076 KB n=2000
66 Correct 45 ms 29048 KB n=2000
67 Correct 53 ms 29048 KB n=2000
68 Correct 38 ms 29068 KB n=2000
69 Correct 37 ms 29048 KB n=2000
70 Correct 41 ms 29048 KB n=2000
71 Correct 37 ms 29048 KB n=2000
72 Correct 37 ms 29048 KB n=2000
73 Correct 36 ms 29048 KB n=2000
74 Correct 58 ms 29052 KB n=1844
75 Correct 37 ms 29048 KB n=2000
76 Correct 38 ms 29048 KB n=2000
77 Correct 38 ms 28920 KB n=2000
78 Correct 38 ms 29048 KB n=2000
79 Correct 50 ms 29020 KB n=2000
80 Correct 37 ms 29048 KB n=2000
81 Correct 38 ms 29052 KB n=2000
82 Correct 51 ms 28920 KB n=2000
83 Correct 38 ms 29048 KB n=2000
84 Correct 38 ms 29048 KB n=2000
85 Correct 38 ms 29048 KB n=2000
86 Correct 38 ms 29052 KB n=2000
87 Correct 38 ms 29048 KB n=2000
88 Correct 37 ms 29176 KB n=2000
89 Correct 37 ms 29180 KB n=2000
90 Correct 37 ms 29176 KB n=2000
91 Correct 37 ms 29048 KB n=2000
92 Execution timed out 4113 ms 224836 KB Time limit exceeded
93 Halted 0 ms 0 KB -