oj.uz

Submission #418226

# Submission time Handle Problem Language Result Execution time Memory
418226 2021-06-05T08:31:11 Z amunduzbaev Paths (BOI18_paths) C++14
100 / 100
 825 ms 199700 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], ttt[5];
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, ttt[a[i]].pb(i);
	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(auto u : ttt[j]) 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 5 ms 7500 KB Output is correct
2 Correct 5 ms 7500 KB Output is correct
3 Correct 5 ms 7364 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 5 ms 7500 KB Output is correct
7 Correct 5 ms 7500 KB Output is correct
8 Correct 5 ms 7500 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 16580 KB Output is correct
2 Correct 72 ms 15172 KB Output is correct
3 Correct 454 ms 105824 KB Output is correct
4 Correct 117 ms 20112 KB Output is correct
5 Correct 115 ms 17780 KB Output is correct
6 Correct 294 ms 75204 KB Output is correct
7 Correct 422 ms 105908 KB Output is correct
8 Correct 426 ms 106360 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 5 ms 7500 KB Output is correct
3 Correct 5 ms 7364 KB Output is correct
4 Correct 5 ms 7380 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 5 ms 7500 KB Output is correct
7 Correct 5 ms 7500 KB Output is correct
8 Correct 5 ms 7500 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct
11 Correct 92 ms 16580 KB Output is correct
12 Correct 72 ms 15172 KB Output is correct
13 Correct 454 ms 105824 KB Output is correct
14 Correct 117 ms 20112 KB Output is correct
15 Correct 115 ms 17780 KB Output is correct
16 Correct 294 ms 75204 KB Output is correct
17 Correct 422 ms 105908 KB Output is correct
18 Correct 426 ms 106360 KB Output is correct
19 Correct 90 ms 16976 KB Output is correct
20 Correct 74 ms 15384 KB Output is correct
21 Correct 417 ms 105792 KB Output is correct
22 Correct 118 ms 20496 KB Output is correct
23 Correct 109 ms 18064 KB Output is correct
24 Correct 296 ms 75328 KB Output is correct
25 Correct 418 ms 105940 KB Output is correct
26 Correct 417 ms 106376 KB Output is correct
27 Correct 87 ms 15832 KB Output is correct
28 Correct 146 ms 21836 KB Output is correct
29 Correct 804 ms 199700 KB Output is correct
30 Correct 505 ms 107356 KB Output is correct
31 Correct 510 ms 101696 KB Output is correct
32 Correct 825 ms 199608 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 7372 KB Output is correct
36 Correct 5 ms 7376 KB Output is correct
37 Correct 4 ms 7376 KB Output is correct
38 Correct 4 ms 7500 KB Output is correct
39 Correct 4 ms 7500 KB Output is correct
40 Correct 5 ms 7500 KB Output is correct
41 Correct 4 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 4 ms 7500 KB Output is correct
2 Correct 40 ms 10740 KB Output is correct
3 Correct 26 ms 10072 KB Output is correct
4 Correct 117 ms 40260 KB Output is correct
5 Correct 92 ms 40716 KB Output is correct
6 Correct 520 ms 134432 KB Output is correct
7 Correct 31 ms 10228 KB Output is correct
8 Correct 244 ms 71676 KB Output is correct
9 Correct 179 ms 72072 KB Output is correct
10 Correct 198 ms 67884 KB Output is correct
11 Correct 276 ms 72264 KB Output is correct
12 Correct 298 ms 94540 KB Output is correct
13 Correct 267 ms 66456 KB Output is correct
14 Correct 546 ms 134372 KB Output is correct
15 Correct 541 ms 134560 KB Output is correct
16 Correct 5 ms 7628 KB Output is correct
17 Correct 5 ms 7500 KB Output is correct
18 Correct 4 ms 7376 KB Output is correct
19 Correct 4 ms 7372 KB Output is correct
20 Correct 5 ms 7388 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 4 ms 7372 KB Output is correct