oj.uz

Submission #527362

# Submission time Handle Problem Language Result Execution time Memory
527362 2022-02-17T09:50:07 Z 79brue From Hacks to Snitches (BOI21_watchmen) C++14
15 / 100
 6000 ms 125568 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;
vector<dat> datList (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));
    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--){
                        int nf = (y+1+j)%cycleLen[nxt];
                        if(nf == cycleIdx[nxt]){
                            datList.push_back(dat(0, 0, y+j+1));
                            datList.back().nxt = prv;
                            prv = (int)datList.size() - 1;
                        }
                        else{
                            datList.push_back(dat(nxt, nf, y+j+1));
                            datList.back().nxt = prv;
                            prv = (int)datList.size() - 1;
                            visited[tmp.x][tmp.f] = 1;
                            dist[tmp.x][tmp.f] = tmp.y;
                        }
                    }
                    update(datList.back());
                }
            }
        }
        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:37:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
watchmen.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
watchmen.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     scanf("%d", &k);
      |     ~~~~~^~~~~~~~~~
watchmen.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         scanf("%d", &l);
      |         ~~~~~^~~~~~~~~~
watchmen.cpp:51:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |             scanf("%d", &tmp);
      |             ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 23748 KB Output is correct
2 Correct 99 ms 32968 KB Output is correct
3 Correct 110 ms 32624 KB Output is correct
4 Correct 140 ms 38696 KB Output is correct
5 Correct 13 ms 21852 KB Output is correct
6 Correct 91 ms 32516 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 23760 KB Output is correct
2 Correct 97 ms 33120 KB Output is correct
3 Correct 93 ms 32612 KB Output is correct
4 Correct 116 ms 38584 KB Output is correct
5 Correct 12 ms 21828 KB Output is correct
6 Correct 92 ms 32612 KB Output is correct
7 Correct 80 ms 32068 KB Output is correct
8 Correct 82 ms 32216 KB Output is correct
9 Correct 87 ms 32236 KB Output is correct
10 Correct 114 ms 44612 KB Output is correct
11 Correct 106 ms 35328 KB Output is correct
12 Correct 82 ms 32396 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 23760 KB Output is correct
2 Correct 97 ms 33120 KB Output is correct
3 Correct 93 ms 32612 KB Output is correct
4 Correct 116 ms 38584 KB Output is correct
5 Correct 12 ms 21828 KB Output is correct
6 Correct 92 ms 32612 KB Output is correct
7 Correct 80 ms 32068 KB Output is correct
8 Correct 82 ms 32216 KB Output is correct
9 Correct 87 ms 32236 KB Output is correct
10 Correct 114 ms 44612 KB Output is correct
11 Correct 106 ms 35328 KB Output is correct
12 Correct 82 ms 32396 KB Output is correct
13 Correct 27 ms 23744 KB Output is correct
14 Correct 96 ms 33000 KB Output is correct
15 Correct 82 ms 32640 KB Output is correct
16 Correct 127 ms 38556 KB Output is correct
17 Correct 13 ms 21828 KB Output is correct
18 Correct 92 ms 32536 KB Output is correct
19 Correct 83 ms 32064 KB Output is correct
20 Correct 85 ms 32264 KB Output is correct
21 Correct 83 ms 32136 KB Output is correct
22 Correct 117 ms 44580 KB Output is correct
23 Correct 104 ms 35432 KB Output is correct
24 Correct 80 ms 32416 KB Output is correct
25 Correct 1797 ms 80908 KB Output is correct
26 Correct 1610 ms 85132 KB Output is correct
27 Correct 1567 ms 81252 KB Output is correct
28 Correct 1259 ms 84780 KB Output is correct
29 Execution timed out 6076 ms 125568 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 23760 KB Output is correct
2 Correct 97 ms 33120 KB Output is correct
3 Correct 93 ms 32612 KB Output is correct
4 Correct 116 ms 38584 KB Output is correct
5 Correct 12 ms 21828 KB Output is correct
6 Correct 92 ms 32612 KB Output is correct
7 Correct 80 ms 32068 KB Output is correct
8 Correct 82 ms 32216 KB Output is correct
9 Correct 87 ms 32236 KB Output is correct
10 Correct 114 ms 44612 KB Output is correct
11 Correct 106 ms 35328 KB Output is correct
12 Correct 82 ms 32396 KB Output is correct
13 Correct 27 ms 23744 KB Output is correct
14 Correct 96 ms 33000 KB Output is correct
15 Correct 82 ms 32640 KB Output is correct
16 Correct 127 ms 38556 KB Output is correct
17 Correct 13 ms 21828 KB Output is correct
18 Correct 92 ms 32536 KB Output is correct
19 Correct 83 ms 32064 KB Output is correct
20 Correct 85 ms 32264 KB Output is correct
21 Correct 83 ms 32136 KB Output is correct
22 Correct 117 ms 44580 KB Output is correct
23 Correct 104 ms 35432 KB Output is correct
24 Correct 80 ms 32416 KB Output is correct
25 Correct 1797 ms 80908 KB Output is correct
26 Correct 1610 ms 85132 KB Output is correct
27 Correct 1567 ms 81252 KB Output is correct
28 Correct 1259 ms 84780 KB Output is correct
29 Execution timed out 6076 ms 125568 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 23748 KB Output is correct
2 Correct 99 ms 32968 KB Output is correct
3 Correct 110 ms 32624 KB Output is correct
4 Correct 140 ms 38696 KB Output is correct
5 Correct 13 ms 21852 KB Output is correct
6 Correct 91 ms 32516 KB Output is correct
7 Correct 31 ms 23760 KB Output is correct
8 Correct 97 ms 33120 KB Output is correct
9 Correct 93 ms 32612 KB Output is correct
10 Correct 116 ms 38584 KB Output is correct
11 Correct 12 ms 21828 KB Output is correct
12 Correct 92 ms 32612 KB Output is correct
13 Correct 80 ms 32068 KB Output is correct
14 Correct 82 ms 32216 KB Output is correct
15 Correct 87 ms 32236 KB Output is correct
16 Correct 114 ms 44612 KB Output is correct
17 Correct 106 ms 35328 KB Output is correct
18 Correct 82 ms 32396 KB Output is correct
19 Correct 10 ms 21824 KB Output is correct
20 Correct 10 ms 21836 KB Output is correct
21 Correct 12 ms 21728 KB Output is correct
22 Correct 38 ms 23756 KB Output is correct
23 Correct 92 ms 32964 KB Output is correct
24 Correct 84 ms 32780 KB Output is correct
25 Correct 114 ms 38480 KB Output is correct
26 Correct 12 ms 21912 KB Output is correct
27 Correct 89 ms 32644 KB Output is correct
28 Correct 79 ms 32132 KB Output is correct
29 Correct 80 ms 32248 KB Output is correct
30 Correct 84 ms 32100 KB Output is correct
31 Correct 123 ms 44656 KB Output is correct
32 Correct 128 ms 35284 KB Output is correct
33 Correct 80 ms 32340 KB Output is correct
34 Correct 1822 ms 79716 KB Output is correct
35 Correct 1870 ms 76296 KB Output is correct
36 Correct 1841 ms 76400 KB Output is correct
37 Incorrect 1562 ms 81448 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 23748 KB Output is correct
2 Correct 99 ms 32968 KB Output is correct
3 Correct 110 ms 32624 KB Output is correct
4 Correct 140 ms 38696 KB Output is correct
5 Correct 13 ms 21852 KB Output is correct
6 Correct 91 ms 32516 KB Output is correct
7 Correct 31 ms 23760 KB Output is correct
8 Correct 97 ms 33120 KB Output is correct
9 Correct 93 ms 32612 KB Output is correct
10 Correct 116 ms 38584 KB Output is correct
11 Correct 12 ms 21828 KB Output is correct
12 Correct 92 ms 32612 KB Output is correct
13 Correct 80 ms 32068 KB Output is correct
14 Correct 82 ms 32216 KB Output is correct
15 Correct 87 ms 32236 KB Output is correct
16 Correct 114 ms 44612 KB Output is correct
17 Correct 106 ms 35328 KB Output is correct
18 Correct 82 ms 32396 KB Output is correct
19 Correct 27 ms 23744 KB Output is correct
20 Correct 96 ms 33000 KB Output is correct
21 Correct 82 ms 32640 KB Output is correct
22 Correct 127 ms 38556 KB Output is correct
23 Correct 13 ms 21828 KB Output is correct
24 Correct 92 ms 32536 KB Output is correct
25 Correct 83 ms 32064 KB Output is correct
26 Correct 85 ms 32264 KB Output is correct
27 Correct 83 ms 32136 KB Output is correct
28 Correct 117 ms 44580 KB Output is correct
29 Correct 104 ms 35432 KB Output is correct
30 Correct 80 ms 32416 KB Output is correct
31 Correct 1797 ms 80908 KB Output is correct
32 Correct 1610 ms 85132 KB Output is correct
33 Correct 1567 ms 81252 KB Output is correct
34 Correct 1259 ms 84780 KB Output is correct
35 Execution timed out 6076 ms 125568 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 23748 KB Output is correct
2 Correct 99 ms 32968 KB Output is correct
3 Correct 110 ms 32624 KB Output is correct
4 Correct 140 ms 38696 KB Output is correct
5 Correct 13 ms 21852 KB Output is correct
6 Correct 91 ms 32516 KB Output is correct
7 Correct 31 ms 23760 KB Output is correct
8 Correct 97 ms 33120 KB Output is correct
9 Correct 93 ms 32612 KB Output is correct
10 Correct 116 ms 38584 KB Output is correct
11 Correct 12 ms 21828 KB Output is correct
12 Correct 92 ms 32612 KB Output is correct
13 Correct 80 ms 32068 KB Output is correct
14 Correct 82 ms 32216 KB Output is correct
15 Correct 87 ms 32236 KB Output is correct
16 Correct 114 ms 44612 KB Output is correct
17 Correct 106 ms 35328 KB Output is correct
18 Correct 82 ms 32396 KB Output is correct
19 Correct 27 ms 23744 KB Output is correct
20 Correct 96 ms 33000 KB Output is correct
21 Correct 82 ms 32640 KB Output is correct
22 Correct 127 ms 38556 KB Output is correct
23 Correct 13 ms 21828 KB Output is correct
24 Correct 92 ms 32536 KB Output is correct
25 Correct 83 ms 32064 KB Output is correct
26 Correct 85 ms 32264 KB Output is correct
27 Correct 83 ms 32136 KB Output is correct
28 Correct 117 ms 44580 KB Output is correct
29 Correct 104 ms 35432 KB Output is correct
30 Correct 80 ms 32416 KB Output is correct
31 Correct 1797 ms 80908 KB Output is correct
32 Correct 1610 ms 85132 KB Output is correct
33 Correct 1567 ms 81252 KB Output is correct
34 Correct 1259 ms 84780 KB Output is correct
35 Execution timed out 6076 ms 125568 KB Time limit exceeded
36 Halted 0 ms 0 KB -