oj.uz

Submission #47784

# Submission time Handle Problem Language Result Execution time Memory
47784 2018-05-07T08:32:03 Z Talant Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 478 ms 12660 KB 
#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)

using namespace std;

const int inf = (int)1e9 + 7;
const int N = (int)3e5 + 7;

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

int d[N],u[N];

int n,m,qy;
int l,r;
int t,y,x;
int ans = -1;
int cnt;

void djk(int v) {
      for (int i = 1; i <= n; i ++)
            d[i] = -inf;

      d[v] = 0;

      q.push({0,v});

      while (!q.empty()) {
            int v = q.top().sc,cur = q.top().fr;
            q.pop();

            if (!u[v])
                  ans = max(ans,d[v]);

            if (cur < d[v])
                  continue;

            for (auto to : g[v]) {
                  if (d[v] + 1 > d[to]) {
                        d[to] = d[v] + 1;
                        q.push({d[to],to});
                  }
                  cnt ++;
            }
            cnt ++;
            if (cnt > (int)1e7) {
                  cout << ans << endl;
                  exit(0);
            }
      }
}
main () {
      scan(n);scan(m);scan(qy);

      for (int i = 1; i <= m; i ++) {
            scan(l);scan(r);
            g[r].pb(l);
      }

      scan(t);scan(y);

      if (y == n) {
            cout << "-1";
            return 0;
      }

      for (int i = 1; i <= y; i ++) {
            scan(x);
            u[x] = 1;
      }

      djk(t);

      printf("%d\n", ans);

      return 0;
}

Compilation message

bitaro.cpp:60:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
bitaro.cpp: In function 'int main()':
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:61:7: note: in expansion of macro 'scan'
       scan(n);scan(m);scan(qy);
       ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:61:15: note: in expansion of macro 'scan'
       scan(n);scan(m);scan(qy);
               ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:61:23: note: in expansion of macro 'scan'
       scan(n);scan(m);scan(qy);
                       ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:64:13: note: in expansion of macro 'scan'
             scan(l);scan(r);
             ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:64:21: note: in expansion of macro 'scan'
             scan(l);scan(r);
                     ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:68:7: note: in expansion of macro 'scan'
       scan(t);scan(y);
       ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:68:15: note: in expansion of macro 'scan'
       scan(t);scan(y);
               ^~~~
bitaro.cpp:10:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define scan(a) scanf ("%d", &a)
                 ~~~~~~^~~~~~~~~~
bitaro.cpp:76:13: note: in expansion of macro 'scan'
             scan(x);
             ^~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7504 KB Output is correct
3 Correct 21 ms 7504 KB Output is correct
4 Correct 9 ms 7504 KB Output is correct
5 Correct 11 ms 7504 KB Output is correct
6 Correct 11 ms 7664 KB Output is correct
7 Correct 13 ms 7664 KB Output is correct
8 Correct 11 ms 7664 KB Output is correct
9 Correct 10 ms 7664 KB Output is correct
10 Correct 9 ms 7664 KB Output is correct
11 Correct 9 ms 7664 KB Output is correct
12 Correct 9 ms 7664 KB Output is correct
13 Correct 9 ms 7664 KB Output is correct
14 Correct 10 ms 7664 KB Output is correct
15 Correct 10 ms 7664 KB Output is correct
16 Correct 12 ms 7664 KB Output is correct
17 Correct 10 ms 7664 KB Output is correct
18 Correct 9 ms 7784 KB Output is correct
19 Correct 10 ms 7784 KB Output is correct
20 Correct 76 ms 9464 KB Output is correct
21 Correct 70 ms 9464 KB Output is correct
22 Correct 93 ms 10068 KB Output is correct
23 Correct 63 ms 10068 KB Output is correct
24 Correct 111 ms 11264 KB Output is correct
25 Correct 123 ms 11264 KB Output is correct
26 Correct 114 ms 11264 KB Output is correct
27 Correct 125 ms 12408 KB Output is correct
28 Correct 122 ms 12408 KB Output is correct
29 Correct 129 ms 12660 KB Output is correct
30 Correct 119 ms 12660 KB Output is correct
31 Correct 114 ms 12660 KB Output is correct
32 Correct 103 ms 12660 KB Output is correct
33 Correct 95 ms 12660 KB Output is correct
34 Correct 113 ms 12660 KB Output is correct
35 Correct 96 ms 12660 KB Output is correct
36 Incorrect 478 ms 12660 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7504 KB Output is correct
3 Correct 21 ms 7504 KB Output is correct
4 Correct 9 ms 7504 KB Output is correct
5 Correct 11 ms 7504 KB Output is correct
6 Correct 11 ms 7664 KB Output is correct
7 Correct 13 ms 7664 KB Output is correct
8 Correct 11 ms 7664 KB Output is correct
9 Correct 10 ms 7664 KB Output is correct
10 Correct 9 ms 7664 KB Output is correct
11 Correct 9 ms 7664 KB Output is correct
12 Correct 9 ms 7664 KB Output is correct
13 Correct 9 ms 7664 KB Output is correct
14 Correct 10 ms 7664 KB Output is correct
15 Correct 10 ms 7664 KB Output is correct
16 Correct 12 ms 7664 KB Output is correct
17 Correct 10 ms 7664 KB Output is correct
18 Correct 9 ms 7784 KB Output is correct
19 Correct 10 ms 7784 KB Output is correct
20 Correct 76 ms 9464 KB Output is correct
21 Correct 70 ms 9464 KB Output is correct
22 Correct 93 ms 10068 KB Output is correct
23 Correct 63 ms 10068 KB Output is correct
24 Correct 111 ms 11264 KB Output is correct
25 Correct 123 ms 11264 KB Output is correct
26 Correct 114 ms 11264 KB Output is correct
27 Correct 125 ms 12408 KB Output is correct
28 Correct 122 ms 12408 KB Output is correct
29 Correct 129 ms 12660 KB Output is correct
30 Correct 119 ms 12660 KB Output is correct
31 Correct 114 ms 12660 KB Output is correct
32 Correct 103 ms 12660 KB Output is correct
33 Correct 95 ms 12660 KB Output is correct
34 Correct 113 ms 12660 KB Output is correct
35 Correct 96 ms 12660 KB Output is correct
36 Incorrect 478 ms 12660 KB Output isn't correct
37 Halted 0 ms 0 KB -