oj.uz

Submission #171669

# Submission time Handle Problem Language Result Execution time Memory
171669 2019-12-29T21:54:09 Z alishahali1382 Paths (BOI18_paths) C++14
100 / 100
 519 ms 32008 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 300010, LOG=20;

ll n, m, k, u, v, x, y, t, a, b, ans;
ll dp[6][MAXN];
int col[MAXN];
vector<int> G[MAXN], vec[6];
bool mark[6];

void bt(int last, int lv){
	lv++;
	for (int c=1; c<=k; c++) if (!mark[c]){
		mark[c]=1;
		memset(dp[lv], 0, sizeof(dp[lv]));
		for (int v:vec[c]){
			for (int u:G[v]) if (col[u]==last) dp[lv][v]+=dp[lv-1][u];
			ans+=dp[lv][v];
		}
		bt(c, lv);
		mark[c]=0;
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m>>k;
	for (int i=1; i<=n; i++) cin>>col[i], vec[col[i]].pb(i);
	while (m--){
		cin>>u>>v;
		G[u].pb(v);
		G[v].pb(u);
	}
	for (int i=1; i<=k; i++){
		mark[i]=1;
		for (int v:vec[i]) dp[1][v]=1;
		bt(i, 1);
		mark[i]=0;
	}
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14456 KB Output is correct
2 Correct 22 ms 14456 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 8 ms 7416 KB Output is correct
6 Correct 21 ms 14456 KB Output is correct
7 Correct 22 ms 14456 KB Output is correct
8 Correct 22 ms 14456 KB Output is correct
9 Correct 22 ms 14456 KB Output is correct
10 Correct 14 ms 12024 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 18680 KB Output is correct
2 Correct 87 ms 17884 KB Output is correct
3 Correct 317 ms 29672 KB Output is correct
4 Correct 127 ms 18040 KB Output is correct
5 Correct 131 ms 15736 KB Output is correct
6 Correct 236 ms 26464 KB Output is correct
7 Correct 325 ms 29668 KB Output is correct
8 Correct 395 ms 30484 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14456 KB Output is correct
2 Correct 22 ms 14456 KB Output is correct
3 Correct 13 ms 12152 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 8 ms 7416 KB Output is correct
6 Correct 21 ms 14456 KB Output is correct
7 Correct 22 ms 14456 KB Output is correct
8 Correct 22 ms 14456 KB Output is correct
9 Correct 22 ms 14456 KB Output is correct
10 Correct 14 ms 12024 KB Output is correct
11 Correct 107 ms 18680 KB Output is correct
12 Correct 87 ms 17884 KB Output is correct
13 Correct 317 ms 29672 KB Output is correct
14 Correct 127 ms 18040 KB Output is correct
15 Correct 131 ms 15736 KB Output is correct
16 Correct 236 ms 26464 KB Output is correct
17 Correct 325 ms 29668 KB Output is correct
18 Correct 395 ms 30484 KB Output is correct
19 Correct 109 ms 18708 KB Output is correct
20 Correct 87 ms 17912 KB Output is correct
21 Correct 321 ms 29696 KB Output is correct
22 Correct 131 ms 17916 KB Output is correct
23 Correct 121 ms 15584 KB Output is correct
24 Correct 232 ms 26464 KB Output is correct
25 Correct 311 ms 29860 KB Output is correct
26 Correct 307 ms 30312 KB Output is correct
27 Correct 136 ms 20188 KB Output is correct
28 Correct 169 ms 21976 KB Output is correct
29 Correct 511 ms 32008 KB Output is correct
30 Correct 313 ms 26800 KB Output is correct
31 Correct 315 ms 26824 KB Output is correct
32 Correct 519 ms 32000 KB Output is correct
33 Correct 21 ms 14456 KB Output is correct
34 Correct 22 ms 14456 KB Output is correct
35 Correct 13 ms 12024 KB Output is correct
36 Correct 10 ms 9720 KB Output is correct
37 Correct 8 ms 7416 KB Output is correct
38 Correct 22 ms 14456 KB Output is correct
39 Correct 21 ms 14456 KB Output is correct
40 Correct 22 ms 14456 KB Output is correct
41 Correct 21 ms 14456 KB Output is correct
42 Correct 13 ms 12152 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 16860 KB Output is correct
2 Correct 117 ms 18524 KB Output is correct
3 Correct 37 ms 13944 KB Output is correct
4 Correct 85 ms 17904 KB Output is correct
5 Correct 65 ms 18512 KB Output is correct
6 Correct 356 ms 22668 KB Output is correct
7 Correct 53 ms 16248 KB Output is correct
8 Correct 144 ms 20256 KB Output is correct
9 Correct 116 ms 20976 KB Output is correct
10 Correct 102 ms 20844 KB Output is correct
11 Correct 228 ms 20612 KB Output is correct
12 Correct 180 ms 22132 KB Output is correct
13 Correct 227 ms 20684 KB Output is correct
14 Correct 353 ms 22776 KB Output is correct
15 Correct 342 ms 22680 KB Output is correct
16 Correct 21 ms 14456 KB Output is correct
17 Correct 21 ms 14456 KB Output is correct
18 Correct 13 ms 12156 KB Output is correct
19 Correct 10 ms 9720 KB Output is correct
20 Correct 8 ms 7416 KB Output is correct
21 Correct 22 ms 14456 KB Output is correct
22 Correct 21 ms 14456 KB Output is correct
23 Correct 21 ms 14456 KB Output is correct
24 Correct 21 ms 14456 KB Output is correct
25 Correct 13 ms 12076 KB Output is correct