oj.uz

Submission #95335

# Submission time Handle Problem Language Result Execution time Memory
95335 2019-01-30T10:17:21 Z dalgerok Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 2000 ms 245776 KB 
#include<bits/stdc++.h>
using namespace std;




const int N = 1e5 + 5, S = sqrt(N);


int n, m, q;
vector < pair < int, int > > dp[N];
vector < int > g[N];
bool used[N];
int dpp[N], ans[N];


inline void mrg(int x, int y){
    for(auto it : dp[x]){
        ans[it.second] = it.first;
    }
    for(auto it : dp[y]){
        ans[it.second] = max(ans[it.second], it.first + 1);
    }
    for(auto &it : dp[x]){
        it.first = ans[it.second];
        ans[it.second] = 0;
    }
    for(auto it : dp[y]){
        if(ans[it.second]){
            dp[x].push_back(make_pair(it.first + 1, it.second));
            ans[it.second] = 0;
        }
    }
    sort(dp[x].rbegin(), dp[x].rend());
    while((int)dp[x].size() > S){
        dp[x].pop_back();
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i <= m; i++){
        int x, y;
        cin >> x >> y;
        g[y].push_back(x);
    }
    for(int i = 1; i <= n; i++){
        for(int j : g[i]){
            mrg(i, j);
        }
        if((int)dp[i].size() < S){
            dp[i].push_back(make_pair(0, i));
        }
    }
    while(q--){
        int v, x;
        cin >> v >> x;
        vector < int > y(x);
        for(int i = 0; i < x; i++){
            cin >> y[i];
            used[y[i]] = true;
        }
        if(x < S){
            for(auto it : dp[v]){
                if(!used[it.second]){
                    cout << it.first << "\n";
                    goto to;
                }
            }
            cout << "-1\n";
            to:;
        }
        else{
            for(int i = 1; i <= v; i++){
                dpp[i] = 0;
                if(used[i]){
                    dpp[i] = -1;
                }
                for(int j : g[i]){
                    if(dpp[j] != -1){
                        dpp[i] = max(dpp[i], dpp[j] + 1);
                    }
                }
            }
            cout << dpp[v] << "\n";
        }
        for(int i = 0; i < x; i++){
            used[y[i]] = false;
        }
        y.clear();
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 9 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 21 ms 8440 KB Output is correct
9 Correct 19 ms 8440 KB Output is correct
10 Correct 19 ms 8440 KB Output is correct
11 Correct 18 ms 8060 KB Output is correct
12 Correct 14 ms 6392 KB Output is correct
13 Correct 18 ms 7800 KB Output is correct
14 Correct 20 ms 7032 KB Output is correct
15 Correct 15 ms 6056 KB Output is correct
16 Correct 18 ms 7032 KB Output is correct
17 Correct 19 ms 7288 KB Output is correct
18 Correct 14 ms 6264 KB Output is correct
19 Correct 19 ms 7288 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 9 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 21 ms 8440 KB Output is correct
9 Correct 19 ms 8440 KB Output is correct
10 Correct 19 ms 8440 KB Output is correct
11 Correct 18 ms 8060 KB Output is correct
12 Correct 14 ms 6392 KB Output is correct
13 Correct 18 ms 7800 KB Output is correct
14 Correct 20 ms 7032 KB Output is correct
15 Correct 15 ms 6056 KB Output is correct
16 Correct 18 ms 7032 KB Output is correct
17 Correct 19 ms 7288 KB Output is correct
18 Correct 14 ms 6264 KB Output is correct
19 Correct 19 ms 7288 KB Output is correct
20 Correct 846 ms 10984 KB Output is correct
21 Correct 846 ms 11040 KB Output is correct
22 Correct 846 ms 11000 KB Output is correct
23 Correct 951 ms 11128 KB Output is correct
24 Execution timed out 2063 ms 245776 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 5112 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 9 ms 5496 KB Output is correct
6 Correct 8 ms 5496 KB Output is correct
7 Correct 8 ms 5496 KB Output is correct
8 Correct 21 ms 8440 KB Output is correct
9 Correct 19 ms 8440 KB Output is correct
10 Correct 19 ms 8440 KB Output is correct
11 Correct 18 ms 8060 KB Output is correct
12 Correct 14 ms 6392 KB Output is correct
13 Correct 18 ms 7800 KB Output is correct
14 Correct 20 ms 7032 KB Output is correct
15 Correct 15 ms 6056 KB Output is correct
16 Correct 18 ms 7032 KB Output is correct
17 Correct 19 ms 7288 KB Output is correct
18 Correct 14 ms 6264 KB Output is correct
19 Correct 19 ms 7288 KB Output is correct
20 Correct 846 ms 10984 KB Output is correct
21 Correct 846 ms 11040 KB Output is correct
22 Correct 846 ms 11000 KB Output is correct
23 Correct 951 ms 11128 KB Output is correct
24 Execution timed out 2063 ms 245776 KB Time limit exceeded
25 Halted 0 ms 0 KB -