oj.uz

답안 #334819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334819 2020-12-10T04:07:19 Z talant117408 Birthday gift (IZhO18_treearray) C++17
12 / 100
 4000 ms 5212 KB 
/*
    Code written by Talant I.D.
*/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

//using namespace __gnu_pbds;
using namespace std;

//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 2e5+7;
vector <vector <int>> graph(N);
int tree[N*4], vec[N], tin[N], tout[N], timer, up[N][20];

inline void dfs(int v, int p = 1){
    tin[v] = ++timer;
    up[v][0] = p;
    for(int i = 1; i < 20; i++) up[v][i] = up[up[v][i-1]][i-1];
    
    for(auto to : graph[v]){
        if(to != p){
            dfs(to, v);
        }
    }
    tout[v] = ++timer;
}

inline bool upper(int a, int b){
    return tin[a] <= tin[b] && tout[a] >= tout[b];
}

inline int lca(int a, int b){
    if(upper(a, b)) return a;
    if(upper(b, a)) return b;
    for(int i = 19; i >= 0; i--){
        if(!upper(up[a][i], b)) a = up[a][i];
    }
    return up[a][0];
}

inline void build(int v, int l, int r){
    if(l == r){
        tree[v] = vec[l];
        return ;
    }
    int mid = (l+r) >> 1;
    build(v*2, l, mid);
    build(v*2+1, mid+1, r);
    tree[v] = lca(tree[v*2], tree[v*2+1]);
}

inline int get(int v, int l, int r, int ql, int qr){
    if(r < ql || qr < l) return -1;
    if(ql <= l && r <= qr) return tree[v];
    int mid = (l+r) >> 1;
    auto ans1 = get(v*2, l, mid, ql, qr);
    auto ans2 = get(v*2+1, mid+1, r, ql, qr);
    
    if(ans1 == -1 && ans2 == -1) return -1;
    if(ans1 == -1) return ans2;
    if(ans2 == -1) return ans1;
    return lca(ans1, ans2);
}

inline void update(int v, int l, int r, int pos, int val){
    if(l == r && l == pos){
        tree[v] = val;
        return ;
    }
    int mid = (l+r) >> 1;
    if(pos <= mid) update(v*2, l, mid, pos, val);
    else update(v*2+1, mid+1, r, pos, val);
    tree[v] = lca(tree[v*2], tree[v*2+1]);
}

