oj.uz

Submission #471040

# Submission time Handle Problem Language Result Execution time Memory
471040 2021-09-06T19:46:01 Z Carmel_Ab1 Birthday gift (IZhO18_treearray) C++17
100 / 100
 1383 ms 91864 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

int n,m,q;
vvi g;
vvi up;
vi dep;
void dfs1(int src,int par){
    if(par!=-1)
        dep[src]=dep[par]+1;
    up[src][0]=par;
    for(int nbr:g[src])
        if(nbr!=par)
            dfs1(nbr,src);
}
int get(int x,int k){
    for(int i=0;x!=-1 && i<20 && k ; i++){
        if(k&(1<<i)){
            x=up[x][i];
            k-=(1<<i);
        }
    }
    return x;
}
int lca(int x,int y){

    assert(x || y);
    if(!x)return y;
    else if(!y)return x;

    if(dep[x]>dep[y])
        swap(x,y);
    //x<=y
    y=get(y,dep[y]-dep[x]);
    for(int i=19;x!=y && 0<=i; i--)
        if(up[x][i]!=up[y][i]){
            x=up[x][i];
            y=up[y][i];
        }
    if(x==y)return x;
    return up[x][0];
}


void solve() {
    cin >> n >> m>> q;
    g.resize(n+1);
    for(int i=0; i<n-1; i++){
        int u,v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    dep.resize(n+1);
    up.resize(n+1,vi(20,-1));
    dfs1(1,-1);

    for(int j=1; j<20; j++)
        for(int i=1; i<=n; i++)
            if(up[i][j-1]!=-1)
                up[i][j]=up[up[i][j-1]][j-1];
    vi a(m+1);
    for(int i=1; i<=m; i++)
        cin >> a[i];

    vector<set<int>>who1(n+1),who2(n+1);
    for(int i=1; i<=m; i++)
        who1[a[i]].insert(i);
    for(int i=1; i<m; i++)
        who2[lca(a[i],a[i+1])].insert(i);

    while(q--){
        int op;
        cin >> op;
        if(op==1){
            int i,v;

            cin >> i >> v;

            who1[a[i]].erase(i);
            who1[v].insert(i);

            if(i!=1)
                who2[lca(a[i],a[i-1])].erase(i-1);
            if(i!=m)
                who2[lca(a[i],a[i+1])].erase(i);

            if(i!=1)
                who2[lca(a[i-1],v)].insert(i-1);
            if(i!=m)
                who2[lca(v,a[i+1])].insert(i);

            a[i]=v;
            continue;
        }
        int l,r,v;
        cin >> l >> r >> v;

        pi ans={-1,-1};
        if(who1[v].lower_bound(l)!=who1[v].end() && *who1[v].lower_bound(l)<=r)
            ans={*who1[v].lower_bound(l),*who1[v].lower_bound(l)};
        else if(who2[v].lower_bound(l)!=who2[v].end() && *who2[v].lower_bound(l)<r)
            ans={*who2[v].lower_bound(l),*who2[v].lower_bound(l)+1};
        cout << ans << "\n";
    }
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
 */

Compilation message

treearray.cpp: In function 'void usaco(std::string)':
treearray.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
treearray.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n=5
2 Correct 1 ms 332 KB n=100
3 Correct 1 ms 332 KB n=100
4 Correct 1 ms 332 KB n=100
5 Correct 1 ms 332 KB n=100
6 Correct 1 ms 332 KB n=100
7 Correct 1 ms 332 KB n=100
8 Correct 1 ms 332 KB n=100
9 Correct 1 ms 332 KB n=100
10 Correct 1 ms 332 KB n=100
11 Correct 1 ms 332 KB n=100
12 Correct 1 ms 332 KB n=100
13 Correct 1 ms 332 KB n=100
14 Correct 1 ms 332 KB n=100
15 Correct 1 ms 332 KB n=100
16 Correct 1 ms 332 KB n=100
17 Correct 1 ms 332 KB n=100
18 Correct 1 ms 332 KB n=100
19 Correct 1 ms 332 KB n=100
20 Correct 1 ms 332 KB n=100
21 Correct 1 ms 332 KB n=100
22 Correct 1 ms 332 KB n=100
23 Correct 1 ms 332 KB n=100
24 Correct 1 ms 332 KB n=100
25 Correct 1 ms 332 KB n=100
26 Correct 0 ms 204 KB n=12
27 Correct 1 ms 332 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n=5
2 Correct 1 ms 332 KB n=100
3 Correct 1 ms 332 KB n=100
4 Correct 1 ms 332 KB n=100
5 Correct 1 ms 332 KB n=100
6 Correct 1 ms 332 KB n=100
7 Correct 1 ms 332 KB n=100
8 Correct 1 ms 332 KB n=100
9 Correct 1 ms 332 KB n=100
10 Correct 1 ms 332 KB n=100
11 Correct 1 ms 332 KB n=100
12 Correct 1 ms 332 KB n=100
13 Correct 1 ms 332 KB n=100
14 Correct 1 ms 332 KB n=100
15 Correct 1 ms 332 KB n=100
16 Correct 1 ms 332 KB n=100
17 Correct 1 ms 332 KB n=100
18 Correct 1 ms 332 KB n=100
19 Correct 1 ms 332 KB n=100
20 Correct 1 ms 332 KB n=100
21 Correct 1 ms 332 KB n=100
22 Correct 1 ms 332 KB n=100
23 Correct 1 ms 332 KB n=100
24 Correct 1 ms 332 KB n=100
25 Correct 1 ms 332 KB n=100
26 Correct 0 ms 204 KB n=12
27 Correct 1 ms 332 KB n=100
28 Correct 1 ms 460 KB n=500
29 Correct 2 ms 460 KB n=500
30 Correct 1 ms 460 KB n=500
31 Correct 1 ms 460 KB n=500
32 Correct 1 ms 460 KB n=500
33 Correct 1 ms 460 KB n=500
34 Correct 1 ms 460 KB n=500
35 Correct 1 ms 460 KB n=500
36 Correct 1 ms 460 KB n=500
37 Correct 1 ms 460 KB n=500
38 Correct 1 ms 460 KB n=500
39 Correct 1 ms 460 KB n=500
40 Correct 1 ms 460 KB n=500
41 Correct 1 ms 460 KB n=500
42 Correct 1 ms 460 KB n=500
43 Correct 1 ms 460 KB n=500
44 Correct 1 ms 460 KB n=500
45 Correct 1 ms 460 KB n=500
46 Correct 1 ms 460 KB n=500
47 Correct 1 ms 460 KB n=500
48 Correct 1 ms 460 KB n=500
49 Correct 1 ms 460 KB n=500
50 Correct 1 ms 460 KB n=500
51 Correct 1 ms 460 KB n=500
52 Correct 1 ms 460 KB n=500
53 Correct 1 ms 460 KB n=500
54 Correct 1 ms 460 KB n=500
55 Correct 1 ms 332 KB n=278
56 Correct 1 ms 460 KB n=500
57 Correct 1 ms 460 KB n=500
58 Correct 1 ms 460 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n=5
2 Correct 1 ms 332 KB n=100
3 Correct 1 ms 332 KB n=100
4 Correct 1 ms 332 KB n=100
5 Correct 1 ms 332 KB n=100
6 Correct 1 ms 332 KB n=100
7 Correct 1 ms 332 KB n=100
8 Correct 1 ms 332 KB n=100
9 Correct 1 ms 332 KB n=100
10 Correct 1 ms 332 KB n=100
11 Correct 1 ms 332 KB n=100
12 Correct 1 ms 332 KB n=100
13 Correct 1 ms 332 KB n=100
14 Correct 1 ms 332 KB n=100
15 Correct 1 ms 332 KB n=100
16 Correct 1 ms 332 KB n=100
17 Correct 1 ms 332 KB n=100
18 Correct 1 ms 332 KB n=100
19 Correct 1 ms 332 KB n=100
20 Correct 1 ms 332 KB n=100
21 Correct 1 ms 332 KB n=100
22 Correct 1 ms 332 KB n=100
23 Correct 1 ms 332 KB n=100
24 Correct 1 ms 332 KB n=100
25 Correct 1 ms 332 KB n=100
26 Correct 0 ms 204 KB n=12
27 Correct 1 ms 332 KB n=100
28 Correct 1 ms 460 KB n=500
29 Correct 2 ms 460 KB n=500
30 Correct 1 ms 460 KB n=500
31 Correct 1 ms 460 KB n=500
32 Correct 1 ms 460 KB n=500
33 Correct 1 ms 460 KB n=500
34 Correct 1 ms 460 KB n=500
35 Correct 1 ms 460 KB n=500
36 Correct 1 ms 460 KB n=500
37 Correct 1 ms 460 KB n=500
38 Correct 1 ms 460 KB n=500
39 Correct 1 ms 460 KB n=500
40 Correct 1 ms 460 KB n=500
41 Correct 1 ms 460 KB n=500
42 Correct 1 ms 460 KB n=500
43 Correct 1 ms 460 KB n=500
44 Correct 1 ms 460 KB n=500
45 Correct 1 ms 460 KB n=500
46 Correct 1 ms 460 KB n=500
47 Correct 1 ms 460 KB n=500
48 Correct 1 ms 460 KB n=500
49 Correct 1 ms 460 KB n=500
50 Correct 1 ms 460 KB n=500
51 Correct 1 ms 460 KB n=500
52 Correct 1 ms 460 KB n=500
53 Correct 1 ms 460 KB n=500
54 Correct 1 ms 460 KB n=500
55 Correct 1 ms 332 KB n=278
56 Correct 1 ms 460 KB n=500
57 Correct 1 ms 460 KB n=500
58 Correct 1 ms 460 KB n=500
59 Correct 5 ms 972 KB n=2000
60 Correct 5 ms 1076 KB n=2000
61 Correct 4 ms 1100 KB n=2000
62 Correct 5 ms 972 KB n=2000
63 Correct 4 ms 972 KB n=2000
64 Correct 4 ms 972 KB n=2000
65 Correct 4 ms 972 KB n=2000
66 Correct 4 ms 1036 KB n=2000
67 Correct 5 ms 972 KB n=2000
68 Correct 4 ms 1100 KB n=2000
69 Correct 4 ms 972 KB n=2000
70 Correct 3 ms 972 KB n=2000
71 Correct 4 ms 972 KB n=2000
72 Correct 4 ms 972 KB n=2000
73 Correct 3 ms 972 KB n=2000
74 Correct 4 ms 972 KB n=1844
75 Correct 3 ms 972 KB n=2000
76 Correct 5 ms 972 KB n=2000
77 Correct 4 ms 972 KB n=2000
78 Correct 4 ms 972 KB n=2000
79 Correct 4 ms 972 KB n=2000
80 Correct 4 ms 1100 KB n=2000
81 Correct 5 ms 972 KB n=2000
82 Correct 5 ms 972 KB n=2000
83 Correct 4 ms 1108 KB n=2000
84 Correct 4 ms 972 KB n=2000
85 Correct 4 ms 972 KB n=2000
86 Correct 5 ms 972 KB n=2000
87 Correct 4 ms 972 KB n=2000
88 Correct 4 ms 1144 KB n=2000
89 Correct 4 ms 1100 KB n=2000
90 Correct 4 ms 1100 KB n=2000
91 Correct 4 ms 972 KB n=2000

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB n=5
2 Correct 1 ms 332 KB n=100
3 Correct 1 ms 332 KB n=100
4 Correct 1 ms 332 KB n=100
5 Correct 1 ms 332 KB n=100
6 Correct 1 ms 332 KB n=100
7 Correct 1 ms 332 KB n=100
8 Correct 1 ms 332 KB n=100
9 Correct 1 ms 332 KB n=100
10 Correct 1 ms 332 KB n=100
11 Correct 1 ms 332 KB n=100
12 Correct 1 ms 332 KB n=100
13 Correct 1 ms 332 KB n=100
14 Correct 1 ms 332 KB n=100
15 Correct 1 ms 332 KB n=100
16 Correct 1 ms 332 KB n=100
17 Correct 1 ms 332 KB n=100
18 Correct 1 ms 332 KB n=100
19 Correct 1 ms 332 KB n=100
20 Correct 1 ms 332 KB n=100
21 Correct 1 ms 332 KB n=100
22 Correct 1 ms 332 KB n=100
23 Correct 1 ms 332 KB n=100
24 Correct 1 ms 332 KB n=100
25 Correct 1 ms 332 KB n=100
26 Correct 0 ms 204 KB n=12
27 Correct 1 ms 332 KB n=100
28 Correct 1 ms 460 KB n=500
29 Correct 2 ms 460 KB n=500
30 Correct 1 ms 460 KB n=500
31 Correct 1 ms 460 KB n=500
32 Correct 1 ms 460 KB n=500
33 Correct 1 ms 460 KB n=500
34 Correct 1 ms 460 KB n=500
35 Correct 1 ms 460 KB n=500
36 Correct 1 ms 460 KB n=500
37 Correct 1 ms 460 KB n=500
38 Correct 1 ms 460 KB n=500
39 Correct 1 ms 460 KB n=500
40 Correct 1 ms 460 KB n=500
41 Correct 1 ms 460 KB n=500
42 Correct 1 ms 460 KB n=500
43 Correct 1 ms 460 KB n=500
44 Correct 1 ms 460 KB n=500
45 Correct 1 ms 460 KB n=500
46 Correct 1 ms 460 KB n=500
47 Correct 1 ms 460 KB n=500
48 Correct 1 ms 460 KB n=500
49 Correct 1 ms 460 KB n=500
50 Correct 1 ms 460 KB n=500
51 Correct 1 ms 460 KB n=500
52 Correct 1 ms 460 KB n=500
53 Correct 1 ms 460 KB n=500
54 Correct 1 ms 460 KB n=500
55 Correct 1 ms 332 KB n=278
56 Correct 1 ms 460 KB n=500
57 Correct 1 ms 460 KB n=500
58 Correct 1 ms 460 KB n=500
59 Correct 5 ms 972 KB n=2000
60 Correct 5 ms 1076 KB n=2000
61 Correct 4 ms 1100 KB n=2000
62 Correct 5 ms 972 KB n=2000
63 Correct 4 ms 972 KB n=2000
64 Correct 4 ms 972 KB n=2000
65 Correct 4 ms 972 KB n=2000
66 Correct 4 ms 1036 KB n=2000
67 Correct 5 ms 972 KB n=2000
68 Correct 4 ms 1100 KB n=2000
69 Correct 4 ms 972 KB n=2000
70 Correct 3 ms 972 KB n=2000
71 Correct 4 ms 972 KB n=2000
72 Correct 4 ms 972 KB n=2000
73 Correct 3 ms 972 KB n=2000
74 Correct 4 ms 972 KB n=1844
75 Correct 3 ms 972 KB n=2000
76 Correct 5 ms 972 KB n=2000
77 Correct 4 ms 972 KB n=2000
78 Correct 4 ms 972 KB n=2000
79 Correct 4 ms 972 KB n=2000
80 Correct 4 ms 1100 KB n=2000
81 Correct 5 ms 972 KB n=2000
82 Correct 5 ms 972 KB n=2000
83 Correct 4 ms 1108 KB n=2000
84 Correct 4 ms 972 KB n=2000
85 Correct 4 ms 972 KB n=2000
86 Correct 5 ms 972 KB n=2000
87 Correct 4 ms 972 KB n=2000
88 Correct 4 ms 1144 KB n=2000
89 Correct 4 ms 1100 KB n=2000
90 Correct 4 ms 1100 KB n=2000
91 Correct 4 ms 972 KB n=2000
92 Correct 767 ms 78872 KB n=200000
93 Correct 1306 ms 87168 KB n=200000
94 Correct 1282 ms 90572 KB n=200000
95 Correct 746 ms 82232 KB n=200000
96 Correct 708 ms 82268 KB n=200000
97 Correct 1339 ms 86320 KB n=200000
98 Correct 738 ms 82228 KB n=200000
99 Correct 1008 ms 82620 KB n=200000
100 Correct 761 ms 82156 KB n=200000
101 Correct 1361 ms 91864 KB n=200000
102 Correct 517 ms 83396 KB n=200000
103 Correct 555 ms 83528 KB n=200000
104 Correct 515 ms 83372 KB n=200000
105 Correct 509 ms 83688 KB n=200000
106 Correct 502 ms 83780 KB n=200000
107 Correct 516 ms 83828 KB n=200000
108 Correct 903 ms 82348 KB n=200000
109 Correct 898 ms 82344 KB n=200000
110 Correct 942 ms 82280 KB n=200000
111 Correct 760 ms 81780 KB n=200000
112 Correct 1305 ms 91204 KB n=200000
113 Correct 1340 ms 86340 KB n=200000
114 Correct 780 ms 81712 KB n=200000
115 Correct 1383 ms 84252 KB n=200000
116 Correct 727 ms 82300 KB n=200000
117 Correct 1334 ms 91244 KB n=200000
118 Correct 1358 ms 85192 KB n=200000
119 Correct 714 ms 82284 KB n=200000
120 Correct 1239 ms 90936 KB n=200000
121 Correct 1234 ms 90832 KB n=200000
122 Correct 1272 ms 91148 KB n=200000
123 Correct 519 ms 83592 KB n=200000
124 Correct 241 ms 19140 KB n=25264