oj.uz

Submission #528010

# Submission time Handle Problem Language Result Execution time Memory
528010 2022-02-19T02:07:23 Z 79brue From Hacks to Snitches (BOI21_watchmen) C++14
0 / 100
 104 ms 34136 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
const int LIM = 1600;
 
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];
 
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));
                        }
                    }
                }
                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:35:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
watchmen.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
watchmen.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d", &k);
      |     ~~~~~^~~~~~~~~~
watchmen.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |         scanf("%d", &l);
      |         ~~~~~^~~~~~~~~~
watchmen.cpp:49:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |             scanf("%d", &tmp);
      |             ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 24356 KB Output is correct
2 Incorrect 96 ms 34136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 24392 KB Output is correct
2 Incorrect 104 ms 34064 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 24392 KB Output is correct
2 Incorrect 104 ms 34064 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 24392 KB Output is correct
2 Incorrect 104 ms 34064 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 24356 KB Output is correct
2 Incorrect 96 ms 34136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 24356 KB Output is correct
2 Incorrect 96 ms 34136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 24356 KB Output is correct
2 Incorrect 96 ms 34136 KB Output isn't correct
3 Halted 0 ms 0 KB -