oj.uz

Submission #418218

# Submission time Handle Problem Language Result Execution time Memory
418218 2021-06-05T08:27:41 Z amunduzbaev Paths (BOI18_paths) C++14
100 / 100
 1051 ms 198572 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 3e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
vii edges[N];
int dp[32][N][5];

void solve(int t_case){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++) cin>>a[i], a[i]--, dp[(1<<a[i])][i][0] = 1;
	for(int i=0;i<m;i++){
		int a, b; cin>>a>>b;
		edges[a].pb(b), edges[b].pb(a);
	}
	
	
	for(int l=1;l<k;l++){
		for(int i=1;i<(1<<k);i++){
			for(int j=0;j<k;j++){
				if(i>>j&1){
					int tt = i^(1<<j);
					for(int u=1;u<=n;u++){
						if(a[u] != j) continue;
						for(auto x : edges[u]) dp[i][u][l] += dp[tt][x][l-1];
					}
				}
			}
		} 
	} 
	
	for(int i=1;i<(1<<k);i++){
		for(int u=1;u<=n;u++){
			for(int l=1;l<k;l++) res += dp[i][u][l];
		}
	} cout<<res<<"\n";
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

paths.cpp: In function 'void usaco(std::string)':
paths.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
paths.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 18816 KB Output is correct
2 Correct 81 ms 16964 KB Output is correct
3 Correct 452 ms 105620 KB Output is correct
4 Correct 117 ms 22468 KB Output is correct
5 Correct 110 ms 20096 KB Output is correct
6 Correct 301 ms 75808 KB Output is correct
7 Correct 431 ms 105676 KB Output is correct
8 Correct 443 ms 106196 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7500 KB Output is correct
2 Correct 4 ms 7500 KB Output is correct
3 Correct 4 ms 7392 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 4 ms 7372 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7500 KB Output is correct
8 Correct 5 ms 7504 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 88 ms 18816 KB Output is correct
12 Correct 81 ms 16964 KB Output is correct
13 Correct 452 ms 105620 KB Output is correct
14 Correct 117 ms 22468 KB Output is correct
15 Correct 110 ms 20096 KB Output is correct
16 Correct 301 ms 75808 KB Output is correct
17 Correct 431 ms 105676 KB Output is correct
18 Correct 443 ms 106196 KB Output is correct
19 Correct 89 ms 18016 KB Output is correct
20 Correct 71 ms 16716 KB Output is correct
21 Correct 428 ms 104532 KB Output is correct
22 Correct 122 ms 21288 KB Output is correct
23 Correct 109 ms 18880 KB Output is correct
24 Correct 314 ms 74804 KB Output is correct
25 Correct 435 ms 104472 KB Output is correct
26 Correct 443 ms 104944 KB Output is correct
27 Correct 84 ms 17092 KB Output is correct
28 Correct 138 ms 22852 KB Output is correct
29 Correct 985 ms 198376 KB Output is correct
30 Correct 609 ms 107568 KB Output is correct
31 Correct 603 ms 101864 KB Output is correct
32 Correct 1051 ms 198572 KB Output is correct
33 Correct 5 ms 7500 KB Output is correct
34 Correct 5 ms 7500 KB Output is correct
35 Correct 5 ms 7376 KB Output is correct
36 Correct 5 ms 7372 KB Output is correct
37 Correct 5 ms 7356 KB Output is correct
38 Correct 5 ms 7500 KB Output is correct
39 Correct 5 ms 7500 KB Output is correct
40 Correct 5 ms 7500 KB Output is correct
41 Correct 5 ms 7372 KB Output is correct
42 Correct 5 ms 7372 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 42 ms 11088 KB Output is correct
3 Correct 27 ms 10436 KB Output is correct
4 Correct 128 ms 40456 KB Output is correct
5 Correct 102 ms 40768 KB Output is correct
6 Correct 730 ms 134596 KB Output is correct
7 Correct 34 ms 10720 KB Output is correct
8 Correct 279 ms 71720 KB Output is correct
9 Correct 210 ms 72172 KB Output is correct
10 Correct 226 ms 68044 KB Output is correct
11 Correct 343 ms 72404 KB Output is correct
12 Correct 336 ms 94772 KB Output is correct
13 Correct 285 ms 66636 KB Output is correct
14 Correct 719 ms 134680 KB Output is correct
15 Correct 749 ms 134720 KB Output is correct
16 Correct 5 ms 7500 KB Output is correct
17 Correct 5 ms 7500 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 5 ms 7372 KB Output is correct
20 Correct 5 ms 7372 KB Output is correct
21 Correct 5 ms 7500 KB Output is correct
22 Correct 5 ms 7500 KB Output is correct
23 Correct 5 ms 7500 KB Output is correct
24 Correct 5 ms 7372 KB Output is correct
25 Correct 5 ms 7376 KB Output is correct