oj.uz

Submission #426037

# Submission time Handle Problem Language Result Execution time Memory
426037 2021-06-13T13:10:15 Z duality From Hacks to Snitches (BOI21_watchmen) C++11
15 / 100
 6000 ms 67076 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
int readInt() {
    char c;
    int n = 0;
    while ((c=getchar()) < '0');
    n = c-'0';
    while ((c=getchar()) >= '0') n = n*10+c-'0';
    return n;
}

vi adjList[250000];
pair<int,pii> p[250000];
vi dist[250000];
int done[250000];
priority_queue<pii> H;
int main() {
    int i,j;
    int N,M,K;
    int u,v,l;
    scanf("%d %d",&N,&M);
    for (i = 0; i < M; i++) {
        u = readInt();
        v = readInt();
        u--,v--;
        adjList[u].pb(v);
        adjList[v].pb(u);
    }
    scanf("%d",&K);
    for (i = 0; i < K; i++) {
        scanf("%d",&l);
        for (j = 0; j < l; j++) scanf("%d",&v),p[v-1] = mp(l,mp(j,i));
    }

    for (i = 0; i < N; i++) {
        if (p[i].first == 0) p[i].first = 1;
        dist[i].resize(p[i].first);
        fill(dist[i].begin(),dist[i].end(),-1);
    }
    dist[0][0] = 0,H.push(mp(0,0));
    while (!H.empty()) {
        int u = H.top().second;
        int d = -H.top().first;
        H.pop();

        if (d > dist[u][d % p[u].first]) continue;
        else if (u == N-1) {
            printf("%d\n",d);
            return 0;
        }
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i],t = d;
            for (j = 0; j < ((p[u].first == 1) ? p[v].first:1); j++) {
                if (done[v] && (p[u].first == 1)) break;
                int bad = 0;
                if (p[v].first != 1) {
                    if (((d+1) % p[v].first) == p[v].second.first) bad = 1;
                    if (((d % p[v].first) == p[v].second.first) && (p[u].second.second == p[v].second.second) \
                        && (p[u].second.first == ((p[v].second.first+1) % p[v].first))) bad = 1;
                }
                if (!bad) {
                    if ((dist[v][(d+1) % p[v].first] == -1) || (d+1 < dist[v][(d+1) % p[v].first])) {
                        dist[v][(d+1) % p[v].first] = d+1;
                        H.push(mp(-(d+1),v));
                    }
                }
                d++;
                if ((p[u].first != 1) && ((d % p[u].first) == p[u].second.first)) break;
            }
            if ((p[u].first == 1) && (p[v].first != 1)) done[v] = 1;
            d = t;
        }
    }
    printf("impossible\n");

    return 0;
}

Compilation message

