oj.uz

답안 #528012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528012 2022-02-19T02:16:04 Z 79brue From Hacks to Snitches (BOI21_watchmen) C++14
15 / 100
 6000 ms 90916 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
const int LIM = 205;

struct dat{
    int x, f, y;
    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[LIM+5];

inline void update(dat tmp){
    if(visited[tmp.x][tmp.f]) return;
    visited[tmp.x][tmp.f] = 1;
    dist[tmp.x][tmp.f] = tmp.y;
    pq[tmp.y%LIM].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));
    for(int d=0; ; d+=LIM){
        bool exist = 0;
        for(int e=0; e<LIM; e++){
            while(!pq[e].empty()){
                exist=1;
                dat tmp = pq[e].front(); pq[e].pop();
                int x = tmp.x, f = tmp.f, y = tmp.y;
                assert(f < cycleLen[x]);

                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(cycleIdx[nxt] != (y+1)%cycleLen[nxt]) update(dat(nxt, (y+1)%cycleLen[nxt], y+1));
                            int tn = (y+1-cycleIdx[nxt]-1+cycleLen[nxt]-1) / cycleLen[nxt] * cycleLen[nxt] + cycleIdx[nxt]+1;
                            update(dat(nxt, tn%cycleLen[nxt], tn));
                        }
                    }
                }
                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));
                        }
                    }
                }
            }
        }
        if(!exist) break;
    }

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 22868 KB Output is correct
2 Correct 109 ms 31956 KB Output is correct
3 Correct 85 ms 32204 KB Output is correct
4 Correct 98 ms 32416 KB Output is correct
5 Correct 12 ms 21968 KB Output is correct
6 Correct 89 ms 32332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 22828 KB Output is correct
2 Correct 87 ms 31940 KB Output is correct
3 Correct 83 ms 32208 KB Output is correct
4 Correct 102 ms 32396 KB Output is correct
5 Correct 11 ms 21964 KB Output is correct
6 Correct 85 ms 32248 KB Output is correct
7 Correct 99 ms 32244 KB Output is correct
8 Correct 92 ms 32260 KB Output is correct
9 Correct 93 ms 32312 KB Output is correct
10 Correct 88 ms 32336 KB Output is correct
11 Correct 77 ms 32244 KB Output is correct
12 Correct 93 ms 32212 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 22828 KB Output is correct
2 Correct 87 ms 31940 KB Output is correct
3 Correct 83 ms 32208 KB Output is correct
4 Correct 102 ms 32396 KB Output is correct
5 Correct 11 ms 21964 KB Output is correct
6 Correct 85 ms 32248 KB Output is correct
7 Correct 99 ms 32244 KB Output is correct
8 Correct 92 ms 32260 KB Output is correct
9 Correct 93 ms 32312 KB Output is correct
10 Correct 88 ms 32336 KB Output is correct
11 Correct 77 ms 32244 KB Output is correct
12 Correct 93 ms 32212 KB Output is correct
13 Correct 28 ms 23424 KB Output is correct
14 Correct 97 ms 33144 KB Output is correct
15 Correct 90 ms 32452 KB Output is correct
16 Correct 101 ms 32364 KB Output is correct
17 Correct 11 ms 21964 KB Output is correct
18 Correct 90 ms 32296 KB Output is correct
19 Correct 84 ms 32344 KB Output is correct
20 Correct 84 ms 32200 KB Output is correct
21 Correct 85 ms 32308 KB Output is correct
22 Correct 85 ms 32340 KB Output is correct
23 Correct 77 ms 32244 KB Output is correct
24 Correct 82 ms 32236 KB Output is correct
25 Correct 1691 ms 84432 KB Output is correct
26 Correct 1648 ms 88624 KB Output is correct
27 Correct 1661 ms 88000 KB Output is correct
28 Correct 1435 ms 90916 KB Output is correct
29 Execution timed out 6063 ms 83128 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 22828 KB Output is correct
2 Correct 87 ms 31940 KB Output is correct
3 Correct 83 ms 32208 KB Output is correct
4 Correct 102 ms 32396 KB Output is correct
5 Correct 11 ms 21964 KB Output is correct
6 Correct 85 ms 32248 KB Output is correct
7 Correct 99 ms 32244 KB Output is correct
8 Correct 92 ms 32260 KB Output is correct
9 Correct 93 ms 32312 KB Output is correct
10 Correct 88 ms 32336 KB Output is correct
11 Correct 77 ms 32244 KB Output is correct
12 Correct 93 ms 32212 KB Output is correct
13 Correct 28 ms 23424 KB Output is correct
14 Correct 97 ms 33144 KB Output is correct
15 Correct 90 ms 32452 KB Output is correct
16 Correct 101 ms 32364 KB Output is correct
17 Correct 11 ms 21964 KB Output is correct
18 Correct 90 ms 32296 KB Output is correct
19 Correct 84 ms 32344 KB Output is correct
20 Correct 84 ms 32200 KB Output is correct
21 Correct 85 ms 32308 KB Output is correct
22 Correct 85 ms 32340 KB Output is correct
23 Correct 77 ms 32244 KB Output is correct
24 Correct 82 ms 32236 KB Output is correct
25 Correct 1691 ms 84432 KB Output is correct
26 Correct 1648 ms 88624 KB Output is correct
27 Correct 1661 ms 88000 KB Output is correct
28 Correct 1435 ms 90916 KB Output is correct
29 Execution timed out 6063 ms 83128 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 22868 KB Output is correct
2 Correct 109 ms 31956 KB Output is correct
3 Correct 85 ms 32204 KB Output is correct
4 Correct 98 ms 32416 KB Output is correct
5 Correct 12 ms 21968 KB Output is correct
6 Correct 89 ms 32332 KB Output is correct
7 Correct 30 ms 22828 KB Output is correct
8 Correct 87 ms 31940 KB Output is correct
9 Correct 83 ms 32208 KB Output is correct
10 Correct 102 ms 32396 KB Output is correct
11 Correct 11 ms 21964 KB Output is correct
12 Correct 85 ms 32248 KB Output is correct
13 Correct 99 ms 32244 KB Output is correct
14 Correct 92 ms 32260 KB Output is correct
15 Correct 93 ms 32312 KB Output is correct
16 Correct 88 ms 32336 KB Output is correct
17 Correct 77 ms 32244 KB Output is correct
18 Correct 93 ms 32212 KB Output is correct
19 Correct 15 ms 21964 KB Output is correct
20 Correct 12 ms 21940 KB Output is correct
21 Correct 13 ms 21856 KB Output is correct
22 Correct 34 ms 23420 KB Output is correct
23 Correct 122 ms 33196 KB Output is correct
24 Correct 104 ms 32208 KB Output is correct
25 Correct 125 ms 32412 KB Output is correct
26 Correct 13 ms 21972 KB Output is correct
27 Correct 96 ms 32328 KB Output is correct
28 Correct 101 ms 32176 KB Output is correct
29 Correct 91 ms 32200 KB Output is correct
30 Correct 96 ms 32212 KB Output is correct
31 Correct 102 ms 32468 KB Output is correct
32 Correct 96 ms 32256 KB Output is correct
33 Correct 90 ms 32276 KB Output is correct
34 Correct 1802 ms 83016 KB Output is correct
35 Correct 1846 ms 79668 KB Output is correct
36 Correct 1805 ms 79604 KB Output is correct
37 Incorrect 1657 ms 85068 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 22868 KB Output is correct
2 Correct 109 ms 31956 KB Output is correct
3 Correct 85 ms 32204 KB Output is correct
4 Correct 98 ms 32416 KB Output is correct
5 Correct 12 ms 21968 KB Output is correct
6 Correct 89 ms 32332 KB Output is correct
7 Correct 30 ms 22828 KB Output is correct
8 Correct 87 ms 31940 KB Output is correct
9 Correct 83 ms 32208 KB Output is correct
10 Correct 102 ms 32396 KB Output is correct
11 Correct 11 ms 21964 KB Output is correct
12 Correct 85 ms 32248 KB Output is correct
13 Correct 99 ms 32244 KB Output is correct
14 Correct 92 ms 32260 KB Output is correct
15 Correct 93 ms 32312 KB Output is correct
16 Correct 88 ms 32336 KB Output is correct
17 Correct 77 ms 32244 KB Output is correct
18 Correct 93 ms 32212 KB Output is correct
19 Correct 28 ms 23424 KB Output is correct
20 Correct 97 ms 33144 KB Output is correct
21 Correct 90 ms 32452 KB Output is correct
22 Correct 101 ms 32364 KB Output is correct
23 Correct 11 ms 21964 KB Output is correct
24 Correct 90 ms 32296 KB Output is correct
25 Correct 84 ms 32344 KB Output is correct
26 Correct 84 ms 32200 KB Output is correct
27 Correct 85 ms 32308 KB Output is correct
28 Correct 85 ms 32340 KB Output is correct
29 Correct 77 ms 32244 KB Output is correct
30 Correct 82 ms 32236 KB Output is correct
31 Correct 1691 ms 84432 KB Output is correct
32 Correct 1648 ms 88624 KB Output is correct
33 Correct 1661 ms 88000 KB Output is correct
34 Correct 1435 ms 90916 KB Output is correct
35 Execution timed out 6063 ms 83128 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 22868 KB Output is correct
2 Correct 109 ms 31956 KB Output is correct
3 Correct 85 ms 32204 KB Output is correct
4 Correct 98 ms 32416 KB Output is correct
5 Correct 12 ms 21968 KB Output is correct
6 Correct 89 ms 32332 KB Output is correct
7 Correct 30 ms 22828 KB Output is correct
8 Correct 87 ms 31940 KB Output is correct
9 Correct 83 ms 32208 KB Output is correct
10 Correct 102 ms 32396 KB Output is correct
11 Correct 11 ms 21964 KB Output is correct
12 Correct 85 ms 32248 KB Output is correct
13 Correct 99 ms 32244 KB Output is correct
14 Correct 92 ms 32260 KB Output is correct
15 Correct 93 ms 32312 KB Output is correct
16 Correct 88 ms 32336 KB Output is correct
17 Correct 77 ms 32244 KB Output is correct
18 Correct 93 ms 32212 KB Output is correct
19 Correct 28 ms 23424 KB Output is correct
20 Correct 97 ms 33144 KB Output is correct
21 Correct 90 ms 32452 KB Output is correct
22 Correct 101 ms 32364 KB Output is correct
23 Correct 11 ms 21964 KB Output is correct
24 Correct 90 ms 32296 KB Output is correct
25 Correct 84 ms 32344 KB Output is correct
26 Correct 84 ms 32200 KB Output is correct
27 Correct 85 ms 32308 KB Output is correct
28 Correct 85 ms 32340 KB Output is correct
29 Correct 77 ms 32244 KB Output is correct
30 Correct 82 ms 32236 KB Output is correct
31 Correct 1691 ms 84432 KB Output is correct
32 Correct 1648 ms 88624 KB Output is correct
33 Correct 1661 ms 88000 KB Output is correct
34 Correct 1435 ms 90916 KB Output is correct
35 Execution timed out 6063 ms 83128 KB Time limit exceeded
36 Halted 0 ms 0 KB -