oj.uz

Submission #567165

# Submission time Handle Problem Language Result Execution time Memory
567165 2022-05-23T08:42:19 Z AbdullahMW Bitaro’s Party (JOI18_bitaro) C++17
0 / 100
 2000 ms 322068 KB 
#include <bits/stdc++.h>

#define all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007

using namespace std;

#pragma GCC diagnostic ignored "-Wunused-result"
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(15);
    if (name.size()) {
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}

vector <ll> gr[100005];
unordered_map <ll, unordered_map <ll, ll>> path;

void bfs(ll beg)
{
    queue <pair <ll, ll>> q;
    q.push({0, beg});
    
    while (q.size())
    {
        ll x = q.front().s, len = q.front().f;
        q.pop();
        
        path[beg][x] = max(path[beg][x], len);
        for (auto v : gr[x])
        {
            q.push({len + 1, v});
        }
    }
}

int main()
{
    fast
    //setIO("");
    
    //freopen("filename.in", "r", stdin);
    //freopen("filename.out", "w", stdout);
  
    ll n, m, q; cin >> n >> m >> q;
    for (ll i = 1; i <= m; i++)
    {
        ll x, y; cin >> x >> y;
        gr[x].pb(y);
    }
    
    for (ll i = 1; i <= n; i++)
    {
        bfs(i);
    }
    
    while (q--)
    {
        ll t, f; cin >> t >> f;
        unordered_map <ll, bool> busy;
        for (ll i = 1; i <= f; i++)
        {
            ll fr; cin >> fr;
            busy[fr] = true;
        }
        
        ll mx = -1;
        if (!busy[t]) mx = 0;
        for (ll i = 1; i <= n; i++)
        {
            if (!busy[i] && i != t && path[i][t] > 0) mx = max(mx, path[i][t]);
        }
        
        cout << mx << newl;
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 59 ms 4472 KB Output is correct
6 Correct 28 ms 4556 KB Output is correct
7 Correct 27 ms 4336 KB Output is correct
8 Execution timed out 2062 ms 322068 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 59 ms 4472 KB Output is correct
6 Correct 28 ms 4556 KB Output is correct
7 Correct 27 ms 4336 KB Output is correct
8 Execution timed out 2062 ms 322068 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 59 ms 4472 KB Output is correct
6 Correct 28 ms 4556 KB Output is correct
7 Correct 27 ms 4336 KB Output is correct
8 Execution timed out 2062 ms 322068 KB Time limit exceeded
9 Halted 0 ms 0 KB -