oj.uz

Submission #567302

# Submission time Handle Problem Language Result Execution time Memory
567302 2022-05-23T10:21:22 Z Uzouf Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 2000 ms 9852 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=1e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

int n,m,t;
vector<vector<int> > v(N);
int ans[N];

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);

    cin>>n>>m>>t;
    for (int i=0;i<m;i++) {
      int a,b; cin>>a>>b;
      v[b].push_back(a);
    }

    for (int tt=0;tt<t;tt++) {
      bool busy[N];
      memset(busy,false,sizeof busy);

      int plc; cin>>plc;
      int b; cin>>b;
      for (int i=0;i<b;i++) {
        int x; cin>>x; busy[x]=true;
      }

      priority_queue<pair<int,int> > q;
      int dis[N];
      for (int i=0;i<N;i++) dis[i]=-1e10;

      q.push({0,plc}); dis[plc]=0;

      while (!q.empty()) {
        int i=q.top().second;
        int cst=q.top().first;
        q.pop();
        if (dis[i]>cst) continue;
        for (int j:v[i]) {
          int nw=cst+1;
          if (dis[j]<nw) {
            dis[j]=nw;
            q.push({dis[j],j});
          }
        }
      }

      int cnt=-1;
      for (int i=1;i<=n;i++) {
        if (!busy[i]) cnt=max(cnt,dis[i]);
      }
      ans[tt]=cnt;
    }

    for (int i=0;i<t;i++) cout<<ans[i]<<endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 3 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 3 ms 3540 KB Output is correct
8 Correct 4 ms 3540 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3596 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 3 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 3 ms 3540 KB Output is correct
8 Correct 4 ms 3540 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3596 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct
20 Correct 36 ms 7188 KB Output is correct
21 Correct 32 ms 6648 KB Output is correct
22 Correct 50 ms 8192 KB Output is correct
23 Correct 31 ms 6200 KB Output is correct
24 Correct 71 ms 7040 KB Output is correct
25 Correct 48 ms 6984 KB Output is correct
26 Correct 49 ms 7020 KB Output is correct
27 Correct 62 ms 8908 KB Output is correct
28 Correct 71 ms 8832 KB Output is correct
29 Correct 98 ms 9852 KB Output is correct
30 Correct 55 ms 7752 KB Output is correct
31 Correct 54 ms 7664 KB Output is correct
32 Correct 52 ms 7792 KB Output is correct
33 Correct 51 ms 7076 KB Output is correct
34 Correct 49 ms 6968 KB Output is correct
35 Correct 51 ms 6988 KB Output is correct
36 Execution timed out 2078 ms 7104 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 3 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 3 ms 3540 KB Output is correct
7 Correct 3 ms 3540 KB Output is correct
8 Correct 4 ms 3540 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 2 ms 3596 KB Output is correct
13 Correct 2 ms 3540 KB Output is correct
14 Correct 2 ms 3540 KB Output is correct
15 Correct 2 ms 3540 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct
20 Correct 36 ms 7188 KB Output is correct
21 Correct 32 ms 6648 KB Output is correct
22 Correct 50 ms 8192 KB Output is correct
23 Correct 31 ms 6200 KB Output is correct
24 Correct 71 ms 7040 KB Output is correct
25 Correct 48 ms 6984 KB Output is correct
26 Correct 49 ms 7020 KB Output is correct
27 Correct 62 ms 8908 KB Output is correct
28 Correct 71 ms 8832 KB Output is correct
29 Correct 98 ms 9852 KB Output is correct
30 Correct 55 ms 7752 KB Output is correct
31 Correct 54 ms 7664 KB Output is correct
32 Correct 52 ms 7792 KB Output is correct
33 Correct 51 ms 7076 KB Output is correct
34 Correct 49 ms 6968 KB Output is correct
35 Correct 51 ms 6988 KB Output is correct
36 Execution timed out 2078 ms 7104 KB Time limit exceeded
37 Halted 0 ms 0 KB -