watchmen.cpp: In function 'int main()':
watchmen.cpp:57:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for (i = 0; i < adjList[u].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~
watchmen.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
watchmen.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     scanf("%d",&K);
      |     ~~~~~^~~~~~~~~
watchmen.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d",&l);
      |         ~~~~~^~~~~~~~~
watchmen.cpp:38:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         for (j = 0; j < l; j++) scanf("%d",&v),p[v-1] = mp(l,mp(j,i));
      |                                 ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 13136 KB Output is correct
2 Correct 78 ms 19472 KB Output is correct
3 Correct 101 ms 19660 KB Output is correct
4 Correct 172 ms 19792 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 87 ms 19624 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 13172 KB Output is correct
2 Correct 96 ms 19540 KB Output is correct
3 Correct 97 ms 19656 KB Output is correct
4 Correct 176 ms 19848 KB Output is correct
5 Correct 10 ms 12108 KB Output is correct
6 Correct 92 ms 19548 KB Output is correct
7 Correct 91 ms 19180 KB Output is correct
8 Correct 87 ms 19436 KB Output is correct
9 Correct 89 ms 19228 KB Output is correct
10 Correct 104 ms 19672 KB Output is correct
11 Correct 124 ms 19544 KB Output is correct
12 Correct 107 ms 19508 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 13172 KB Output is correct
2 Correct 96 ms 19540 KB Output is correct
3 Correct 97 ms 19656 KB Output is correct
4 Correct 176 ms 19848 KB Output is correct
5 Correct 10 ms 12108 KB Output is correct
6 Correct 92 ms 19548 KB Output is correct
7 Correct 91 ms 19180 KB Output is correct
8 Correct 87 ms 19436 KB Output is correct
9 Correct 89 ms 19228 KB Output is correct
10 Correct 104 ms 19672 KB Output is correct
11 Correct 124 ms 19544 KB Output is correct
12 Correct 107 ms 19508 KB Output is correct
13 Correct 14 ms 13516 KB Output is correct
14 Correct 89 ms 19868 KB Output is correct
15 Correct 102 ms 19676 KB Output is correct
16 Correct 136 ms 19872 KB Output is correct
17 Correct 12 ms 12048 KB Output is correct
18 Correct 104 ms 19652 KB Output is correct
19 Correct 102 ms 19248 KB Output is correct
20 Correct 83 ms 19452 KB Output is correct
21 Correct 79 ms 19268 KB Output is correct
22 Correct 123 ms 19600 KB Output is correct
23 Correct 91 ms 19624 KB Output is correct
24 Correct 82 ms 19452 KB Output is correct
25 Correct 2166 ms 62720 KB Output is correct
26 Correct 1878 ms 67076 KB Output is correct
27 Correct 1591 ms 63668 KB Output is correct
28 Correct 998 ms 66996 KB Output is correct
29 Execution timed out 6040 ms 59420 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 13172 KB Output is correct
2 Correct 96 ms 19540 KB Output is correct
3 Correct 97 ms 19656 KB Output is correct
4 Correct 176 ms 19848 KB Output is correct
5 Correct 10 ms 12108 KB Output is correct
6 Correct 92 ms 19548 KB Output is correct
7 Correct 91 ms 19180 KB Output is correct
8 Correct 87 ms 19436 KB Output is correct
9 Correct 89 ms 19228 KB Output is correct
10 Correct 104 ms 19672 KB Output is correct
11 Correct 124 ms 19544 KB Output is correct
12 Correct 107 ms 19508 KB Output is correct
13 Correct 14 ms 13516 KB Output is correct
14 Correct 89 ms 19868 KB Output is correct
15 Correct 102 ms 19676 KB Output is correct
16 Correct 136 ms 19872 KB Output is correct
17 Correct 12 ms 12048 KB Output is correct
18 Correct 104 ms 19652 KB Output is correct
19 Correct 102 ms 19248 KB Output is correct
20 Correct 83 ms 19452 KB Output is correct
21 Correct 79 ms 19268 KB Output is correct
22 Correct 123 ms 19600 KB Output is correct
23 Correct 91 ms 19624 KB Output is correct
24 Correct 82 ms 19452 KB Output is correct
25 Correct 2166 ms 62720 KB Output is correct
26 Correct 1878 ms 67076 KB Output is correct
27 Correct 1591 ms 63668 KB Output is correct
28 Correct 998 ms 66996 KB Output is correct
29 Execution timed out 6040 ms 59420 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 13136 KB Output is correct
2 Correct 78 ms 19472 KB Output is correct
3 Correct 101 ms 19660 KB Output is correct
4 Correct 172 ms 19792 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 87 ms 19624 KB Output is correct
7 Correct 16 ms 13172 KB Output is correct
8 Correct 96 ms 19540 KB Output is correct
9 Correct 97 ms 19656 KB Output is correct
10 Correct 176 ms 19848 KB Output is correct
11 Correct 10 ms 12108 KB Output is correct
12 Correct 92 ms 19548 KB Output is correct
13 Correct 91 ms 19180 KB Output is correct
14 Correct 87 ms 19436 KB Output is correct
15 Correct 89 ms 19228 KB Output is correct
16 Correct 104 ms 19672 KB Output is correct
17 Correct 124 ms 19544 KB Output is correct
18 Correct 107 ms 19508 KB Output is correct
19 Correct 9 ms 12048 KB Output is correct
20 Correct 7 ms 11980 KB Output is correct
21 Correct 8 ms 11980 KB Output is correct
22 Correct 15 ms 13364 KB Output is correct
23 Correct 88 ms 19808 KB Output is correct
24 Correct 116 ms 19700 KB Output is correct
25 Correct 144 ms 19836 KB Output is correct
26 Correct 8 ms 12108 KB Output is correct
27 Correct 84 ms 19472 KB Output is correct
28 Correct 111 ms 19056 KB Output is correct
29 Correct 89 ms 19344 KB Output is correct
30 Correct 79 ms 18988 KB Output is correct
31 Correct 102 ms 19364 KB Output is correct
32 Correct 87 ms 19264 KB Output is correct
33 Correct 81 ms 19208 KB Output is correct
34 Correct 2200 ms 63416 KB Output is correct
35 Correct 2282 ms 59860 KB Output is correct
36 Correct 2374 ms 59900 KB Output is correct
37 Incorrect 1726 ms 65104 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 13136 KB Output is correct
2 Correct 78 ms 19472 KB Output is correct
3 Correct 101 ms 19660 KB Output is correct
4 Correct 172 ms 19792 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 87 ms 19624 KB Output is correct
7 Correct 16 ms 13172 KB Output is correct
8 Correct 96 ms 19540 KB Output is correct
9 Correct 97 ms 19656 KB Output is correct
10 Correct 176 ms 19848 KB Output is correct
11 Correct 10 ms 12108 KB Output is correct
12 Correct 92 ms 19548 KB Output is correct
13 Correct 91 ms 19180 KB Output is correct
14 Correct 87 ms 19436 KB Output is correct
15 Correct 89 ms 19228 KB Output is correct
16 Correct 104 ms 19672 KB Output is correct
17 Correct 124 ms 19544 KB Output is correct
18 Correct 107 ms 19508 KB Output is correct
19 Correct 14 ms 13516 KB Output is correct
20 Correct 89 ms 19868 KB Output is correct
21 Correct 102 ms 19676 KB Output is correct
22 Correct 136 ms 19872 KB Output is correct
23 Correct 12 ms 12048 KB Output is correct
24 Correct 104 ms 19652 KB Output is correct
25 Correct 102 ms 19248 KB Output is correct
26 Correct 83 ms 19452 KB Output is correct
27 Correct 79 ms 19268 KB Output is correct
28 Correct 123 ms 19600 KB Output is correct
29 Correct 91 ms 19624 KB Output is correct
30 Correct 82 ms 19452 KB Output is correct
31 Correct 2166 ms 62720 KB Output is correct
32 Correct 1878 ms 67076 KB Output is correct
33 Correct 1591 ms 63668 KB Output is correct
34 Correct 998 ms 66996 KB Output is correct
35 Execution timed out 6040 ms 59420 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 13136 KB Output is correct
2 Correct 78 ms 19472 KB Output is correct
3 Correct 101 ms 19660 KB Output is correct
4 Correct 172 ms 19792 KB Output is correct
5 Correct 8 ms 12108 KB Output is correct
6 Correct 87 ms 19624 KB Output is correct
7 Correct 16 ms 13172 KB Output is correct
8 Correct 96 ms 19540 KB Output is correct
9 Correct 97 ms 19656 KB Output is correct
10 Correct 176 ms 19848 KB Output is correct
11 Correct 10 ms 12108 KB Output is correct
12 Correct 92 ms 19548 KB Output is correct
13 Correct 91 ms 19180 KB Output is correct
14 Correct 87 ms 19436 KB Output is correct
15 Correct 89 ms 19228 KB Output is correct
16 Correct 104 ms 19672 KB Output is correct
17 Correct 124 ms 19544 KB Output is correct
18 Correct 107 ms 19508 KB Output is correct
19 Correct 14 ms 13516 KB Output is correct
20 Correct 89 ms 19868 KB Output is correct
21 Correct 102 ms 19676 KB Output is correct
22 Correct 136 ms 19872 KB Output is correct
23 Correct 12 ms 12048 KB Output is correct
24 Correct 104 ms 19652 KB Output is correct
25 Correct 102 ms 19248 KB Output is correct
26 Correct 83 ms 19452 KB Output is correct
27 Correct 79 ms 19268 KB Output is correct
28 Correct 123 ms 19600 KB Output is correct
29 Correct 91 ms 19624 KB Output is correct
30 Correct 82 ms 19452 KB Output is correct
31 Correct 2166 ms 62720 KB Output is correct
32 Correct 1878 ms 67076 KB Output is correct
33 Correct 1591 ms 63668 KB Output is correct
34 Correct 998 ms 66996 KB Output is correct
35 Execution timed out 6040 ms 59420 KB Time limit exceeded
36 Halted 0 ms 0 KB -