oj.uz

답안 #527365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527365 2022-02-17T09:54:11 Z 79brue From Hacks to Snitches (BOI21_watchmen) C++14
15 / 100
 6000 ms 125780 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));

    int pqCnt = 0;
    while(!pq.empty()){
        dat tmp = pq.front(); pq.pop();
        int x = tmp.x, f = tmp.f, y = tmp.y;
        assert(++pqCnt <= 10000000);
//        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

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 23820 KB Output is correct
2 Correct 91 ms 32728 KB Output is correct
3 Correct 82 ms 32052 KB Output is correct
4 Correct 110 ms 37904 KB Output is correct
5 Correct 12 ms 21836 KB Output is correct
6 Correct 87 ms 32028 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23812 KB Output is correct
2 Correct 100 ms 32408 KB Output is correct
3 Correct 88 ms 31960 KB Output is correct
4 Correct 124 ms 37904 KB Output is correct
5 Correct 13 ms 21836 KB Output is correct
6 Correct 86 ms 31968 KB Output is correct
7 Correct 83 ms 31496 KB Output is correct
8 Correct 80 ms 31680 KB Output is correct
9 Correct 84 ms 31596 KB Output is correct
10 Correct 119 ms 44016 KB Output is correct
11 Correct 104 ms 34804 KB Output is correct
12 Correct 81 ms 31784 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23812 KB Output is correct
2 Correct 100 ms 32408 KB Output is correct
3 Correct 88 ms 31960 KB Output is correct
4 Correct 124 ms 37904 KB Output is correct
5 Correct 13 ms 21836 KB Output is correct
6 Correct 86 ms 31968 KB Output is correct
7 Correct 83 ms 31496 KB Output is correct
8 Correct 80 ms 31680 KB Output is correct
9 Correct 84 ms 31596 KB Output is correct
10 Correct 119 ms 44016 KB Output is correct
11 Correct 104 ms 34804 KB Output is correct
12 Correct 81 ms 31784 KB Output is correct
13 Correct 25 ms 23820 KB Output is correct
14 Correct 96 ms 32460 KB Output is correct
15 Correct 91 ms 31936 KB Output is correct
16 Correct 125 ms 37888 KB Output is correct
17 Correct 12 ms 21836 KB Output is correct
18 Correct 87 ms 31928 KB Output is correct
19 Correct 86 ms 31496 KB Output is correct
20 Correct 109 ms 31680 KB Output is correct
21 Correct 108 ms 31556 KB Output is correct
22 Correct 114 ms 44068 KB Output is correct
23 Correct 104 ms 34752 KB Output is correct
24 Correct 94 ms 31812 KB Output is correct
25 Correct 1980 ms 80076 KB Output is correct
26 Correct 1612 ms 84164 KB Output is correct
27 Correct 1634 ms 80580 KB Output is correct
28 Correct 1285 ms 83980 KB Output is correct
29 Execution timed out 6096 ms 125780 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23812 KB Output is correct
2 Correct 100 ms 32408 KB Output is correct
3 Correct 88 ms 31960 KB Output is correct
4 Correct 124 ms 37904 KB Output is correct
5 Correct 13 ms 21836 KB Output is correct
6 Correct 86 ms 31968 KB Output is correct
7 Correct 83 ms 31496 KB Output is correct
8 Correct 80 ms 31680 KB Output is correct
9 Correct 84 ms 31596 KB Output is correct
10 Correct 119 ms 44016 KB Output is correct
11 Correct 104 ms 34804 KB Output is correct
12 Correct 81 ms 31784 KB Output is correct
13 Correct 25 ms 23820 KB Output is correct
14 Correct 96 ms 32460 KB Output is correct
15 Correct 91 ms 31936 KB Output is correct
16 Correct 125 ms 37888 KB Output is correct
17 Correct 12 ms 21836 KB Output is correct
18 Correct 87 ms 31928 KB Output is correct
19 Correct 86 ms 31496 KB Output is correct
20 Correct 109 ms 31680 KB Output is correct
21 Correct 108 ms 31556 KB Output is correct
22 Correct 114 ms 44068 KB Output is correct
23 Correct 104 ms 34752 KB Output is correct
24 Correct 94 ms 31812 KB Output is correct
25 Correct 1980 ms 80076 KB Output is correct
26 Correct 1612 ms 84164 KB Output is correct
27 Correct 1634 ms 80580 KB Output is correct
28 Correct 1285 ms 83980 KB Output is correct
29 Execution timed out 6096 ms 125780 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 23820 KB Output is correct
2 Correct 91 ms 32728 KB Output is correct
3 Correct 82 ms 32052 KB Output is correct
4 Correct 110 ms 37904 KB Output is correct
5 Correct 12 ms 21836 KB Output is correct
6 Correct 87 ms 32028 KB Output is correct
7 Correct 26 ms 23812 KB Output is correct
8 Correct 100 ms 32408 KB Output is correct
9 Correct 88 ms 31960 KB Output is correct
10 Correct 124 ms 37904 KB Output is correct
11 Correct 13 ms 21836 KB Output is correct
12 Correct 86 ms 31968 KB Output is correct
13 Correct 83 ms 31496 KB Output is correct
14 Correct 80 ms 31680 KB Output is correct
15 Correct 84 ms 31596 KB Output is correct
16 Correct 119 ms 44016 KB Output is correct
17 Correct 104 ms 34804 KB Output is correct
18 Correct 81 ms 31784 KB Output is correct
19 Correct 13 ms 21964 KB Output is correct
20 Correct 13 ms 21784 KB Output is correct
21 Correct 11 ms 21836 KB Output is correct
22 Correct 28 ms 23748 KB Output is correct
23 Correct 123 ms 32468 KB Output is correct
24 Correct 81 ms 32052 KB Output is correct
25 Correct 115 ms 38012 KB Output is correct
26 Correct 12 ms 21880 KB Output is correct
27 Correct 87 ms 32036 KB Output is correct
28 Correct 94 ms 31504 KB Output is correct
29 Correct 99 ms 31584 KB Output is correct
30 Correct 85 ms 31556 KB Output is correct
31 Correct 115 ms 44068 KB Output is correct
32 Correct 95 ms 34792 KB Output is correct
33 Correct 98 ms 31792 KB Output is correct
34 Correct 1817 ms 79808 KB Output is correct
35 Correct 1911 ms 76852 KB Output is correct
36 Correct 1888 ms 76604 KB Output is correct
37 Incorrect 1709 ms 81832 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 23820 KB Output is correct
2 Correct 91 ms 32728 KB Output is correct
3 Correct 82 ms 32052 KB Output is correct
4 Correct 110 ms 37904 KB Output is correct
5 Correct 12 ms 21836 KB Output is correct
6 Correct 87 ms 32028 KB Output is correct
7 Correct 26 ms 23812 KB Output is correct
8 Correct 100 ms 32408 KB Output is correct
9 Correct 88 ms 31960 KB Output is correct
10 Correct 124 ms 37904 KB Output is correct
11 Correct 13 ms 21836 KB Output is correct
12 Correct 86 ms 31968 KB Output is correct
13 Correct 83 ms 31496 KB Output is correct
14 Correct 80 ms 31680 KB Output is correct
15 Correct 84 ms 31596 KB Output is correct
16 Correct 119 ms 44016 KB Output is correct
17 Correct 104 ms 34804 KB Output is correct
18 Correct 81 ms 31784 KB Output is correct
19 Correct 25 ms 23820 KB Output is correct
20 Correct 96 ms 32460 KB Output is correct
21 Correct 91 ms 31936 KB Output is correct
22 Correct 125 ms 37888 KB Output is correct
23 Correct 12 ms 21836 KB Output is correct
24 Correct 87 ms 31928 KB Output is correct
25 Correct 86 ms 31496 KB Output is correct
26 Correct 109 ms 31680 KB Output is correct
27 Correct 108 ms 31556 KB Output is correct
28 Correct 114 ms 44068 KB Output is correct
29 Correct 104 ms 34752 KB Output is correct
30 Correct 94 ms 31812 KB Output is correct
31 Correct 1980 ms 80076 KB Output is correct
32 Correct 1612 ms 84164 KB Output is correct
33 Correct 1634 ms 80580 KB Output is correct
34 Correct 1285 ms 83980 KB Output is correct
35 Execution timed out 6096 ms 125780 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 23820 KB Output is correct
2 Correct 91 ms 32728 KB Output is correct
3 Correct 82 ms 32052 KB Output is correct
4 Correct 110 ms 37904 KB Output is correct
5 Correct 12 ms 21836 KB Output is correct
6 Correct 87 ms 32028 KB Output is correct
7 Correct 26 ms 23812 KB Output is correct
8 Correct 100 ms 32408 KB Output is correct
9 Correct 88 ms 31960 KB Output is correct
10 Correct 124 ms 37904 KB Output is correct
11 Correct 13 ms 21836 KB Output is correct
12 Correct 86 ms 31968 KB Output is correct
13 Correct 83 ms 31496 KB Output is correct
14 Correct 80 ms 31680 KB Output is correct
15 Correct 84 ms 31596 KB Output is correct
16 Correct 119 ms 44016 KB Output is correct
17 Correct 104 ms 34804 KB Output is correct
18 Correct 81 ms 31784 KB Output is correct
19 Correct 25 ms 23820 KB Output is correct
20 Correct 96 ms 32460 KB Output is correct
21 Correct 91 ms 31936 KB Output is correct
22 Correct 125 ms 37888 KB Output is correct
23 Correct 12 ms 21836 KB Output is correct
24 Correct 87 ms 31928 KB Output is correct
25 Correct 86 ms 31496 KB Output is correct
26 Correct 109 ms 31680 KB Output is correct
27 Correct 108 ms 31556 KB Output is correct
28 Correct 114 ms 44068 KB Output is correct
29 Correct 104 ms 34752 KB Output is correct
30 Correct 94 ms 31812 KB Output is correct
31 Correct 1980 ms 80076 KB Output is correct
32 Correct 1612 ms 84164 KB Output is correct
33 Correct 1634 ms 80580 KB Output is correct
34 Correct 1285 ms 83980 KB Output is correct
35 Execution timed out 6096 ms 125780 KB Time limit exceeded
36 Halted 0 ms 0 KB -