oj.uz

Submission #775829

# Submission time Handle Problem Language Result Execution time Memory
775829 2023-07-07T04:45:39 Z horiiseun Paths (BOI18_paths) C++17
100 / 100
 426 ms 139444 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

int n, m, k, c[300005];
ll dp[300005][50], ans;
vector<int> adj[300005];

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		cin >> c[i];
		c[i]--;
		dp[i][1 << c[i]] = 1;
	}
	for (int i = 0, a, b; i < m; i++) {
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}

	for (int i = 2; i <= 5; i++) {
		vector<int> frm;
		for (int j = 1; j <= 31; j++) {
			if (__builtin_popcount(j) == i) {
				frm.push_back(j);
			}
		}
		for (int j = 1; j <= n; j++) {
			for (int p : adj[j]) {
				for (int msk : frm) {
					if (msk >> c[j] & 1) {
						dp[j][msk] += dp[p][msk ^ (1 << c[j])];	
					}
				}
			}
		}
	}

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= 31; j++) {
			ans += dp[i][j];
		}
	}

	cout << ans - n << "\n";

}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 3 ms 7372 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 3 ms 7392 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 3 ms 7376 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15816 KB Output is correct
2 Correct 56 ms 13416 KB Output is correct
3 Correct 408 ms 138800 KB Output is correct
4 Correct 140 ms 26956 KB Output is correct
5 Correct 124 ms 27032 KB Output is correct
6 Correct 310 ms 97556 KB Output is correct
7 Correct 399 ms 138872 KB Output is correct
8 Correct 405 ms 139348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 3 ms 7372 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 3 ms 7392 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 3 ms 7376 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 69 ms 15816 KB Output is correct
12 Correct 56 ms 13416 KB Output is correct
13 Correct 408 ms 138800 KB Output is correct
14 Correct 140 ms 26956 KB Output is correct
15 Correct 124 ms 27032 KB Output is correct
16 Correct 310 ms 97556 KB Output is correct
17 Correct 399 ms 138872 KB Output is correct
18 Correct 405 ms 139348 KB Output is correct
19 Correct 68 ms 15824 KB Output is correct
20 Correct 72 ms 13524 KB Output is correct
21 Correct 400 ms 138712 KB Output is correct
22 Correct 124 ms 27008 KB Output is correct
23 Correct 122 ms 26972 KB Output is correct
24 Correct 304 ms 97596 KB Output is correct
25 Correct 388 ms 138788 KB Output is correct
26 Correct 426 ms 139444 KB Output is correct
27 Correct 54 ms 13476 KB Output is correct
28 Correct 75 ms 17692 KB Output is correct
29 Correct 389 ms 138796 KB Output is correct
30 Correct 327 ms 76420 KB Output is correct
31 Correct 304 ms 76540 KB Output is correct
32 Correct 425 ms 138800 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 3 ms 7380 KB Output is correct
35 Correct 3 ms 7380 KB Output is correct
36 Correct 4 ms 7380 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 3 ms 7372 KB Output is correct
39 Correct 3 ms 7380 KB Output is correct
40 Correct 3 ms 7380 KB Output is correct
41 Correct 4 ms 7376 KB Output is correct
42 Correct 3 ms 7372 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 23 ms 9448 KB Output is correct
3 Correct 22 ms 9416 KB Output is correct
4 Correct 139 ms 50984 KB Output is correct
5 Correct 91 ms 51792 KB Output is correct
6 Correct 116 ms 51032 KB Output is correct
7 Correct 20 ms 9404 KB Output is correct
8 Correct 123 ms 51036 KB Output is correct
9 Correct 91 ms 51784 KB Output is correct
10 Correct 110 ms 51820 KB Output is correct
11 Correct 67 ms 29988 KB Output is correct
12 Correct 81 ms 41076 KB Output is correct
13 Correct 71 ms 30320 KB Output is correct
14 Correct 112 ms 51032 KB Output is correct
15 Correct 117 ms 51124 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 3 ms 7372 KB Output is correct
19 Correct 4 ms 7376 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7376 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 4 ms 7372 KB Output is correct
25 Correct 5 ms 7380 KB Output is correct