oj.uz

Submission #117479

# Submission time Handle Problem Language Result Execution time Memory
117479 2019-06-16T07:34:01 Z ckodser Paths (BOI18_paths) C++14
70 / 100
 726 ms 95408 KB 
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}

#define ll long long
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=3e5+500;

ll a[maxn];
vector<ll> ger[maxn];
ll dp[32][maxn];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);	
	ll n,m,k;
	cin>>n>>m>>k;
	for(ll i=0;i<n;i++){
		cin>>a[i];
	}
	for(ll i=0;i<m;i++){
		ll a,b;
		cin>>a>>b;
		a--;b--;
		ger[a].pb(b);
		ger[b].pb(a);
	}
	ll ans=0;
	for(ll mas=1;mas<32;mas++){
		for(ll i=0;i<n;i++){
			if((mas>>a[i])&1){
				ll nmas=(mas^(1<<a[i]));	
				if(nmas==0){
					dp[mas][i]=1;
					continue;
				}		
				for(auto r:ger[i]){
					dp[mas][i]+=dp[nmas][r];
				}
			}
			ans+=dp[mas][i];
		}
	}
	cout<<ans;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7680 KB Output is correct
2 Correct 8 ms 7680 KB Output is correct
3 Correct 7 ms 7680 KB Output is correct
4 Correct 7 ms 7652 KB Output is correct
5 Correct 8 ms 7552 KB Output is correct
6 Correct 8 ms 7680 KB Output is correct
7 Correct 7 ms 7680 KB Output is correct
8 Correct 8 ms 7808 KB Output is correct
9 Correct 7 ms 7680 KB Output is correct
10 Correct 8 ms 7680 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 15856 KB Output is correct
2 Correct 78 ms 14836 KB Output is correct
3 Correct 660 ms 90324 KB Output is correct
4 Correct 243 ms 25084 KB Output is correct
5 Correct 240 ms 23068 KB Output is correct
6 Correct 451 ms 66148 KB Output is correct
7 Correct 658 ms 90816 KB Output is correct
8 Correct 627 ms 91444 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7680 KB Output is correct
2 Correct 8 ms 7680 KB Output is correct
3 Correct 7 ms 7680 KB Output is correct
4 Correct 7 ms 7652 KB Output is correct
5 Correct 8 ms 7552 KB Output is correct
6 Correct 8 ms 7680 KB Output is correct
7 Correct 7 ms 7680 KB Output is correct
8 Correct 8 ms 7808 KB Output is correct
9 Correct 7 ms 7680 KB Output is correct
10 Correct 8 ms 7680 KB Output is correct
11 Correct 99 ms 15856 KB Output is correct
12 Correct 78 ms 14836 KB Output is correct
13 Correct 660 ms 90324 KB Output is correct
14 Correct 243 ms 25084 KB Output is correct
15 Correct 240 ms 23068 KB Output is correct
16 Correct 451 ms 66148 KB Output is correct
17 Correct 658 ms 90816 KB Output is correct
18 Correct 627 ms 91444 KB Output is correct
19 Correct 100 ms 18680 KB Output is correct
20 Correct 73 ms 17116 KB Output is correct
21 Correct 628 ms 90784 KB Output is correct
22 Correct 199 ms 24952 KB Output is correct
23 Correct 212 ms 23288 KB Output is correct
24 Correct 421 ms 66020 KB Output is correct
25 Correct 656 ms 90668 KB Output is correct
26 Correct 651 ms 91488 KB Output is correct
27 Correct 82 ms 17144 KB Output is correct
28 Correct 134 ms 21020 KB Output is correct
29 Correct 726 ms 95408 KB Output is correct
30 Correct 406 ms 56896 KB Output is correct
31 Correct 382 ms 54504 KB Output is correct
32 Correct 689 ms 95396 KB Output is correct
33 Correct 9 ms 7680 KB Output is correct
34 Correct 8 ms 7680 KB Output is correct
35 Correct 8 ms 7680 KB Output is correct
36 Correct 9 ms 7680 KB Output is correct
37 Correct 8 ms 7680 KB Output is correct
38 Correct 8 ms 7680 KB Output is correct
39 Correct 8 ms 7680 KB Output is correct
40 Correct 8 ms 7680 KB Output is correct
41 Correct 8 ms 7680 KB Output is correct
42 Correct 8 ms 7680 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7552 KB Output isn't correct
2 Halted 0 ms 0 KB -