oj.uz

Submission #701475

# Submission time Handle Problem Language Result Execution time Memory
701475 2023-02-21T10:22:25 Z sugartheanh Synchronization (JOI13_synchronization) C++14
20 / 100
 3376 ms 18248 KB 
#include <bits/stdc++.h>
using namespace std;

#define dbg(x) cerr << #x << ": " << x << endl;
#define ii pair<int,int>
#define fi first
#define se second
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
int n,m,q,first[N],last[N],d[N],root;
vector<ii>p[N];
bool on[N];
void dfs(int x,int u,int L,int R)
{
    for(auto v : p[u])
    {
        if(v.fi == x)
            continue;
        if(u == root)
        {
            dfs(u,v.fi,first[v.se],last[v.se]);
            d[u] += d[v.fi];
        }
        else
        {
            if(first[v.se] < R)
            {
                dfs(u,v.fi,L,R);
                d[u] += d[v.fi];
            }
        }
    }
}
int main() {
  
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m>>q;
    for(int i = 1;i < n;i++)
    {
        int u,v;
        cin>>u>>v;
        p[u].push_back(ii(v,i));
        p[v].push_back(ii(u,i));
    }
    for(int i = 1;i <= n;i++)
        first[i] = 1e9;
    for(int i = 1;i <= m;i++)
    {
        int x;
        cin>>x;
        if(!on[x])
            first[x] = min(first[x], i);
        else
            last[x] = max(last[x], i);
        on[x] ^= 1;
    }
    for(int i = 1;i < n;i++)
    {
        if(first[i] < 1e9 && last[i] == 0)
            last[i] = 1e9;
    }
    while(q--)
    {
        cin>>root;
        for(int i = 1;i <= n;i++)
            d[i] = 1;
        dfs(0,root,0,0);
//        for(int i = 1;i <= n;i++)
//            cout<<i<<' '<<d[i]<<'\n';
        cout<<d[root]<<'\n';
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 5032 KB Output is correct
5 Incorrect 3 ms 5032 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 15652 KB Output is correct
2 Correct 37 ms 13836 KB Output is correct
3 Correct 37 ms 18248 KB Output is correct
4 Correct 37 ms 17192 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3376 ms 12500 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5036 KB Output is correct
2 Incorrect 2 ms 4948 KB Output isn't correct
3 Halted 0 ms 0 KB -