oj.uz

Submission #1117221

# Submission time Handle Problem Language Result Execution time Memory
1117221 2024-11-23T02:32:32 Z hqminhuwu Tourism (JOI23_tourism) C++14
24 / 100
 5000 ms 50248 KB 
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <int,pii> piii;

#define forr(_a,_b,_c) for(int _a = (_b); _a <= int (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> int (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < int (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

template<class X, class Y>
    bool minz(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        } return false;
    }
template<class X, class Y>
    bool maxz(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        } return false;
    }

const int N = 5e5 + 5;
const ll oo = (ll) 1e16;
const ll mod = 1e9 + 7; // 998244353;

int n, m, bit[N], pos[N], head[N], sz[N], hv[N], u, v, q, cnt, dep[N], c[N], p[N];
vector <int> a[N];
vector <pii> qq[N];

void upd (int i, int val){
    for (; i <= m; i += i & -i)
        bit[i] += val;
}

int get (int i){
    int res = 0;
    for (; i; i -= i & -i)
        res += bit[i];
    return res;
}

void dfsz (int u){
    sz[u] = 1;
    for (int v : a[u]){
        if (sz[v]) continue;
        dep[v] = dep[u] + 1;
        p[v] = u;
        dfsz(v);
        sz[u] += sz[v];
        if (sz[v] > sz[hv[u]]){
            hv[u] = v;
        }
    }
}

void dcp (int u, int h){
    head[u] = h;
    pos[u] = ++cnt;
    
    if (hv[u]){
        dcp(hv[u], h);
    }

    for (int v : a[u]){
        if (sz[v] > sz[u]) continue;
        dcp(v, v);
    }
}

set <piii> s;

void uwu (int l, int r, int val){
	auto it = s.lower_bound({l, {l, 0}});
	
    if(it != s.begin()) it--;
	vector <piii> rem, add;
    add.pb({l, {r, val}});

	for (; it != s.end() && (*it).st <= r; ++it){
		int fl = (*it).st, fr = (*it).nd.st, fv = (*it).nd.nd;
		if(fr < l) continue;
		rem.pb(*it);
		if(fl < l) add.pb({fl, {l - 1, fv}});
		if(fr > r) add.pb({r + 1, {fr, fv}});
	}

	for (piii x : rem){
		upd(x.nd.nd, -(x.nd.st - x.st + 1));
		s.erase(x);
	}

	for(piii x : add){
		upd(x.nd.nd, x.nd.st - x.st + 1);
		s.insert(x);
	}
}

void owo (int u, int v, int val){
    for (; head[u] != head[v]; v = p[head[v]]){
        if (dep[head[u]] > dep[head[v]])
            swap(u, v);
        uwu(pos[head[v]], pos[v], val);
    }
    if (dep[u] > dep[v])
        swap(u, v);
    uwu(pos[u], pos[v], val);
}


int ans[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef kaguya
        freopen(file".inp", "r", stdin); freopen(file".out", "w", stdout);
    #endif

    cin >> n >> m >> q;

    forf (i, 1, n){
        cin >> u >> v;
        a[u].pb(v);
        a[v].pb(u);
    }

    dfsz(1);
    dcp(1, 1);

    forr (i, 1, m){
        cin >> c[i];
    }

    forr (i, 1, q){
        cin >> u >> v;
        qq[v].pb({u, i});
    }    

    forr (i, 1, m){
        if (i > 1){
            owo(c[i], c[i - 1], i);
        }

        for (pii t : qq[i]){
            if (t.st == i){
                ans[t.nd] = 1;
            } else {
                ans[t.nd] = get(i) - get(t.st);
            }
        }
    }

    forr (i, 1, q){
        cout << ans[i] << "\n";
    }


    

    return 0;
}
/*



*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37200 KB Output is correct
2 Correct 6 ms 37200 KB Output is correct
3 Correct 6 ms 35152 KB Output is correct
4 Correct 6 ms 31244 KB Output is correct
5 Correct 7 ms 27100 KB Output is correct
6 Correct 10 ms 27224 KB Output is correct
7 Correct 5 ms 27216 KB Output is correct
8 Correct 9 ms 27216 KB Output is correct
9 Correct 9 ms 27168 KB Output is correct
10 Correct 33 ms 27208 KB Output is correct
11 Correct 11 ms 27216 KB Output is correct
12 Correct 11 ms 27216 KB Output is correct
13 Correct 10 ms 27216 KB Output is correct
14 Correct 12 ms 27216 KB Output is correct
15 Execution timed out 5071 ms 26960 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37200 KB Output is correct
2 Correct 6 ms 37200 KB Output is correct
3 Correct 6 ms 35152 KB Output is correct
4 Correct 6 ms 31244 KB Output is correct
5 Correct 7 ms 27100 KB Output is correct
6 Correct 10 ms 27224 KB Output is correct
7 Correct 5 ms 27216 KB Output is correct
8 Correct 9 ms 27216 KB Output is correct
9 Correct 9 ms 27168 KB Output is correct
10 Correct 33 ms 27208 KB Output is correct
11 Correct 11 ms 27216 KB Output is correct
12 Correct 11 ms 27216 KB Output is correct
13 Correct 10 ms 27216 KB Output is correct
14 Correct 12 ms 27216 KB Output is correct
15 Execution timed out 5071 ms 26960 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 29008 KB Output is correct
2 Correct 5 ms 26960 KB Output is correct
3 Correct 10 ms 27216 KB Output is correct
4 Execution timed out 5067 ms 35024 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29008 KB Output is correct
2 Execution timed out 5048 ms 30544 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 31056 KB Output is correct
2 Correct 6 ms 27216 KB Output is correct
3 Correct 6 ms 29328 KB Output is correct
4 Correct 944 ms 38472 KB Output is correct
5 Correct 983 ms 38684 KB Output is correct
6 Correct 1198 ms 41752 KB Output is correct
7 Correct 1325 ms 45336 KB Output is correct
8 Correct 1290 ms 43340 KB Output is correct
9 Correct 1318 ms 43252 KB Output is correct
10 Correct 1358 ms 45348 KB Output is correct
11 Correct 1298 ms 43336 KB Output is correct
12 Correct 1298 ms 50248 KB Output is correct
13 Correct 1408 ms 43460 KB Output is correct
14 Correct 47 ms 33584 KB Output is correct

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37200 KB Output is correct
2 Correct 6 ms 37200 KB Output is correct
3 Correct 6 ms 35152 KB Output is correct
4 Correct 6 ms 31244 KB Output is correct
5 Correct 7 ms 27100 KB Output is correct
6 Correct 10 ms 27224 KB Output is correct
7 Correct 5 ms 27216 KB Output is correct
8 Correct 9 ms 27216 KB Output is correct
9 Correct 9 ms 27168 KB Output is correct
10 Correct 33 ms 27208 KB Output is correct
11 Correct 11 ms 27216 KB Output is correct
12 Correct 11 ms 27216 KB Output is correct
13 Correct 10 ms 27216 KB Output is correct
14 Correct 12 ms 27216 KB Output is correct
15 Execution timed out 5071 ms 26960 KB Time limit exceeded
16 Halted 0 ms 0 KB -