oj.uz

Submission #367439

# Submission time Handle Problem Language Result Execution time Memory
367439 2021-02-17T10:47:37 Z ACmachine Paths (BOI18_paths) C++17
100 / 100
 565 ms 70892 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m, k;
    cin >> n >> m >> k;
    vector<int> c(n);
    REP(i, n){
        cin >> c[i];
        c[i]--;
    }
    vector<vector<int>> g(n);
    REP(i, m){
        int u, v;
        cin >> u >> v;
        u--; v--;
        g[u].pb(v);
        g[v].pb(u);
    }
    vector<vector<ll>> dp(n, vector<ll>(1 << k, 0)); 
    REP(i, n){
        dp[i][(1 << c[i])] = 1;
    }
    REP(mask, (1 << k)){
        if(__builtin_popcount(mask) <= 1) 
            continue;
        REP(i, n){
            if(!(mask&(1 << c[i]))) continue;
            for(int x : g[i]){
                dp[i][mask] += dp[x][mask&~(1 << c[i])];
            }
        }
    }
    ll res = 0;
    REP(mask, (1 << k)){
        if(__builtin_popcount(mask) >= 2){
            REP(i, n) res += dp[i][mask];
        }
    }
    cout << res << "\n";
	
    return 0;
}

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 7148 KB Output is correct
2 Correct 66 ms 6252 KB Output is correct
3 Correct 364 ms 52076 KB Output is correct
4 Correct 108 ms 10604 KB Output is correct
5 Correct 107 ms 10120 KB Output is correct
6 Correct 270 ms 37556 KB Output is correct
7 Correct 357 ms 51948 KB Output is correct
8 Correct 381 ms 52588 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 89 ms 7148 KB Output is correct
12 Correct 66 ms 6252 KB Output is correct
13 Correct 364 ms 52076 KB Output is correct
14 Correct 108 ms 10604 KB Output is correct
15 Correct 107 ms 10120 KB Output is correct
16 Correct 270 ms 37556 KB Output is correct
17 Correct 357 ms 51948 KB Output is correct
18 Correct 381 ms 52588 KB Output is correct
19 Correct 75 ms 7020 KB Output is correct
20 Correct 61 ms 6252 KB Output is correct
21 Correct 378 ms 52076 KB Output is correct
22 Correct 120 ms 10860 KB Output is correct
23 Correct 99 ms 10092 KB Output is correct
24 Correct 270 ms 37344 KB Output is correct
25 Correct 377 ms 52204 KB Output is correct
26 Correct 381 ms 52844 KB Output is correct
27 Correct 65 ms 6252 KB Output is correct
28 Correct 97 ms 8812 KB Output is correct
29 Correct 565 ms 70892 KB Output is correct
30 Correct 354 ms 39144 KB Output is correct
31 Correct 365 ms 39012 KB Output is correct
32 Correct 559 ms 70892 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 24 ms 2412 KB Output is correct
3 Correct 20 ms 2284 KB Output is correct
4 Correct 93 ms 17644 KB Output is correct
5 Correct 71 ms 18148 KB Output is correct
6 Correct 265 ms 36204 KB Output is correct
7 Correct 21 ms 2156 KB Output is correct
8 Correct 144 ms 23660 KB Output is correct
9 Correct 109 ms 24420 KB Output is correct
10 Correct 142 ms 24376 KB Output is correct
11 Correct 122 ms 19176 KB Output is correct
12 Correct 140 ms 28296 KB Output is correct
13 Correct 124 ms 19300 KB Output is correct
14 Correct 256 ms 36332 KB Output is correct
15 Correct 256 ms 36460 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct