oj.uz

답안 #418228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
418228 2021-06-05T08:32:35 Z amunduzbaev Paths (BOI18_paths) C++14
100 / 100
 821 ms 198860 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 u=1;u<=n;u++) 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 4 ms 7500 KB Output is correct
3 Correct 4 ms 7372 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 4 ms 7500 KB Output is correct
9 Correct 4 ms 7388 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 16068 KB Output is correct
2 Correct 70 ms 14692 KB Output is correct
3 Correct 404 ms 104816 KB Output is correct
4 Correct 115 ms 19472 KB Output is correct
5 Correct 107 ms 17132 KB Output is correct
6 Correct 279 ms 74124 KB Output is correct
7 Correct 413 ms 104772 KB Output is correct
8 Correct 419 ms 105352 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 4 ms 7500 KB Output is correct
3 Correct 4 ms 7372 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 4 ms 7500 KB Output is correct
9 Correct 4 ms 7388 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 87 ms 16068 KB Output is correct
12 Correct 70 ms 14692 KB Output is correct
13 Correct 404 ms 104816 KB Output is correct
14 Correct 115 ms 19472 KB Output is correct
15 Correct 107 ms 17132 KB Output is correct
16 Correct 279 ms 74124 KB Output is correct
17 Correct 413 ms 104772 KB Output is correct
18 Correct 419 ms 105352 KB Output is correct
19 Correct 88 ms 16012 KB Output is correct
20 Correct 72 ms 14680 KB Output is correct
21 Correct 408 ms 104752 KB Output is correct
22 Correct 116 ms 19600 KB Output is correct
23 Correct 105 ms 17044 KB Output is correct
24 Correct 288 ms 74232 KB Output is correct
25 Correct 403 ms 104748 KB Output is correct
26 Correct 454 ms 105368 KB Output is correct
27 Correct 87 ms 14984 KB Output is correct
28 Correct 135 ms 20880 KB Output is correct
29 Correct 819 ms 198768 KB Output is correct
30 Correct 493 ms 106480 KB Output is correct
31 Correct 486 ms 100892 KB Output is correct
32 Correct 821 ms 198860 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 7352 KB Output is correct
37 Correct 4 ms 7372 KB Output is correct
38 Correct 5 ms 7564 KB Output is correct
39 Correct 5 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 4 ms 7372 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7500 KB Output is correct
2 Correct 41 ms 10276 KB Output is correct
3 Correct 26 ms 9716 KB Output is correct
4 Correct 116 ms 39920 KB Output is correct
5 Correct 91 ms 40244 KB Output is correct
6 Correct 525 ms 134140 KB Output is correct
7 Correct 30 ms 9940 KB Output is correct
8 Correct 223 ms 71204 KB Output is correct
9 Correct 172 ms 71592 KB Output is correct
10 Correct 196 ms 67500 KB Output is correct
11 Correct 273 ms 71792 KB Output is correct
12 Correct 297 ms 94140 KB Output is correct
13 Correct 244 ms 66056 KB Output is correct
14 Correct 570 ms 133928 KB Output is correct
15 Correct 550 ms 134144 KB Output is correct
16 Correct 4 ms 7500 KB Output is correct
17 Correct 4 ms 7500 KB Output is correct
18 Correct 4 ms 7372 KB Output is correct
19 Correct 4 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 4 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 7432 KB Output is correct