oj.uz

Submission #567262

# Submission time Handle Problem Language Result Execution time Memory
567262 2022-05-23T09:51:24 Z Uzouf Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 117 ms 2860 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=1005;//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[a].push_back(b);
    }

    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;

      for (int i=1;i<=n;i++) {
        if (busy[i]) continue;
        q.push({0,i}); dis[i]=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});
          }
        }
      }
      if (dis[plc]==-1e10) dis[plc]=-1;
      ans[tt]=dis[plc];
    }

    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 0 ms 340 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 25 ms 340 KB Output is correct
9 Correct 17 ms 340 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 8 ms 400 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 25 ms 340 KB Output is correct
9 Correct 17 ms 340 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 8 ms 400 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 98 ms 2764 KB Output is correct
21 Correct 108 ms 2840 KB Output is correct
22 Correct 36 ms 2712 KB Output is correct
23 Correct 117 ms 2860 KB Output is correct
24 Runtime error 1 ms 468 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 25 ms 340 KB Output is correct
9 Correct 17 ms 340 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 8 ms 400 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 98 ms 2764 KB Output is correct
21 Correct 108 ms 2840 KB Output is correct
22 Correct 36 ms 2712 KB Output is correct
23 Correct 117 ms 2860 KB Output is correct
24 Runtime error 1 ms 468 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -