oj.uz

Submission #527400

# Submission time Handle Problem Language Result Execution time Memory
527400 2022-02-17T11:01:50 Z 79brue From Hacks to Snitches (BOI21_watchmen) C++14
15 / 100
 6000 ms 240124 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct dat{
    int x, f, y;
    int nxt=0;
    dat(){}
    dat(int x, int f, int y): x(x), f(f), y(y){}

    bool operator<(const dat &r)const{
        return y>r.y;
    }
};

int n, m, k;
vector<int> link[250002];
int cycleLen[250002];
int cycleIdx[250002];
vector<int> dist[250002];
vector<bool> visited[250002];
queue<dat> pq;
dat datList[10000000];
int datSize = 3;

void update(dat tmp){
    if(tmp.x){
        if(visited[tmp.x][tmp.f]) return;
        visited[tmp.x][tmp.f] = 1;
        dist[tmp.x][tmp.f] = tmp.y;
    }
    pq.push(tmp);
}

int main(){
    scanf("%d %d", &n, &m);
    for(int i=1; i<=m; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        link[x].push_back(y);
        link[y].push_back(x);
    }

    scanf("%d", &k);
    while(k--){
        int l;
        scanf("%d", &l);
        for(int j=0; j<l; j++){
            int tmp;
            scanf("%d", &tmp);
            cycleLen[tmp] = l;
            cycleIdx[tmp] = j;
        }
    }

    for(int i=1; i<=n; i++){
        if(!cycleLen[i]) cycleLen[i] = 1;
        dist[i] = vector<int> (cycleLen[i], 1e9);
        visited[i].resize(cycleLen[i]);
    }

    update(dat(1, 0, 0));

    int pqCnt = 0;
    while(!pq.empty()){
        dat tmp = pq.front(); pq.pop();
        int x = tmp.x, f = tmp.f, y = tmp.y;
//        printf("%d %d: %d\n", x, f, y);
//        assert(f < cycleLen[x]);

        if(tmp.nxt){
            pq.push(datList[tmp.nxt]);
        }
        if(tmp.x == 0) continue;

        if(x==n){
            printf("%d", y);
            return 0;
        }

        if(cycleLen[x] == 1){
            for(int nxt: link[x]){
                if(cycleLen[nxt] == 1) update(dat(nxt, 0, y+1));
                else{
                    if(visited[nxt][0] || visited[nxt][1] || visited[nxt][2]) continue;
                    int prv = 0;
                    for(int j=cycleLen[nxt]-1; j>=0; j--){
                        assert(++pqCnt <= 3000000);
                        int nf = (y+1+j)%cycleLen[nxt];
                        if(nf == cycleIdx[nxt]){
                            datList[datSize++] = dat(0, 0, y+j+1);
                            datList[datSize-1].nxt = prv;
                            prv = datSize-1;
                        }
                        else{
                            datList[datSize++] = (dat(nxt, nf, y+j+1));
                            datList[datSize-1].nxt = prv;
                            prv = datSize-1;
                            visited[tmp.x][tmp.f] = 1;
                            dist[tmp.x][tmp.f] = tmp.y;
                        }
                    }
                    update(datList[datSize-1]);
                }
            }
        }
        else{
            for(int nxt: link[x]){
                if(cycleLen[nxt] == 1) update(dat(nxt, 0, y+1));
                else{
                    int nf = (f+1)%cycleLen[nxt];
                    if(nf == cycleIdx[nxt]) continue;
                    if(nf == cycleIdx[x] && f%cycleLen[nxt] == cycleIdx[nxt]) continue;
                    update(dat(nxt, nf, y+1));
                }
            }
        }
    }

    printf("impossible");
}

Compilation message

watchmen.cpp: In function 'int main()':
watchmen.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
watchmen.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
watchmen.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     scanf("%d", &k);
      |     ~~~~~^~~~~~~~~~
watchmen.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         scanf("%d", &l);
      |         ~~~~~^~~~~~~~~~
watchmen.cpp:52:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |             scanf("%d", &tmp);
      |             ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 179268 KB Output is correct
