oj.uz

답안 #962568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962568 2024-04-13T20:13:52 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;
        vis.insert(c[i]);
        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--;
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 15 ms 860 KB Output is correct
5 Correct 10 ms 616 KB Output is correct
6 Correct 10 ms 604 KB Output is correct
7 Correct 10 ms 600 KB Output is correct
8 Correct 11 ms 604 KB Output is correct
9 Correct 26 ms 1116 KB Output is correct
10 Correct 32 ms 1112 KB Output is correct
11 Correct 27 ms 1112 KB Output is correct
12 Correct 46 ms 1192 KB Output is correct
13 Correct 42 ms 1196 KB Output is correct
14 Correct 44 ms 1116 KB Output is correct
15 Correct 114 ms 1192 KB Output is correct
16 Correct 115 ms 1200 KB Output is correct
17 Correct 118 ms 1212 KB Output is correct
18 Correct 94 ms 1112 KB Output is correct
19 Correct 103 ms 1116 KB Output is correct
20 Correct 116 ms 1112 KB Output is correct
21 Correct 10 ms 1112 KB Output is correct
22 Correct 9 ms 1112 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 11 ms 1116 KB Output is correct
25 Correct 9 ms 1116 KB Output is correct
26 Correct 11 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 15 ms 1220 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 15 ms 860 KB Output is correct
5 Correct 10 ms 616 KB Output is correct
6 Correct 10 ms 604 KB Output is correct
7 Correct 10 ms 600 KB Output is correct
8 Correct 11 ms 604 KB Output is correct
9 Correct 26 ms 1116 KB Output is correct
10 Correct 32 ms 1112 KB Output is correct
11 Correct 27 ms 1112 KB Output is correct
12 Correct 46 ms 1192 KB Output is correct
13 Correct 42 ms 1196 KB Output is correct
14 Correct 44 ms 1116 KB Output is correct
15 Correct 114 ms 1192 KB Output is correct
16 Correct 115 ms 1200 KB Output is correct
17 Correct 118 ms 1212 KB Output is correct
18 Correct 94 ms 1112 KB Output is correct
19 Correct 103 ms 1116 KB Output is correct
20 Correct 116 ms 1112 KB Output is correct
21 Correct 10 ms 1112 KB Output is correct
22 Correct 9 ms 1112 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 11 ms 1116 KB Output is correct
25 Correct 9 ms 1116 KB Output is correct
26 Correct 11 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 15 ms 1220 KB Output is correct
30 Correct 956 ms 17220 KB Output is correct
31 Correct 1184 ms 20552 KB Output is correct
32 Correct 2012 ms 32240 KB Output is correct
33 Correct 2023 ms 32344 KB Output is correct
34 Correct 1914 ms 32364 KB Output is correct
35 Correct 3396 ms 32104 KB Output is correct
36 Correct 3565 ms 32112 KB Output is correct
37 Correct 3652 ms 32112 KB Output is correct
38 Execution timed out 5029 ms 32088 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

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

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 498 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 28 ms 31664 KB Output is correct
4 Runtime error 386 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 15 ms 860 KB Output is correct
5 Correct 10 ms 616 KB Output is correct
6 Correct 10 ms 604 KB Output is correct
7 Correct 10 ms 600 KB Output is correct
8 Correct 11 ms 604 KB Output is correct
9 Correct 26 ms 1116 KB Output is correct
10 Correct 32 ms 1112 KB Output is correct
11 Correct 27 ms 1112 KB Output is correct
12 Correct 46 ms 1192 KB Output is correct
13 Correct 42 ms 1196 KB Output is correct
14 Correct 44 ms 1116 KB Output is correct
15 Correct 114 ms 1192 KB Output is correct
16 Correct 115 ms 1200 KB Output is correct
17 Correct 118 ms 1212 KB Output is correct
18 Correct 94 ms 1112 KB Output is correct
19 Correct 103 ms 1116 KB Output is correct
20 Correct 116 ms 1112 KB Output is correct
21 Correct 10 ms 1112 KB Output is correct
22 Correct 9 ms 1112 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 11 ms 1116 KB Output is correct
25 Correct 9 ms 1116 KB Output is correct
26 Correct 11 ms 1116 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 15 ms 1220 KB Output is correct
30 Correct 956 ms 17220 KB Output is correct
31 Correct 1184 ms 20552 KB Output is correct
32 Correct 2012 ms 32240 KB Output is correct
33 Correct 2023 ms 32344 KB Output is correct
34 Correct 1914 ms 32364 KB Output is correct
35 Correct 3396 ms 32104 KB Output is correct
36 Correct 3565 ms 32112 KB Output is correct
37 Correct 3652 ms 32112 KB Output is correct
38 Execution timed out 5029 ms 32088 KB Time limit exceeded
39 Halted 0 ms 0 KB -