int main(){
    //do_not_disturb
    
    int n, m, q;
    cin >> n >> m >> q;
    for(int i = 0; i < n-1; i++){
        int x, y;
        cin >> x >> y;
        graph[x].pb(y);
        graph[y].pb(x);
    }
    
    dfs(1);
    
    for(int i = 1; i <= m; i++){
        cin >> vec[i];
    }
    
    build(1, 1, m);
    
    while(q--){
        int type;
        cin >> type;
        if(type == 1){
            int pos, x;
            cin >> pos >> x;
            vec[pos] = x;
            update(1, 1, m, pos, x);
        }
        else{
            int l, r, x;
            pii ans = mp(-1, -1);
            cin >> l >> r >> x;
            for(int i = l; i <= r; i++){
                for(int j = i; j <= r; j++){
                    auto to = get(1, 1, m, i, j);
                    if(to == x){
                        ans = mp(i, j);
                    }
                }
            }
            cout << ans.first << ' ' << ans.second << endl;
        }
    }
    
    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB n=5
2 Correct 13 ms 5100 KB n=100
3 Correct 15 ms 5100 KB n=100
4 Correct 13 ms 5100 KB n=100
5 Correct 12 ms 5100 KB n=100
6 Correct 58 ms 5100 KB n=100
7 Correct 57 ms 5100 KB n=100
8 Correct 9 ms 5100 KB n=100
9 Correct 9 ms 5100 KB n=100
10 Correct 34 ms 5100 KB n=100
11 Correct 32 ms 5100 KB n=100
12 Correct 9 ms 5100 KB n=100
13 Correct 10 ms 5100 KB n=100
14 Correct 10 ms 5100 KB n=100
15 Correct 8 ms 5100 KB n=100
16 Correct 12 ms 5100 KB n=100
17 Correct 13 ms 5100 KB n=100
18 Correct 8 ms 5100 KB n=100
19 Correct 11 ms 5100 KB n=100
20 Correct 9 ms 5100 KB n=100
21 Correct 10 ms 5100 KB n=100
22 Correct 11 ms 5100 KB n=100
23 Correct 10 ms 5100 KB n=100
24 Correct 11 ms 5100 KB n=100
25 Correct 16 ms 5100 KB n=100
26 Correct 4 ms 5100 KB n=12
27 Correct 23 ms 5100 KB n=100

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB n=5
2 Correct 13 ms 5100 KB n=100
3 Correct 15 ms 5100 KB n=100
4 Correct 13 ms 5100 KB n=100
5 Correct 12 ms 5100 KB n=100
6 Correct 58 ms 5100 KB n=100
7 Correct 57 ms 5100 KB n=100
8 Correct 9 ms 5100 KB n=100
9 Correct 9 ms 5100 KB n=100
10 Correct 34 ms 5100 KB n=100
11 Correct 32 ms 5100 KB n=100
12 Correct 9 ms 5100 KB n=100
13 Correct 10 ms 5100 KB n=100
14 Correct 10 ms 5100 KB n=100
15 Correct 8 ms 5100 KB n=100
16 Correct 12 ms 5100 KB n=100
17 Correct 13 ms 5100 KB n=100
18 Correct 8 ms 5100 KB n=100
19 Correct 11 ms 5100 KB n=100
20 Correct 9 ms 5100 KB n=100
21 Correct 10 ms 5100 KB n=100
22 Correct 11 ms 5100 KB n=100
23 Correct 10 ms 5100 KB n=100
24 Correct 11 ms 5100 KB n=100
25 Correct 16 ms 5100 KB n=100
26 Correct 4 ms 5100 KB n=12
27 Correct 23 ms 5100 KB n=100
28 Correct 694 ms 5100 KB n=500
29 Correct 719 ms 5100 KB n=500
30 Correct 638 ms 5100 KB n=500
31 Correct 666 ms 5100 KB n=500
32 Correct 790 ms 5100 KB n=500
33 Correct 732 ms 5212 KB n=500
34 Correct 771 ms 5100 KB n=500
35 Correct 673 ms 5100 KB n=500
36 Execution timed out 4086 ms 5100 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB n=5
2 Correct 13 ms 5100 KB n=100
3 Correct 15 ms 5100 KB n=100
4 Correct 13 ms 5100 KB n=100
5 Correct 12 ms 5100 KB n=100
6 Correct 58 ms 5100 KB n=100
7 Correct 57 ms 5100 KB n=100
8 Correct 9 ms 5100 KB n=100
9 Correct 9 ms 5100 KB n=100
10 Correct 34 ms 5100 KB n=100
11 Correct 32 ms 5100 KB n=100
12 Correct 9 ms 5100 KB n=100
13 Correct 10 ms 5100 KB n=100
14 Correct 10 ms 5100 KB n=100
15 Correct 8 ms 5100 KB n=100
16 Correct 12 ms 5100 KB n=100
17 Correct 13 ms 5100 KB n=100
18 Correct 8 ms 5100 KB n=100
19 Correct 11 ms 5100 KB n=100
20 Correct 9 ms 5100 KB n=100
21 Correct 10 ms 5100 KB n=100
22 Correct 11 ms 5100 KB n=100
23 Correct 10 ms 5100 KB n=100
24 Correct 11 ms 5100 KB n=100
25 Correct 16 ms 5100 KB n=100
26 Correct 4 ms 5100 KB n=12
27 Correct 23 ms 5100 KB n=100
28 Correct 694 ms 5100 KB n=500
29 Correct 719 ms 5100 KB n=500
30 Correct 638 ms 5100 KB n=500
31 Correct 666 ms 5100 KB n=500
32 Correct 790 ms 5100 KB n=500
33 Correct 732 ms 5212 KB n=500
34 Correct 771 ms 5100 KB n=500
35 Correct 673 ms 5100 KB n=500
36 Execution timed out 4086 ms 5100 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5100 KB n=5
2 Correct 13 ms 5100 KB n=100
3 Correct 15 ms 5100 KB n=100
4 Correct 13 ms 5100 KB n=100
5 Correct 12 ms 5100 KB n=100
6 Correct 58 ms 5100 KB n=100
7 Correct 57 ms 5100 KB n=100
8 Correct 9 ms 5100 KB n=100
9 Correct 9 ms 5100 KB n=100
10 Correct 34 ms 5100 KB n=100
11 Correct 32 ms 5100 KB n=100
12 Correct 9 ms 5100 KB n=100
13 Correct 10 ms 5100 KB n=100
14 Correct 10 ms 5100 KB n=100
15 Correct 8 ms 5100 KB n=100
16 Correct 12 ms 5100 KB n=100
17 Correct 13 ms 5100 KB n=100
18 Correct 8 ms 5100 KB n=100
19 Correct 11 ms 5100 KB n=100
20 Correct 9 ms 5100 KB n=100
21 Correct 10 ms 5100 KB n=100
22 Correct 11 ms 5100 KB n=100
23 Correct 10 ms 5100 KB n=100
24 Correct 11 ms 5100 KB n=100
25 Correct 16 ms 5100 KB n=100
26 Correct 4 ms 5100 KB n=12
27 Correct 23 ms 5100 KB n=100
28 Correct 694 ms 5100 KB n=500
29 Correct 719 ms 5100 KB n=500
30 Correct 638 ms 5100 KB n=500
31 Correct 666 ms 5100 KB n=500
32 Correct 790 ms 5100 KB n=500
33 Correct 732 ms 5212 KB n=500
34 Correct 771 ms 5100 KB n=500
35 Correct 673 ms 5100 KB n=500
36 Execution timed out 4086 ms 5100 KB Time limit exceeded
37 Halted 0 ms 0 KB -