2 Correct 138 ms 188404 KB Output is correct
3 Correct 130 ms 187580 KB Output is correct
4 Correct 165 ms 187712 KB Output is correct
5 Correct 64 ms 178432 KB Output is correct
6 Correct 133 ms 187616 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 179268 KB Output is correct
2 Correct 142 ms 188472 KB Output is correct
3 Correct 135 ms 187592 KB Output is correct
4 Correct 154 ms 187708 KB Output is correct
5 Correct 66 ms 178352 KB Output is correct
6 Correct 129 ms 187604 KB Output is correct
7 Correct 131 ms 187476 KB Output is correct
8 Correct 127 ms 187484 KB Output is correct
9 Correct 129 ms 187528 KB Output is correct
10 Correct 159 ms 187672 KB Output is correct
11 Correct 141 ms 187604 KB Output is correct
12 Correct 128 ms 187688 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 179268 KB Output is correct
2 Correct 142 ms 188472 KB Output is correct
3 Correct 135 ms 187592 KB Output is correct
4 Correct 154 ms 187708 KB Output is correct
5 Correct 66 ms 178352 KB Output is correct
6 Correct 129 ms 187604 KB Output is correct
7 Correct 131 ms 187476 KB Output is correct
8 Correct 127 ms 187484 KB Output is correct
9 Correct 129 ms 187528 KB Output is correct
10 Correct 159 ms 187672 KB Output is correct
11 Correct 141 ms 187604 KB Output is correct
12 Correct 128 ms 187688 KB Output is correct
13 Correct 82 ms 179288 KB Output is correct
14 Correct 146 ms 188408 KB Output is correct
15 Correct 138 ms 187520 KB Output is correct
16 Correct 189 ms 187664 KB Output is correct
17 Correct 75 ms 178432 KB Output is correct
18 Correct 135 ms 187596 KB Output is correct
19 Correct 132 ms 187692 KB Output is correct
20 Correct 134 ms 187460 KB Output is correct
21 Correct 142 ms 187560 KB Output is correct
22 Correct 154 ms 187692 KB Output is correct
23 Correct 137 ms 187504 KB Output is correct
24 Correct 128 ms 187592 KB Output is correct
25 Correct 1640 ms 235700 KB Output is correct
26 Correct 1555 ms 240124 KB Output is correct
27 Correct 1504 ms 235676 KB Output is correct
28 Correct 1200 ms 239816 KB Output is correct
29 Execution timed out 6079 ms 231624 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 179268 KB Output is correct
2 Correct 142 ms 188472 KB Output is correct
3 Correct 135 ms 187592 KB Output is correct
4 Correct 154 ms 187708 KB Output is correct
5 Correct 66 ms 178352 KB Output is correct
6 Correct 129 ms 187604 KB Output is correct
7 Correct 131 ms 187476 KB Output is correct
8 Correct 127 ms 187484 KB Output is correct
9 Correct 129 ms 187528 KB Output is correct
10 Correct 159 ms 187672 KB Output is correct
11 Correct 141 ms 187604 KB Output is correct
12 Correct 128 ms 187688 KB Output is correct
13 Correct 82 ms 179288 KB Output is correct
14 Correct 146 ms 188408 KB Output is correct
15 Correct 138 ms 187520 KB Output is correct
16 Correct 189 ms 187664 KB Output is correct
17 Correct 75 ms 178432 KB Output is correct
18 Correct 135 ms 187596 KB Output is correct
19 Correct 132 ms 187692 KB Output is correct
20 Correct 134 ms 187460 KB Output is correct
21 Correct 142 ms 187560 KB Output is correct
22 Correct 154 ms 187692 KB Output is correct
23 Correct 137 ms 187504 KB Output is correct
24 Correct 128 ms 187592 KB Output is correct
25 Correct 1640 ms 235700 KB Output is correct
26 Correct 1555 ms 240124 KB Output is correct
27 Correct 1504 ms 235676 KB Output is correct
28 Correct 1200 ms 239816 KB Output is correct
29 Execution timed out 6079 ms 231624 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 179268 KB Output is correct
2 Correct 138 ms 188404 KB Output is correct
3 Correct 130 ms 187580 KB Output is correct
4 Correct 165 ms 187712 KB Output is correct
5 Correct 64 ms 178432 KB Output is correct
6 Correct 133 ms 187616 KB Output is correct
7 Correct 79 ms 179268 KB Output is correct
8 Correct 142 ms 188472 KB Output is correct
9 Correct 135 ms 187592 KB Output is correct
10 Correct 154 ms 187708 KB Output is correct
11 Correct 66 ms 178352 KB Output is correct
12 Correct 129 ms 187604 KB Output is correct
13 Correct 131 ms 187476 KB Output is correct
14 Correct 127 ms 187484 KB Output is correct
15 Correct 129 ms 187528 KB Output is correct
16 Correct 159 ms 187672 KB Output is correct
17 Correct 141 ms 187604 KB Output is correct
18 Correct 128 ms 187688 KB Output is correct
19 Correct 65 ms 178364 KB Output is correct
20 Correct 68 ms 178328 KB Output is correct
21 Correct 67 ms 178244 KB Output is correct
22 Correct 79 ms 179268 KB Output is correct
23 Correct 136 ms 188360 KB Output is correct
24 Correct 133 ms 187600 KB Output is correct
25 Correct 156 ms 187748 KB Output is correct
26 Correct 65 ms 178380 KB Output is correct
27 Correct 132 ms 187500 KB Output is correct
28 Correct 128 ms 187512 KB Output is correct
29 Correct 135 ms 187780 KB Output is correct
30 Correct 129 ms 187452 KB Output is correct
31 Correct 147 ms 187612 KB Output is correct
32 Correct 136 ms 187588 KB Output is correct
33 Correct 136 ms 187520 KB Output is correct
34 Correct 1667 ms 235848 KB Output is correct
35 Correct 1775 ms 232656 KB Output is correct
36 Correct 1745 ms 232700 KB Output is correct
37 Incorrect 1531 ms 237836 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 179268 KB Output is correct
2 Correct 138 ms 188404 KB Output is correct
3 Correct 130 ms 187580 KB Output is correct
4 Correct 165 ms 187712 KB Output is correct
5 Correct 64 ms 178432 KB Output is correct
6 Correct 133 ms 187616 KB Output is correct
7 Correct 79 ms 179268 KB Output is correct
8 Correct 142 ms 188472 KB Output is correct
9 Correct 135 ms 187592 KB Output is correct
10 Correct 154 ms 187708 KB Output is correct
11 Correct 66 ms 178352 KB Output is correct
12 Correct 129 ms 187604 KB Output is correct
13 Correct 131 ms 187476 KB Output is correct
14 Correct 127 ms 187484 KB Output is correct
15 Correct 129 ms 187528 KB Output is correct
16 Correct 159 ms 187672 KB Output is correct
17 Correct 141 ms 187604 KB Output is correct
18 Correct 128 ms 187688 KB Output is correct
19 Correct 82 ms 179288 KB Output is correct
20 Correct 146 ms 188408 KB Output is correct
21 Correct 138 ms 187520 KB Output is correct
22 Correct 189 ms 187664 KB Output is correct
23 Correct 75 ms 178432 KB Output is correct
24 Correct 135 ms 187596 KB Output is correct
25 Correct 132 ms 187692 KB Output is correct
26 Correct 134 ms 187460 KB Output is correct
27 Correct 142 ms 187560 KB Output is correct
28 Correct 154 ms 187692 KB Output is correct
29 Correct 137 ms 187504 KB Output is correct
30 Correct 128 ms 187592 KB Output is correct
31 Correct 1640 ms 235700 KB Output is correct
32 Correct 1555 ms 240124 KB Output is correct
33 Correct 1504 ms 235676 KB Output is correct
34 Correct 1200 ms 239816 KB Output is correct
35 Execution timed out 6079 ms 231624 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 179268 KB Output is correct
2 Correct 138 ms 188404 KB Output is correct
3 Correct 130 ms 187580 KB Output is correct
4 Correct 165 ms 187712 KB Output is correct
5 Correct 64 ms 178432 KB Output is correct
6 Correct 133 ms 187616 KB Output is correct
7 Correct 79 ms 179268 KB Output is correct
8 Correct 142 ms 188472 KB Output is correct
9 Correct 135 ms 187592 KB Output is correct
10 Correct 154 ms 187708 KB Output is correct
11 Correct 66 ms 178352 KB Output is correct
12 Correct 129 ms 187604 KB Output is correct
13 Correct 131 ms 187476 KB Output is correct
14 Correct 127 ms 187484 KB Output is correct
15 Correct 129 ms 187528 KB Output is correct
16 Correct 159 ms 187672 KB Output is correct
17 Correct 141 ms 187604 KB Output is correct
18 Correct 128 ms 187688 KB Output is correct
19 Correct 82 ms 179288 KB Output is correct
20 Correct 146 ms 188408 KB Output is correct
21 Correct 138 ms 187520 KB Output is correct
22 Correct 189 ms 187664 KB Output is correct
23 Correct 75 ms 178432 KB Output is correct
24 Correct 135 ms 187596 KB Output is correct
25 Correct 132 ms 187692 KB Output is correct
26 Correct 134 ms 187460 KB Output is correct
27 Correct 142 ms 187560 KB Output is correct
28 Correct 154 ms 187692 KB Output is correct
29 Correct 137 ms 187504 KB Output is correct
30 Correct 128 ms 187592 KB Output is correct
31 Correct 1640 ms 235700 KB Output is correct
32 Correct 1555 ms 240124 KB Output is correct
33 Correct 1504 ms 235676 KB Output is correct
34 Correct 1200 ms 239816 KB Output is correct
35 Execution timed out 6079 ms 231624 KB Time limit exceeded
36 Halted 0 ms 0 KB -