oj.uz

답안 #47757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47757 2018-05-07T04:50:21 Z mirbek01 Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 7416 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, m, q, d[N], used[N];
vector <int> g[N];

int main(){
      cin >> n >> m >> q;

      for(int i = 0; i < m; i ++){
            int u, v;
            cin >> u >> v;
            g[v].push_back(u);
      }

      while(q --){
            int t, y;
            cin >> t >> y;
            vector <int> v;
            for(int i = 1; i <= y; i ++){
                  int x;
                  cin >> x;
                  used[x] = 1;
                  v.push_back(x);
            }

            set < pair <int, int> > st;
            memset(d, 0, sizeof(d));
            st.insert({d[t], t});

            int ans = -1;

            while(!st.empty()){
                  int v = st.begin()->second;
                  st.erase(st.begin());
                  if(!used[v])
                        ans = max(ans, -d[v]);
                  for(int to : g[v]){
                        if(d[v] - 1 < d[to]){
                              st.erase({d[to], to});
                              d[to] = d[v] - 1;
                              st.insert({d[to], to});
                        }
                  }
            }


            cout << ans << endl;

            for(int i : v)
                  used[i] = 0;
      }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3064 KB Output is correct
2 Correct 5 ms 3248 KB Output is correct
3 Correct 5 ms 3248 KB Output is correct
4 Correct 4 ms 3248 KB Output is correct
5 Correct 6 ms 3248 KB Output is correct
6 Correct 7 ms 3248 KB Output is correct
7 Correct 7 ms 3248 KB Output is correct
8 Correct 7 ms 3248 KB Output is correct
9 Correct 13 ms 3276 KB Output is correct
10 Correct 12 ms 3320 KB Output is correct
11 Correct 7 ms 3320 KB Output is correct
12 Correct 7 ms 3320 KB Output is correct
13 Correct 6 ms 3320 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 6 ms 3320 KB Output is correct
16 Correct 10 ms 3320 KB Output is correct
17 Correct 8 ms 3320 KB Output is correct
18 Correct 6 ms 3320 KB Output is correct
19 Correct 7 ms 3320 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3064 KB Output is correct
2 Correct 5 ms 3248 KB Output is correct
3 Correct 5 ms 3248 KB Output is correct
4 Correct 4 ms 3248 KB Output is correct
5 Correct 6 ms 3248 KB Output is correct
6 Correct 7 ms 3248 KB Output is correct
7 Correct 7 ms 3248 KB Output is correct
8 Correct 7 ms 3248 KB Output is correct
9 Correct 13 ms 3276 KB Output is correct
10 Correct 12 ms 3320 KB Output is correct
11 Correct 7 ms 3320 KB Output is correct
12 Correct 7 ms 3320 KB Output is correct
13 Correct 6 ms 3320 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 6 ms 3320 KB Output is correct
16 Correct 10 ms 3320 KB Output is correct
17 Correct 8 ms 3320 KB Output is correct
18 Correct 6 ms 3320 KB Output is correct
19 Correct 7 ms 3320 KB Output is correct
20 Correct 141 ms 4468 KB Output is correct
21 Correct 118 ms 4476 KB Output is correct
22 Correct 199 ms 4552 KB Output is correct
23 Correct 117 ms 4672 KB Output is correct
24 Correct 204 ms 6920 KB Output is correct
25 Correct 212 ms 6944 KB Output is correct
26 Correct 200 ms 6944 KB Output is correct
27 Execution timed out 2056 ms 7416 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3064 KB Output is correct
2 Correct 5 ms 3248 KB Output is correct
3 Correct 5 ms 3248 KB Output is correct
4 Correct 4 ms 3248 KB Output is correct
5 Correct 6 ms 3248 KB Output is correct
6 Correct 7 ms 3248 KB Output is correct
7 Correct 7 ms 3248 KB Output is correct
8 Correct 7 ms 3248 KB Output is correct
9 Correct 13 ms 3276 KB Output is correct
10 Correct 12 ms 3320 KB Output is correct
11 Correct 7 ms 3320 KB Output is correct
12 Correct 7 ms 3320 KB Output is correct
13 Correct 6 ms 3320 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 6 ms 3320 KB Output is correct
16 Correct 10 ms 3320 KB Output is correct
17 Correct 8 ms 3320 KB Output is correct
18 Correct 6 ms 3320 KB Output is correct
19 Correct 7 ms 3320 KB Output is correct
20 Correct 141 ms 4468 KB Output is correct
21 Correct 118 ms 4476 KB Output is correct
22 Correct 199 ms 4552 KB Output is correct
23 Correct 117 ms 4672 KB Output is correct
24 Correct 204 ms 6920 KB Output is correct
25 Correct 212 ms 6944 KB Output is correct
26 Correct 200 ms 6944 KB Output is correct
27 Execution timed out 2056 ms 7416 KB Time limit exceeded
28 Halted 0 ms 0 KB -