oj.uz

Submission #404437

# Submission time Handle Problem Language Result Execution time Memory
404437 2021-05-14T12:11:20 Z rrrr10000 Paths (BOI18_paths) C++14
100 / 100
 1498 ms 74080 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=1000000007;
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;}
 
int main(){
    ll n,m,k;cin>>n>>m>>k;
    vi c(n);
    rep(i,n){
        cin>>c[i];c[i]--;
    }
    vvi g(n);
    rep(i,m){
        ll a,b;cin>>a>>b;a--;b--;
        g[a].pb(b);g[b].pb(a);
    }
    vvi dp(n,vi(1<<k));rep(i,n)dp[i][1<<c[i]]=1;
    rep(i,1<<k)rep(j,n)for(ll x:g[j])if(!(i>>c[x]&1))dp[x][i|(1<<c[x])]+=dp[j][i];
    ll ans=-n;
    rep(i,n)rep(j,1<<k)ans+=dp[i][j];
    // outvv(dp);
    out(ans);
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 10436 KB Output is correct
2 Correct 192 ms 9788 KB Output is correct
3 Correct 936 ms 55196 KB Output is correct
4 Correct 277 ms 13936 KB Output is correct
5 Correct 264 ms 13536 KB Output is correct
6 Correct 633 ms 39836 KB Output is correct
7 Correct 906 ms 55200 KB Output is correct
8 Correct 940 ms 55748 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 227 ms 10436 KB Output is correct
12 Correct 192 ms 9788 KB Output is correct
13 Correct 936 ms 55196 KB Output is correct
14 Correct 277 ms 13936 KB Output is correct
15 Correct 264 ms 13536 KB Output is correct
16 Correct 633 ms 39836 KB Output is correct
17 Correct 906 ms 55200 KB Output is correct
18 Correct 940 ms 55748 KB Output is correct
19 Correct 254 ms 10552 KB Output is correct
20 Correct 199 ms 9656 KB Output is correct
21 Correct 922 ms 55304 KB Output is correct
22 Correct 276 ms 14020 KB Output is correct
23 Correct 248 ms 13440 KB Output is correct
24 Correct 676 ms 39848 KB Output is correct
25 Correct 1010 ms 55284 KB Output is correct
26 Correct 948 ms 55760 KB Output is correct
27 Correct 228 ms 9804 KB Output is correct
28 Correct 309 ms 12580 KB Output is correct
29 Correct 1444 ms 73988 KB Output is correct
30 Correct 872 ms 42292 KB Output is correct
31 Correct 928 ms 42592 KB Output is correct
32 Correct 1498 ms 74080 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 288 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 100 ms 3140 KB Output is correct
3 Correct 72 ms 3140 KB Output is correct
4 Correct 228 ms 18328 KB Output is correct
5 Correct 164 ms 18744 KB Output is correct
6 Correct 574 ms 37288 KB Output is correct
7 Correct 90 ms 3140 KB Output is correct
8 Correct 324 ms 24704 KB Output is correct
9 Correct 245 ms 25132 KB Output is correct
10 Correct 290 ms 24900 KB Output is correct
11 Correct 259 ms 20108 KB Output is correct
12 Correct 305 ms 28804 KB Output is correct
13 Correct 260 ms 20148 KB Output is correct
14 Correct 539 ms 37152 KB Output is correct
15 Correct 547 ms 37288 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 288 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct