oj.uz

Submission #775770

# Submission time Handle Problem Language Result Execution time Memory
775770 2023-07-06T22:24:28 Z Joshua_Andersson The Xana coup (BOI21_xanadu) C++14
100 / 100
 110 ms 40040 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 1

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<ull> vull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
	const uint64_t C = ll(4e18 * acos(0)) | 71;
	ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("C:\\users\\matis\\source\\repos\\comp_prog\\x64\\release\\in.txt");
ifstream filein("C:\\users\\matis\\source\\repos\\comp_prog\\x64\\debug\\dict.txt");
//ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && (!FILE_TC || !_LOCAL)
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) && c != ' ' && c != '\n') { if (c == EOF) { v = -1; return; } v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
inline void readline(string& s) { char c; while ((c = gc()) != EOF && c != '\n') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if(!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debif(expr) ;
#define debassert(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T, typename U> inline int randint(T lo, U hi) { return uniform_int_distribution<int>((int)lo, (int)hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<int>(int(0), int(v.size()) - int(1))(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;
vp2 dirs = { {0,1},{0,-1},{1,0},{-1,0} };

int best2(int i, int col, vp2& childrenvals, vvi& dp2)
{
	if (i == childrenvals.size())
	{
		return col == 0 ? 0 : inf;
	}

	int& v = dp2[i][col];
	if (v != -1) return v;

	int ret = inf;
	ret = min(ret, childrenvals[i].first + best2(i + 1, col, childrenvals, dp2));
	ret = min(ret, childrenvals[i].second + best2(i + 1, (col + 1) % 2, childrenvals, dp2));

	return v=ret;
}

p2 best(int u, int p, int pv, vi& initialcolor, vvi& edges, vvp2& dp)
{
	p2& v = dp[u][pv];
	if (v.first != -1) return v;

	int colu = (initialcolor[u] + pv) % 2;

	p2 res = { inf ,inf };
	rep(i, 2)
	{
		int c = (colu + i) % 2;

		vp2 childrenvals;
		repe(e, edges[u])
		{
			if (e == p) continue;
			p2 k = best(e, u, i, initialcolor, edges, dp);
			childrenvals.push_back(k);
		}

		vvi dp2(childrenvals.size(), vi(2, -1));
		int& k = (i ? res.second : res.first);
		k = i + best2(0, (colu + i) % 2, childrenvals, dp2); // black node white children
	}

	return v=res;
}

int32_t main()
{
	fast();

	dread(int, n);
	vvi edges(n);
	rep(i, n - 1)
	{
		dread2(int, a, b);
		a--; b--;
		edges[a].push_back(b);
		edges[b].push_back(a);
	}
	readvector(int, color, n);

	vvp2 dp(n, vp2(2, p2(- 1,-1)));
	p2 a = best(0, -1, 0, color, edges, dp);
	int ans = min(a.first, a.second);
	if (ans == inf) cout << "impossible";
	else cout << ans;
	

	quit;
}

Compilation message

xanadu.cpp: In function 'll best2(ll, ll, vp2&, vvi&)':
xanadu.cpp:161:8: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |  if (i == childrenvals.size())
      |      ~~^~~~~~~~~~~~~~~~~~~~~~
xanadu.cpp: In function 'p2 best(ll, ll, ll, vi&, vvi&, vvp2&)':
xanadu.cpp:186:7: warning: unused variable 'c' [-Wunused-variable]
  186 |   int c = (colu + i) % 2;
      |       ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 38476 KB Output is correct
2 Correct 87 ms 39248 KB Output is correct
3 Correct 104 ms 39924 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 38456 KB Output is correct
2 Correct 87 ms 39296 KB Output is correct
3 Correct 96 ms 40012 KB Output is correct
4 Correct 69 ms 14088 KB Output is correct
5 Correct 82 ms 15560 KB Output is correct
6 Correct 87 ms 15876 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 23 ms 5484 KB Output is correct
9 Correct 78 ms 15436 KB Output is correct
10 Correct 84 ms 15796 KB Output is correct
11 Correct 107 ms 17084 KB Output is correct
12 Correct 84 ms 17764 KB Output is correct
13 Correct 81 ms 15160 KB Output is correct
14 Correct 85 ms 16076 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 91 ms 38476 KB Output is correct
18 Correct 87 ms 39248 KB Output is correct
19 Correct 104 ms 39924 KB Output is correct
20 Correct 87 ms 38456 KB Output is correct
21 Correct 87 ms 39296 KB Output is correct
22 Correct 96 ms 40012 KB Output is correct
23 Correct 69 ms 14088 KB Output is correct
24 Correct 82 ms 15560 KB Output is correct
25 Correct 87 ms 15876 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 23 ms 5484 KB Output is correct
28 Correct 78 ms 15436 KB Output is correct
29 Correct 84 ms 15796 KB Output is correct
30 Correct 107 ms 17084 KB Output is correct
31 Correct 84 ms 17764 KB Output is correct
32 Correct 81 ms 15160 KB Output is correct
33 Correct 85 ms 16076 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 103 ms 39824 KB Output is correct
46 Correct 85 ms 39244 KB Output is correct
47 Correct 108 ms 40040 KB Output is correct
48 Correct 72 ms 14192 KB Output is correct
49 Correct 85 ms 15436 KB Output is correct
50 Correct 81 ms 15872 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 23 ms 5512 KB Output is correct
53 Correct 79 ms 15516 KB Output is correct
54 Correct 98 ms 15796 KB Output is correct
55 Correct 88 ms 17284 KB Output is correct
56 Correct 87 ms 17740 KB Output is correct
57 Correct 76 ms 15072 KB Output is correct
58 Correct 82 ms 16152 KB Output is correct
59 Correct 23 ms 5416 KB Output is correct
60 Correct 93 ms 14044 KB Output is correct
61 Correct 95 ms 15464 KB Output is correct
62 Correct 79 ms 15668 KB Output is correct
63 Correct 78 ms 15692 KB Output is correct
64 Correct 89 ms 15688 KB Output is correct
65 Correct 84 ms 16068 KB Output is correct
66 Correct 75 ms 15972 KB Output is correct
67 Correct 109 ms 30616 KB Output is correct
68 Correct 110 ms 30624 KB Output is correct
69 Correct 99 ms 30640 KB Output is correct
70 Correct 102 ms 30636 KB Output is correct