oj.uz

답안 #47759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47759 2018-05-07T05:10:43 Z daniel_02 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 8044 KB 
#include <bits/stdc++.h>

#define pb push_back
#define fr first
#define sc second

using namespace std;

const int N = 1e5 + 7;
const int inf = 1e9 + 7;

priority_queue<pair<int, int>>q;
vector<pair<int, int>>g[N];
bool busy[N];
int d[N];

main()
{
    int n, m, Q;

    cin >> n >> m >> Q;

    for (int i = 1; i <= m; i ++)
    {
        int u, v;

        scanf("%d%d", &u, &v);

        g[v].pb({u, 1});
    }

    while (Q--)
    {
        int t, k, mx;

        scanf("%d%d", &t, &k);

        for (int i = 0; i < k; i++)
        {
            int a;
            scanf("%d", &a);
            busy[a] = 1;
        }
        for (int i = 1; i <= n; i++)
            d[i] = -inf;

        q.push({t, 0});
        d[t] = 0;
        while (!q.empty())
        {
            int v = q.top().fr, cs = q.top().sc * -1;
            q.pop();
            if (d[v] < cs)continue;


            for (int i = 0; i < g[v].size(); i++)
            {
                int to = g[v][i].fr, cost = g[v][i].sc;

                if (d[to] < cost + d[v])
                {
//                    cout << v << " " << to << " " << d[v] << endl;
                    d[to] = cost + d[v];
                    q.push({to, -d[v]});
                }
            }
        }
        mx = -1;

        for (int i = 1; i <= n; i++)
        {
            if (!busy[i] && d[i] != -inf)
            {
                mx = max(mx, d[i]);
            }
        }

        if (mx == -1 || mx == -inf)
        {
            cout << -1 << endl;
            continue;
        }

        cout << mx << endl;
        memset(busy, 0, sizeof(busy));
    }
}

Compilation message

bitaro.cpp:17:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
bitaro.cpp: In function 'int main()':
bitaro.cpp:56:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i = 0; i < g[v].size(); i++)
                             ~~^~~~~~~~~~~~~
bitaro.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &t, &k);
         ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:41:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a);
             ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 5 ms 2896 KB Output is correct
3 Correct 5 ms 2980 KB Output is correct
4 Correct 5 ms 2980 KB Output is correct
5 Correct 6 ms 2980 KB Output is correct
6 Correct 5 ms 3100 KB Output is correct
7 Correct 5 ms 3100 KB Output is correct
8 Correct 5 ms 3100 KB Output is correct
9 Correct 5 ms 3100 KB Output is correct
10 Correct 5 ms 3100 KB Output is correct
11 Correct 5 ms 3100 KB Output is correct
12 Correct 5 ms 3100 KB Output is correct
13 Correct 1 ms 3100 KB Output is correct
14 Correct 5 ms 3100 KB Output is correct
15 Correct 5 ms 3100 KB Output is correct
16 Correct 6 ms 3100 KB Output is correct
17 Correct 5 ms 3100 KB Output is correct
18 Correct 5 ms 3100 KB Output is correct
19 Correct 5 ms 3100 KB Output is correct
20 Correct 79 ms 5876 KB Output is correct
21 Correct 62 ms 5876 KB Output is correct
22 Correct 107 ms 6080 KB Output is correct
23 Correct 56 ms 6080 KB Output is correct
24 Correct 115 ms 6900 KB Output is correct
25 Correct 104 ms 6980 KB Output is correct
26 Correct 119 ms 6980 KB Output is correct
27 Correct 134 ms 8044 KB Output is correct
28 Correct 144 ms 8044 KB Output is correct
29 Correct 143 ms 8044 KB Output is correct
30 Correct 114 ms 8044 KB Output is correct
31 Correct 112 ms 8044 KB Output is correct
32 Correct 104 ms 8044 KB Output is correct
33 Correct 104 ms 8044 KB Output is correct
34 Correct 105 ms 8044 KB Output is correct
35 Correct 94 ms 8044 KB Output is correct
36 Correct 105 ms 8044 KB Output is correct
37 Correct 101 ms 8044 KB Output is correct
38 Correct 113 ms 8044 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 5 ms 2896 KB Output is correct
3 Correct 5 ms 2980 KB Output is correct
4 Correct 5 ms 2980 KB Output is correct
5 Correct 6 ms 2980 KB Output is correct
6 Correct 5 ms 3100 KB Output is correct
7 Correct 5 ms 3100 KB Output is correct
8 Correct 5 ms 3100 KB Output is correct
9 Correct 5 ms 3100 KB Output is correct
10 Correct 5 ms 3100 KB Output is correct
11 Correct 5 ms 3100 KB Output is correct
12 Correct 5 ms 3100 KB Output is correct
13 Correct 1 ms 3100 KB Output is correct
14 Correct 5 ms 3100 KB Output is correct
15 Correct 5 ms 3100 KB Output is correct
16 Correct 6 ms 3100 KB Output is correct
17 Correct 5 ms 3100 KB Output is correct
18 Correct 5 ms 3100 KB Output is correct
19 Correct 5 ms 3100 KB Output is correct
20 Correct 79 ms 5876 KB Output is correct
21 Correct 62 ms 5876 KB Output is correct
22 Correct 107 ms 6080 KB Output is correct
23 Correct 56 ms 6080 KB Output is correct
24 Correct 115 ms 6900 KB Output is correct
25 Correct 104 ms 6980 KB Output is correct
26 Correct 119 ms 6980 KB Output is correct
27 Correct 134 ms 8044 KB Output is correct
28 Correct 144 ms 8044 KB Output is correct
29 Correct 143 ms 8044 KB Output is correct
30 Correct 114 ms 8044 KB Output is correct
31 Correct 112 ms 8044 KB Output is correct
32 Correct 104 ms 8044 KB Output is correct
33 Correct 104 ms 8044 KB Output is correct
34 Correct 105 ms 8044 KB Output is correct
35 Correct 94 ms 8044 KB Output is correct
36 Correct 105 ms 8044 KB Output is correct
37 Correct 101 ms 8044 KB Output is correct
38 Correct 113 ms 8044 KB Output is correct
39 Execution timed out 2061 ms 8044 KB Time limit exceeded
40 Halted 0 ms 0 KB -