oj.uz

Submission #402684

# Submission time Handle Problem Language Result Execution time Memory
402684 2021-05-12T08:52:36 Z rrrr10000 From Hacks to Snitches (BOI21_watchmen) C++14
35 / 100
 2586 ms 258808 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=998244353;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
inline ll readll() {
    ll x = 0;
    int neg=1;
    char ch = getchar_unlocked();
    while (ch < '0' || ch > '9'){
        if(ch=='-')neg=-1;
        ch = getchar_unlocked();
    }
    while (ch >= '0' && ch <= '9'){
		x = (x << 3) + (x << 1) + ch - '0';
		ch = getchar_unlocked();
	}
    return x*neg;
}
int main(){
    ll n=readll(),m=readll();
    vvp g(n);
    rep(i,m){
        ll a=readll()-1,b=readll()-1;
        g[a].pb(b,i);g[b].pb(a,i);
    }
    ll k=readll();
    vi len(n,1),ngv(n,-1),nge(m,-1);
    vvp sp(n);
    rep(j,k){
        ll l=readll();
        vi v(l);
        rep(i,l)v[i]=readll()-1;
        rep(i,l){
            ngv[v[i]]=i;len[v[i]]=l;
            if(i==l-1&&l==2)break;
            sp[v[i]].pb(v[(i+1)%l],i);
            sp[v[(i+1)%l]].pb(v[i],i);
        }
    }
    rep(i,n)for(auto x:g[i]){
        for(auto&y:sp[i])if(y.fi==x.fi){
            nge[x.se]=y.se;
            y.se=x.se;
        }
    }
    rep(i,n)rep(j,g[i].size()){
        for(auto y:sp[i])if(g[i][j]==y){
            g[i].erase(g[i].begin()+j);j--;
            break;
        }
    }


    vvi dis(n);
    rep(i,n)dis[i]=vi(len[i],inf);
    dis[0][0]=0;
    SPQ(PP) pq;pq.emplace(0,0,0);
    vi tmp(n,-1);
    while(!pq.empty()){
        ll cost,i,j;tie(cost,i,j)=pq.top();pq.pop();if(cost!=dis[i][j])continue;
        if(tmp[i]==-1||(tmp[i]!=-2&&(cost-ngv[i])/len[i]!=(tmp[i]-ngv[i])/len[i])){
            for(auto x:g[i]){
                ll nc=cost+1;
                if(ngv[x.fi]==nc%len[x.fi]){
                    if(ngv[i]==nc%len[i])nc=inf;
                    else nc++;
                }
                ll p=nc%len[x.fi];if(chmin(dis[x.fi][p],nc))pq.emplace(nc,x.fi,p);
            }
            cost+=len[i];
            for(auto x:g[i]){
                ll nc=cost+1;
                if(ngv[x.fi]==nc%len[x.fi]){
                    if(ngv[i]==nc%len[i])nc=inf;
                    else nc++;
                }
                ll p=nc%len[x.fi];if(chmin(dis[x.fi][p],nc))pq.emplace(nc,x.fi,p);
            }
            cost-=len[i];
            if(tmp[i]==-1){
                tmp[i]=dis[i][j];
            }
            else tmp[i]=-2;
        }
        for(auto x:sp[i]){
            ll p0=cost%len[x.fi],p1=p0+1;if(p1>=len[x.fi])p1-=len[x.fi];
            if(nge[x.se]==p0)continue;
            if(ngv[x.fi]==p1)continue;
            if(chmin(dis[x.fi][p1],cost+1))pq.emplace(cost+1,x.fi,p1);
        }
        ll p1=(cost+1)%len[i],p2=p1+1;if(p2>=len[i])p2-=len[i];
        if(ngv[i]==p1){
            bool ok=false,ok2=false;
            for(auto x:g[i]){
                bool f=true;
                for(auto y:sp[i])if(x==y)f=false;
                if(!f)continue;
                if(ngv[x.fi]!=(cost+1)%len[x.fi])ok=true;
                if(ngv[x.fi]!=(cost+len[i]+1)%len[x.fi])ok2=true;
            }
            ll nc;
            if(ok)nc=cost+2;
            else if(ok2)nc=cost+len[i]+2;
            else nc=inf;
            if(chmin(dis[i][p2],nc))pq.emplace(nc,i,p2);
        }
        else if(chmin(dis[i][p1],cost+1))pq.emplace(cost+1,i,p1);
    }
    // outvv(dis);
    ll ans=inf;
    for(ll x:dis[n-1])chmin(ans,x);
    if(ans==inf)out("impossible");
    else out(ans);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5196 KB Output is correct
2 Correct 81 ms 19832 KB Output is correct
3 Correct 81 ms 18840 KB Output is correct
4 Correct 90 ms 18908 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 85 ms 18832 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5068 KB Output is correct
2 Correct 83 ms 19812 KB Output is correct
3 Correct 82 ms 18884 KB Output is correct
4 Correct 93 ms 18936 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 83 ms 18888 KB Output is correct
7 Correct 76 ms 18756 KB Output is correct
8 Correct 79 ms 18744 KB Output is correct
9 Correct 74 ms 18436 KB Output is correct
10 Correct 82 ms 18952 KB Output is correct
11 Correct 88 ms 18724 KB Output is correct
12 Correct 80 ms 18812 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5068 KB Output is correct
2 Correct 83 ms 19812 KB Output is correct
3 Correct 82 ms 18884 KB Output is correct
4 Correct 93 ms 18936 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 83 ms 18888 KB Output is correct
7 Correct 76 ms 18756 KB Output is correct
8 Correct 79 ms 18744 KB Output is correct
9 Correct 74 ms 18436 KB Output is correct
10 Correct 82 ms 18952 KB Output is correct
11 Correct 88 ms 18724 KB Output is correct
12 Correct 80 ms 18812 KB Output is correct
13 Correct 12 ms 5068 KB Output is correct
14 Correct 86 ms 19780 KB Output is correct
15 Correct 101 ms 18928 KB Output is correct
16 Correct 87 ms 18884 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 81 ms 18880 KB Output is correct
19 Correct 77 ms 18756 KB Output is correct
20 Correct 77 ms 18724 KB Output is correct
21 Correct 74 ms 18556 KB Output is correct
22 Correct 85 ms 18904 KB Output is correct
23 Correct 83 ms 18692 KB Output is correct
24 Correct 78 ms 18796 KB Output is correct
25 Correct 1309 ms 201316 KB Output is correct
26 Correct 1293 ms 225480 KB Output is correct
27 Correct 1168 ms 201352 KB Output is correct
28 Correct 963 ms 212140 KB Output is correct
29 Correct 1299 ms 176648 KB Output is correct
30 Correct 1284 ms 187656 KB Output is correct
31 Correct 1455 ms 226996 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 5068 KB Output is correct
2 Correct 83 ms 19812 KB Output is correct
3 Correct 82 ms 18884 KB Output is correct
4 Correct 93 ms 18936 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 83 ms 18888 KB Output is correct
7 Correct 76 ms 18756 KB Output is correct
8 Correct 79 ms 18744 KB Output is correct
9 Correct 74 ms 18436 KB Output is correct
10 Correct 82 ms 18952 KB Output is correct
11 Correct 88 ms 18724 KB Output is correct
12 Correct 80 ms 18812 KB Output is correct
13 Correct 12 ms 5068 KB Output is correct
14 Correct 86 ms 19780 KB Output is correct
15 Correct 101 ms 18928 KB Output is correct
16 Correct 87 ms 18884 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 81 ms 18880 KB Output is correct
19 Correct 77 ms 18756 KB Output is correct
20 Correct 77 ms 18724 KB Output is correct
21 Correct 74 ms 18556 KB Output is correct
22 Correct 85 ms 18904 KB Output is correct
23 Correct 83 ms 18692 KB Output is correct
24 Correct 78 ms 18796 KB Output is correct
25 Correct 1309 ms 201316 KB Output is correct
26 Correct 1293 ms 225480 KB Output is correct
27 Correct 1168 ms 201352 KB Output is correct
28 Correct 963 ms 212140 KB Output is correct
29 Correct 1299 ms 176648 KB Output is correct
30 Correct 1284 ms 187656 KB Output is correct
31 Correct 1455 ms 226996 KB Output is correct
32 Correct 11 ms 5132 KB Output is correct
33 Correct 85 ms 19736 KB Output is correct
34 Correct 87 ms 18856 KB Output is correct
35 Correct 90 ms 18864 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 83 ms 18884 KB Output is correct
38 Correct 78 ms 18696 KB Output is correct
39 Correct 78 ms 18628 KB Output is correct
40 Correct 76 ms 18496 KB Output is correct
41 Correct 87 ms 18908 KB Output is correct
42 Correct 82 ms 18720 KB Output is correct
43 Correct 81 ms 18816 KB Output is correct
44 Correct 1361 ms 203784 KB Output is correct
45 Correct 1308 ms 224132 KB Output is correct
46 Correct 1176 ms 200332 KB Output is correct
47 Correct 1089 ms 214608 KB Output is correct
48 Correct 1344 ms 179236 KB Output is correct
49 Correct 1290 ms 190188 KB Output is correct
50 Correct 1423 ms 227044 KB Output is correct
51 Correct 2123 ms 220768 KB Output is correct
52 Correct 2586 ms 258808 KB Output is correct
53 Correct 2124 ms 221028 KB Output is correct
54 Correct 1035 ms 176348 KB Output is correct
55 Correct 2275 ms 204260 KB Output is correct
56 Correct 2057 ms 186472 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5196 KB Output is correct
2 Correct 81 ms 19832 KB Output is correct
3 Correct 81 ms 18840 KB Output is correct
4 Correct 90 ms 18908 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 85 ms 18832 KB Output is correct
7 Correct 12 ms 5068 KB Output is correct
8 Correct 83 ms 19812 KB Output is correct
9 Correct 82 ms 18884 KB Output is correct
10 Correct 93 ms 18936 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 83 ms 18888 KB Output is correct
13 Correct 76 ms 18756 KB Output is correct
14 Correct 79 ms 18744 KB Output is correct
15 Correct 74 ms 18436 KB Output is correct
16 Correct 82 ms 18952 KB Output is correct
17 Correct 88 ms 18724 KB Output is correct
18 Correct 80 ms 18812 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 288 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 11 ms 5168 KB Output is correct
23 Correct 87 ms 19816 KB Output is correct
24 Correct 83 ms 18820 KB Output is correct
25 Correct 94 ms 19056 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 88 ms 18852 KB Output is correct
28 Correct 79 ms 18740 KB Output is correct
29 Correct 77 ms 18728 KB Output is correct
30 Correct 77 ms 18460 KB Output is correct
31 Correct 83 ms 18960 KB Output is correct
32 Correct 85 ms 18692 KB Output is correct
33 Correct 81 ms 18780 KB Output is correct
34 Correct 1427 ms 205736 KB Output is correct
35 Correct 1454 ms 189684 KB Output is correct
36 Correct 1455 ms 189676 KB Output is correct
37 Correct 1299 ms 217324 KB Output is correct
38 Correct 1354 ms 199044 KB Output is correct
39 Correct 1379 ms 176484 KB Output is correct
40 Correct 1368 ms 176592 KB Output is correct
41 Correct 1375 ms 174156 KB Output is correct
42 Correct 1352 ms 199348 KB Output is correct
43 Incorrect 991 ms 218804 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5196 KB Output is correct
2 Correct 81 ms 19832 KB Output is correct
3 Correct 81 ms 18840 KB Output is correct
4 Correct 90 ms 18908 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 85 ms 18832 KB Output is correct
7 Correct 12 ms 5068 KB Output is correct
8 Correct 83 ms 19812 KB Output is correct
9 Correct 82 ms 18884 KB Output is correct
10 Correct 93 ms 18936 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 83 ms 18888 KB Output is correct
13 Correct 76 ms 18756 KB Output is correct
14 Correct 79 ms 18744 KB Output is correct
15 Correct 74 ms 18436 KB Output is correct
16 Correct 82 ms 18952 KB Output is correct
17 Correct 88 ms 18724 KB Output is correct
18 Correct 80 ms 18812 KB Output is correct
19 Correct 12 ms 5068 KB Output is correct
20 Correct 86 ms 19780 KB Output is correct
21 Correct 101 ms 18928 KB Output is correct
22 Correct 87 ms 18884 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 81 ms 18880 KB Output is correct
25 Correct 77 ms 18756 KB Output is correct
26 Correct 77 ms 18724 KB Output is correct
27 Correct 74 ms 18556 KB Output is correct
28 Correct 85 ms 18904 KB Output is correct
29 Correct 83 ms 18692 KB Output is correct
30 Correct 78 ms 18796 KB Output is correct
31 Correct 1309 ms 201316 KB Output is correct
32 Correct 1293 ms 225480 KB Output is correct
33 Correct 1168 ms 201352 KB Output is correct
34 Correct 963 ms 212140 KB Output is correct
35 Correct 1299 ms 176648 KB Output is correct
36 Correct 1284 ms 187656 KB Output is correct
37 Correct 1455 ms 226996 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 1 ms 292 KB Output is correct
41 Correct 11 ms 5168 KB Output is correct
42 Correct 87 ms 19816 KB Output is correct
43 Correct 83 ms 18820 KB Output is correct
44 Correct 94 ms 19056 KB Output is correct
45 Correct 3 ms 332 KB Output is correct
46 Correct 88 ms 18852 KB Output is correct
47 Correct 79 ms 18740 KB Output is correct
48 Correct 77 ms 18728 KB Output is correct
49 Correct 77 ms 18460 KB Output is correct
50 Correct 83 ms 18960 KB Output is correct
51 Correct 85 ms 18692 KB Output is correct
52 Correct 81 ms 18780 KB Output is correct
53 Correct 1427 ms 205736 KB Output is correct
54 Correct 1454 ms 189684 KB Output is correct
55 Correct 1455 ms 189676 KB Output is correct
56 Correct 1299 ms 217324 KB Output is correct
57 Correct 1354 ms 199044 KB Output is correct
58 Correct 1379 ms 176484 KB Output is correct
59 Correct 1368 ms 176592 KB Output is correct
60 Correct 1375 ms 174156 KB Output is correct
61 Correct 1352 ms 199348 KB Output is correct
62 Incorrect 991 ms 218804 KB Output isn't correct
63 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5196 KB Output is correct
2 Correct 81 ms 19832 KB Output is correct
3 Correct 81 ms 18840 KB Output is correct
4 Correct 90 ms 18908 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 85 ms 18832 KB Output is correct
7 Correct 12 ms 5068 KB Output is correct
8 Correct 83 ms 19812 KB Output is correct
9 Correct 82 ms 18884 KB Output is correct
10 Correct 93 ms 18936 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 83 ms 18888 KB Output is correct
13 Correct 76 ms 18756 KB Output is correct
14 Correct 79 ms 18744 KB Output is correct
15 Correct 74 ms 18436 KB Output is correct
16 Correct 82 ms 18952 KB Output is correct
17 Correct 88 ms 18724 KB Output is correct
18 Correct 80 ms 18812 KB Output is correct
19 Correct 12 ms 5068 KB Output is correct
20 Correct 86 ms 19780 KB Output is correct
21 Correct 101 ms 18928 KB Output is correct
22 Correct 87 ms 18884 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 81 ms 18880 KB Output is correct
25 Correct 77 ms 18756 KB Output is correct
26 Correct 77 ms 18724 KB Output is correct
27 Correct 74 ms 18556 KB Output is correct
28 Correct 85 ms 18904 KB Output is correct
29 Correct 83 ms 18692 KB Output is correct
30 Correct 78 ms 18796 KB Output is correct
31 Correct 1309 ms 201316 KB Output is correct
32 Correct 1293 ms 225480 KB Output is correct
33 Correct 1168 ms 201352 KB Output is correct
34 Correct 963 ms 212140 KB Output is correct
35 Correct 1299 ms 176648 KB Output is correct
36 Correct 1284 ms 187656 KB Output is correct
37 Correct 1455 ms 226996 KB Output is correct
38 Correct 11 ms 5132 KB Output is correct
39 Correct 85 ms 19736 KB Output is correct
40 Correct 87 ms 18856 KB Output is correct
41 Correct 90 ms 18864 KB Output is correct
42 Correct 3 ms 332 KB Output is correct
43 Correct 83 ms 18884 KB Output is correct
44 Correct 78 ms 18696 KB Output is correct
45 Correct 78 ms 18628 KB Output is correct
46 Correct 76 ms 18496 KB Output is correct
47 Correct 87 ms 18908 KB Output is correct
48 Correct 82 ms 18720 KB Output is correct
49 Correct 81 ms 18816 KB Output is correct
50 Correct 1361 ms 203784 KB Output is correct
51 Correct 1308 ms 224132 KB Output is correct
52 Correct 1176 ms 200332 KB Output is correct
53 Correct 1089 ms 214608 KB Output is correct
54 Correct 1344 ms 179236 KB Output is correct
55 Correct 1290 ms 190188 KB Output is correct
56 Correct 1423 ms 227044 KB Output is correct
57 Correct 2123 ms 220768 KB Output is correct
58 Correct 2586 ms 258808 KB Output is correct
59 Correct 2124 ms 221028 KB Output is correct
60 Correct 1035 ms 176348 KB Output is correct
61 Correct 2275 ms 204260 KB Output is correct
62 Correct 2057 ms 186472 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 288 KB Output is correct
65 Correct 1 ms 292 KB Output is correct
66 Correct 11 ms 5168 KB Output is correct
67 Correct 87 ms 19816 KB Output is correct
68 Correct 83 ms 18820 KB Output is correct
69 Correct 94 ms 19056 KB Output is correct
70 Correct 3 ms 332 KB Output is correct
71 Correct 88 ms 18852 KB Output is correct
72 Correct 79 ms 18740 KB Output is correct
73 Correct 77 ms 18728 KB Output is correct
74 Correct 77 ms 18460 KB Output is correct
75 Correct 83 ms 18960 KB Output is correct
76 Correct 85 ms 18692 KB Output is correct
77 Correct 81 ms 18780 KB Output is correct
78 Correct 1427 ms 205736 KB Output is correct
79 Correct 1454 ms 189684 KB Output is correct
80 Correct 1455 ms 189676 KB Output is correct
81 Correct 1299 ms 217324 KB Output is correct
82 Correct 1354 ms 199044 KB Output is correct
83 Correct 1379 ms 176484 KB Output is correct
84 Correct 1368 ms 176592 KB Output is correct
85 Correct 1375 ms 174156 KB Output is correct
86 Correct 1352 ms 199348 KB Output is correct
87 Incorrect 991 ms 218804 KB Output isn't correct
88 Halted 0 ms 0 KB -