oj.uz

Submission #962572

# Submission time Handle Problem Language Result Execution time Memory
962572 2024-04-13T20:19:05 Z amine_aroua Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 13120 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)

// HERE IS THE SOLUTION
int n , m , q;
vector<vi> adj;
vi c;
vi depth;
vi par;
void dfs(int x , int p)
{
    for(auto u : adj[x])
    {
        if(u == p)
            continue;
        depth[u] = depth[x] + 1;
        par[u] = x;
        dfs(u , x);
    }
}
void get_together(int u , int v , set<int> &vis)
{
    if(u == v)
    {
        vis.insert(u);
        return ;
    }
    if(depth[u] < depth[v])
        swap(u , v);
    int x = depth[u] - depth[v];
    int ans = 0;
    vis.insert(u);
    while (x--)
    {
        ans++;
        u = par[u];
        vis.insert(u);
    }
    if(u == v)
    {
        return;
    }
    vis.insert(v);
    while(u != v)
    {
        ans+=2;
        u = par[u];
        vis.insert(u);
        v = par[v];
        vis.insert(v);
    }
    return ;
}
signed main()
{
    boost;
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m>>q;
    c = vi (m);
    adj.assign(n , {});
    depth.assign(n , 0);
    par.assign(n , 0);
    fore(i , n - 1)
    {
        int u , v;
        cin>>u>>v;
        u-- , v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    fore(i , m)
    {
        cin>>c[i];
        c[i]--;
    }
    dfs(0 , -1);
    while(q--)
    {
        int l , r;
        cin>>l>>r;
        l-- , r--;
        set<int> vis;
        int i = l;
        vis.insert(c[i]);
        forr(j , i + 1 , r)
        {
            get_together(c[j - 1] , c[j] , vis);
        }
        cout<<sz(vis)<<nl;
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 5 ms 488 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 344 KB Output is correct
12 Correct 34 ms 348 KB Output is correct
13 Correct 30 ms 344 KB Output is correct
14 Correct 32 ms 468 KB Output is correct
15 Correct 80 ms 348 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 82 ms 468 KB Output is correct
18 Correct 56 ms 468 KB Output is correct
19 Correct 61 ms 344 KB Output is correct
20 Correct 71 ms 468 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 4 ms 492 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 5 ms 488 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 344 KB Output is correct
12 Correct 34 ms 348 KB Output is correct
13 Correct 30 ms 344 KB Output is correct
14 Correct 32 ms 468 KB Output is correct
15 Correct 80 ms 348 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 82 ms 468 KB Output is correct
18 Correct 56 ms 468 KB Output is correct
19 Correct 61 ms 344 KB Output is correct
20 Correct 71 ms 468 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 4 ms 492 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 385 ms 616 KB Output is correct
31 Correct 541 ms 600 KB Output is correct
32 Correct 881 ms 676 KB Output is correct
33 Correct 892 ms 676 KB Output is correct
34 Correct 862 ms 600 KB Output is correct
35 Correct 2429 ms 688 KB Output is correct
36 Correct 2614 ms 676 KB Output is correct
37 Correct 2737 ms 672 KB Output is correct
38 Execution timed out 5044 ms 728 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Execution timed out 5083 ms 9656 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 74 ms 5080 KB Output is correct
3 Correct 120 ms 5724 KB Output is correct
4 Correct 100 ms 6184 KB Output is correct
5 Correct 262 ms 12444 KB Output is correct
6 Correct 259 ms 11204 KB Output is correct
7 Correct 248 ms 10052 KB Output is correct
8 Correct 194 ms 9296 KB Output is correct
9 Correct 202 ms 9124 KB Output is correct
10 Correct 165 ms 8992 KB Output is correct
11 Correct 145 ms 8936 KB Output is correct
12 Correct 147 ms 8920 KB Output is correct
13 Correct 137 ms 8908 KB Output is correct
14 Correct 126 ms 8784 KB Output is correct
15 Correct 52 ms 9044 KB Output is correct
16 Correct 202 ms 11860 KB Output is correct
17 Correct 191 ms 11600 KB Output is correct
18 Correct 191 ms 11484 KB Output is correct
19 Execution timed out 5045 ms 13120 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Execution timed out 5092 ms 7800 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 5 ms 488 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 344 KB Output is correct
12 Correct 34 ms 348 KB Output is correct
13 Correct 30 ms 344 KB Output is correct
14 Correct 32 ms 468 KB Output is correct
15 Correct 80 ms 348 KB Output is correct
16 Correct 81 ms 348 KB Output is correct
17 Correct 82 ms 468 KB Output is correct
18 Correct 56 ms 468 KB Output is correct
19 Correct 61 ms 344 KB Output is correct
20 Correct 71 ms 468 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 5 ms 348 KB Output is correct
26 Correct 4 ms 492 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 385 ms 616 KB Output is correct
31 Correct 541 ms 600 KB Output is correct
32 Correct 881 ms 676 KB Output is correct
33 Correct 892 ms 676 KB Output is correct
34 Correct 862 ms 600 KB Output is correct
35 Correct 2429 ms 688 KB Output is correct
36 Correct 2614 ms 676 KB Output is correct
37 Correct 2737 ms 672 KB Output is correct
38 Execution timed out 5044 ms 728 KB Time limit exceeded
39 Halted 0 ms 0 KB -