oj.uz

답안 #962570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962570 2024-04-13T20:15:28 Z amine_aroua Tourism (JOI23_tourism) C++17
5 / 100
 5000 ms 1048576 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);
    vector<vi> dp(m , vi(m , INF));
    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]--;
        dp[i][i] = 1;
    }
    dfs(0 , -1);
    fore(i , m)
    {
        set<int> vis;
        forr(j , i + 1 , m - 1)
        {
            get_together(c[j - 1] , c[j] , vis);
            dp[i][j] = sz(vis);
        }
    }
    while(q--)
    {
        int l , r;
        cin>>l>>r;
        l-- , r--;
        cout<<dp[l][r]<<nl;
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 860 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 16 ms 1116 KB Output is correct
10 Correct 17 ms 1116 KB Output is correct
11 Correct 17 ms 1112 KB Output is correct
12 Correct 17 ms 1120 KB Output is correct
13 Correct 15 ms 1124 KB Output is correct
14 Correct 16 ms 1216 KB Output is correct
15 Correct 66 ms 1200 KB Output is correct
16 Correct 76 ms 1112 KB Output is correct
17 Correct 77 ms 1116 KB Output is correct
18 Correct 62 ms 1192 KB Output is correct
19 Correct 58 ms 1116 KB Output is correct
20 Correct 68 ms 1112 KB Output is correct
21 Correct 6 ms 1116 KB Output is correct
22 Correct 5 ms 1116 KB Output is correct
23 Correct 6 ms 1120 KB Output is correct
24 Correct 5 ms 1116 KB Output is correct
25 Correct 7 ms 1220 KB Output is correct
26 Correct 6 ms 1116 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 17 ms 1212 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 860 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 16 ms 1116 KB Output is correct
10 Correct 17 ms 1116 KB Output is correct
11 Correct 17 ms 1112 KB Output is correct
12 Correct 17 ms 1120 KB Output is correct
13 Correct 15 ms 1124 KB Output is correct
14 Correct 16 ms 1216 KB Output is correct
15 Correct 66 ms 1200 KB Output is correct
16 Correct 76 ms 1112 KB Output is correct
17 Correct 77 ms 1116 KB Output is correct
18 Correct 62 ms 1192 KB Output is correct
19 Correct 58 ms 1116 KB Output is correct
20 Correct 68 ms 1112 KB Output is correct
21 Correct 6 ms 1116 KB Output is correct
22 Correct 5 ms 1116 KB Output is correct
23 Correct 6 ms 1120 KB Output is correct
24 Correct 5 ms 1116 KB Output is correct
25 Correct 7 ms 1220 KB Output is correct
26 Correct 6 ms 1116 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 17 ms 1212 KB Output is correct
30 Correct 605 ms 17220 KB Output is correct
31 Correct 692 ms 20548 KB Output is correct
32 Correct 1216 ms 32108 KB Output is correct
33 Correct 1226 ms 32108 KB Output is correct
34 Correct 1149 ms 32116 KB Output is correct
35 Correct 1139 ms 32116 KB Output is correct
36 Correct 1232 ms 32112 KB Output is correct
37 Correct 1262 ms 32112 KB Output is correct
38 Execution timed out 5078 ms 32092 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 24 ms 31836 KB Output is correct
4 Runtime error 473 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Runtime error 379 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 23 ms 31836 KB Output is correct
4 Runtime error 365 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 9 ms 860 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 16 ms 1116 KB Output is correct
10 Correct 17 ms 1116 KB Output is correct
11 Correct 17 ms 1112 KB Output is correct
12 Correct 17 ms 1120 KB Output is correct
13 Correct 15 ms 1124 KB Output is correct
14 Correct 16 ms 1216 KB Output is correct
15 Correct 66 ms 1200 KB Output is correct
16 Correct 76 ms 1112 KB Output is correct
17 Correct 77 ms 1116 KB Output is correct
18 Correct 62 ms 1192 KB Output is correct
19 Correct 58 ms 1116 KB Output is correct
20 Correct 68 ms 1112 KB Output is correct
21 Correct 6 ms 1116 KB Output is correct
22 Correct 5 ms 1116 KB Output is correct
23 Correct 6 ms 1120 KB Output is correct
24 Correct 5 ms 1116 KB Output is correct
25 Correct 7 ms 1220 KB Output is correct
26 Correct 6 ms 1116 KB Output is correct
27 Correct 1 ms 1112 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 17 ms 1212 KB Output is correct
30 Correct 605 ms 17220 KB Output is correct
31 Correct 692 ms 20548 KB Output is correct
32 Correct 1216 ms 32108 KB Output is correct
33 Correct 1226 ms 32108 KB Output is correct
34 Correct 1149 ms 32116 KB Output is correct
35 Correct 1139 ms 32116 KB Output is correct
36 Correct 1232 ms 32112 KB Output is correct
37 Correct 1262 ms 32112 KB Output is correct
38 Execution timed out 5078 ms 32092 KB Time limit exceeded
39 Halted 0 ms 0 KB -