oj.uz

Submission #483613

# Submission time Handle Problem Language Result Execution time Memory
483613 2021-10-31T07:00:03 Z PoPularPlusPlus Paths (BOI18_paths) C++17
23 / 100
 3000 ms 164036 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

const int N = 300003;
int arr[N];
vector<int> adj[N];
ll dp[N][1 << 6];

ll dfs(int node , int mask){
	if(((1 << arr[node]) & mask) > 0)return 0;
	if(dp[node][mask]!=-1)return dp[node][mask] + 1;
	ll res = 0;
	mask += (1 << arr[node]);
	for(int i : adj[node]){
		res += dfs(i , mask);
	}
	return (dp[node][mask] = res) + 1;
}

void solve(){
	int n , m , k;
	cin >> n >> m >> k;
	for(int i = 0; i < n; i++){
		cin >> arr[i + 1];
		arr[i + 1]--;
	}
	memset(dp,-1,sizeof dp);
	for(int i = 0; i < m; i++){
		int a , b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	ll ans = 0;
	for(int i = 1; i <= n; i++){
		ans += dfs(i,0) - 1;
	}
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 157584 KB Output is correct
2 Correct 61 ms 157548 KB Output is correct
3 Correct 62 ms 157640 KB Output is correct
4 Correct 60 ms 157636 KB Output is correct
5 Correct 61 ms 157624 KB Output is correct
6 Correct 69 ms 157580 KB Output is correct
7 Correct 61 ms 157636 KB Output is correct
8 Correct 64 ms 157640 KB Output is correct
9 Correct 64 ms 157636 KB Output is correct
10 Correct 60 ms 157596 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 164036 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 157584 KB Output is correct
2 Correct 61 ms 157548 KB Output is correct
3 Correct 62 ms 157640 KB Output is correct
4 Correct 60 ms 157636 KB Output is correct
5 Correct 61 ms 157624 KB Output is correct
6 Correct 69 ms 157580 KB Output is correct
7 Correct 61 ms 157636 KB Output is correct
8 Correct 64 ms 157640 KB Output is correct
9 Correct 64 ms 157636 KB Output is correct
10 Correct 60 ms 157596 KB Output is correct
11 Execution timed out 3075 ms 164036 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 157600 KB Output is correct
2 Execution timed out 3073 ms 159412 KB Time limit exceeded
3 Halted 0 ms 0 KB -