oj.uz

Submission #633416

# Submission time Handle Problem Language Result Execution time Memory
633416 2022-08-22T11:53:23 Z IWTIM Putovanje (COCI20_putovanje) C++14
110 / 110
 167 ms 39804 KB 
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define f first
#define s second
#define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int t,n,a[N], ans,par[N][20],valx[N],valy[N],tin,in[N],out[N],cnt[N];
vector < pair <int, pii > > v[N];
void dfs(int a, int p, int x, int y) {
	par[a][0] = p;
	for (int i = 1; i <= 18; i++) {
		if (par[a][i - 1]) par[a][i] = par[par[a][i - 1]][i - 1];
	}
	valx[a] = x;
	valy[a] = y;
	tin++;
	in[a] = tin;
	for (auto to : v[a]) {
		if (to.f == p) continue;
		dfs(to.f,a, to.s.f, to.s.s);
	}
	out[a] = tin;
}
int upper(int a, int b) {
	return (in[a] <= in[b] && out[a] >= out[b]);
}
int lca(int a, int b) {
	if (upper(a,b)) return a;
	for (int i = 18; i >= 0; i--) {
		if (par[a][i] && !upper(par[a][i], b)) a = par[a][i];
	}
	return par[a][0];
}
void dfs1(int a, int p) {
	for (auto to : v[a]) {
		if (to.f == p) continue;
		dfs1(to.f,a);
		cnt[a] += cnt[to.f];
	}
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for (int i = 1; i <= n - 1; i++) {
    	int a,b,x,y;
    	cin>>a>>b>>x>>y;
		v[a].pb({b,{x,y}});
		v[b].pb({a,{x,y}});
	}
	dfs(1,0,0,0);
	for (int i = 1; i < n; i++) {
		cnt[i]++;
		cnt[i + 1]++;
		cnt[lca(i,i + 1)]-=2;
	}
	dfs1(1,0);
	for (int i = 2; i <= n; i++) {
		ans += min(valy[i], cnt[i]*valx[i]);
	}
	cout<<ans<<"\n";
}

Compilation message

putovanje.cpp:221:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  221 | main() {
      | ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 5 ms 7764 KB Output is correct
3 Correct 5 ms 7892 KB Output is correct
4 Correct 5 ms 7892 KB Output is correct
5 Correct 5 ms 7876 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7764 KB Output is correct
9 Correct 5 ms 7892 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 33416 KB Output is correct
2 Correct 145 ms 34568 KB Output is correct
3 Correct 146 ms 37216 KB Output is correct
4 Correct 167 ms 39804 KB Output is correct
5 Correct 5 ms 7516 KB Output is correct
6 Correct 115 ms 34540 KB Output is correct
7 Correct 74 ms 27024 KB Output is correct
8 Correct 123 ms 35552 KB Output is correct
9 Correct 75 ms 37068 KB Output is correct
10 Correct 74 ms 36172 KB Output is correct
11 Correct 83 ms 38656 KB Output is correct
12 Correct 79 ms 38828 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 5 ms 7764 KB Output is correct
3 Correct 5 ms 7892 KB Output is correct
4 Correct 5 ms 7892 KB Output is correct
5 Correct 5 ms 7876 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7508 KB Output is correct
8 Correct 4 ms 7764 KB Output is correct
9 Correct 5 ms 7892 KB Output is correct
10 Correct 117 ms 33416 KB Output is correct
11 Correct 145 ms 34568 KB Output is correct
12 Correct 146 ms 37216 KB Output is correct
13 Correct 167 ms 39804 KB Output is correct
14 Correct 5 ms 7516 KB Output is correct
15 Correct 115 ms 34540 KB Output is correct
16 Correct 74 ms 27024 KB Output is correct
17 Correct 123 ms 35552 KB Output is correct
18 Correct 75 ms 37068 KB Output is correct
19 Correct 74 ms 36172 KB Output is correct
20 Correct 83 ms 38656 KB Output is correct
21 Correct 79 ms 38828 KB Output is correct
22 Correct 97 ms 34660 KB Output is correct
23 Correct 79 ms 31388 KB Output is correct
24 Correct 105 ms 34164 KB Output is correct
25 Correct 6 ms 7636 KB Output is correct
26 Correct 39 ms 19616 KB Output is correct
27 Correct 79 ms 30344 KB Output is correct
28 Correct 60 ms 33628 KB Output is correct
29 Correct 78 ms 38792 KB Output is correct
30 Correct 73 ms 38368 KB Output is correct
31 Correct 5 ms 7764 KB Output is correct