oj.uz

Submission #216628

# Submission time Handle Problem Language Result Execution time Memory
216628 2020-03-27T17:21:24 Z rqi Race (IOI11_race) C++14
100 / 100
 603 ms 116004 KB 
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_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 trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

ll k;
vector<pair<int, ll>> adj[200005];
int ans = MOD;
ll dists[200005];
int onedist[200005];
int par[200005];
vi children[200005];
void genPars(int node = 0, int prv = -1, ll dist = 0, int odist = 0){
	dists[node] = dist;
	onedist[node] = odist;
	for(auto u: adj[node]){
		if(u.f == prv) continue;
		par[u.f] = node;
		children[node].pb(u.f);
		genPars(u.f, node, dist+u.s, odist+1);
	}
}
map<ll, int> paths[200005];
void solve(int node = 0){
	for(auto u: children[node]){
		solve(u);
	}
	ll need = k+2*dists[node];
	int adjust = -2*onedist[node]; // add this to k answers
	paths[node][dists[node]] = onedist[node];
	for(auto u: children[node]){
		if(sz(paths[u]) > sz(paths[node])) swap(paths[u], paths[node]);
		for(auto x: paths[u]){ //update ans
			if(paths[node].count(need-x.f)){
				ckmin(ans, paths[node][need-x.f]+x.s+adjust);
			}
		}
		for(auto x: paths[u]){ //insert
			if(paths[node].count(x.f)){
				ckmin(paths[node][x.f], x.s);
			}
			else{
				paths[node][x.f] = x.s;
			}
		}
	}
}

int best_path(int N, int K, int H[][2], int L[])
{
	k = ll(K); // Don't use K
	for(int i = 0; i < N-1; i++){
		adj[H[i][0]].pb(mp(H[i][1], ll(L[i])));
		adj[H[i][1]].pb(mp(H[i][0], ll(L[i])));
	}

	//generate par and children and distance to root
	genPars();
	//Make the main solve function using swaps + map
	solve();
	if(ans == MOD) return -1;
	return ans;
}

Compilation message

race.cpp: In function 'void setIn(std::__cxx11::string)':
race.cpp:124:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
race.cpp: In function 'void setOut(std::__cxx11::string)':
race.cpp:125:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 16 ms 19328 KB Output is correct
8 Correct 17 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 18 ms 19200 KB Output is correct
11 Correct 15 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19200 KB Output is correct
16 Correct 16 ms 19068 KB Output is correct
17 Correct 16 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 16 ms 19328 KB Output is correct
8 Correct 17 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 18 ms 19200 KB Output is correct
11 Correct 15 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19200 KB Output is correct
16 Correct 16 ms 19068 KB Output is correct
17 Correct 16 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct
19 Correct 15 ms 19200 KB Output is correct
20 Correct 16 ms 19200 KB Output is correct
21 Correct 17 ms 19456 KB Output is correct
22 Correct 17 ms 19456 KB Output is correct
23 Correct 17 ms 19456 KB Output is correct
24 Correct 17 ms 19456 KB Output is correct
25 Correct 17 ms 19456 KB Output is correct
26 Correct 20 ms 19840 KB Output is correct
27 Correct 16 ms 19328 KB Output is correct
28 Correct 17 ms 19456 KB Output is correct
29 Correct 18 ms 19456 KB Output is correct
30 Correct 17 ms 19456 KB Output is correct
31 Correct 20 ms 19456 KB Output is correct
32 Correct 17 ms 19456 KB Output is correct
33 Correct 17 ms 19456 KB Output is correct
34 Correct 19 ms 19456 KB Output is correct
35 Correct 17 ms 19456 KB Output is correct
36 Correct 17 ms 19456 KB Output is correct
37 Correct 16 ms 19456 KB Output is correct
38 Correct 13 ms 19448 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 16 ms 19328 KB Output is correct
8 Correct 17 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 18 ms 19200 KB Output is correct
11 Correct 15 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19200 KB Output is correct
16 Correct 16 ms 19068 KB Output is correct
17 Correct 16 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct
19 Correct 170 ms 45816 KB Output is correct
20 Correct 195 ms 45816 KB Output is correct
21 Correct 179 ms 45432 KB Output is correct
22 Correct 176 ms 44920 KB Output is correct
23 Correct 218 ms 57696 KB Output is correct
24 Correct 175 ms 47028 KB Output is correct
25 Correct 146 ms 46200 KB Output is correct
26 Correct 94 ms 52988 KB Output is correct
27 Correct 248 ms 60664 KB Output is correct
28 Correct 428 ms 99576 KB Output is correct
29 Correct 433 ms 98296 KB Output is correct
30 Correct 252 ms 60792 KB Output is correct
31 Correct 247 ms 60664 KB Output is correct
32 Correct 374 ms 60792 KB Output is correct
33 Correct 350 ms 68344 KB Output is correct
34 Correct 488 ms 101368 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 15 ms 19200 KB Output is correct
3 Correct 16 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19200 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 16 ms 19328 KB Output is correct
8 Correct 17 ms 19200 KB Output is correct
9 Correct 16 ms 19200 KB Output is correct
10 Correct 18 ms 19200 KB Output is correct
11 Correct 15 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19200 KB Output is correct
16 Correct 16 ms 19068 KB Output is correct
17 Correct 16 ms 19200 KB Output is correct
18 Correct 16 ms 19200 KB Output is correct
19 Correct 15 ms 19200 KB Output is correct
20 Correct 16 ms 19200 KB Output is correct
21 Correct 17 ms 19456 KB Output is correct
22 Correct 17 ms 19456 KB Output is correct
23 Correct 17 ms 19456 KB Output is correct
24 Correct 17 ms 19456 KB Output is correct
25 Correct 17 ms 19456 KB Output is correct
26 Correct 20 ms 19840 KB Output is correct
27 Correct 16 ms 19328 KB Output is correct
28 Correct 17 ms 19456 KB Output is correct
29 Correct 18 ms 19456 KB Output is correct
30 Correct 17 ms 19456 KB Output is correct
31 Correct 20 ms 19456 KB Output is correct
32 Correct 17 ms 19456 KB Output is correct
33 Correct 17 ms 19456 KB Output is correct
34 Correct 19 ms 19456 KB Output is correct
35 Correct 17 ms 19456 KB Output is correct
36 Correct 17 ms 19456 KB Output is correct
37 Correct 16 ms 19456 KB Output is correct
38 Correct 13 ms 19448 KB Output is correct
39 Correct 170 ms 45816 KB Output is correct
40 Correct 195 ms 45816 KB Output is correct
41 Correct 179 ms 45432 KB Output is correct
42 Correct 176 ms 44920 KB Output is correct
43 Correct 218 ms 57696 KB Output is correct
44 Correct 175 ms 47028 KB Output is correct
45 Correct 146 ms 46200 KB Output is correct
46 Correct 94 ms 52988 KB Output is correct
47 Correct 248 ms 60664 KB Output is correct
48 Correct 428 ms 99576 KB Output is correct
49 Correct 433 ms 98296 KB Output is correct
50 Correct 252 ms 60792 KB Output is correct
51 Correct 247 ms 60664 KB Output is correct
52 Correct 374 ms 60792 KB Output is correct
53 Correct 350 ms 68344 KB Output is correct
54 Correct 488 ms 101368 KB Output is correct
55 Correct 33 ms 22776 KB Output is correct
56 Correct 24 ms 21504 KB Output is correct
57 Correct 113 ms 43000 KB Output is correct
58 Correct 75 ms 34280 KB Output is correct
59 Correct 129 ms 59256 KB Output is correct
60 Correct 401 ms 98552 KB Output is correct
61 Correct 299 ms 64376 KB Output is correct
62 Correct 248 ms 60792 KB Output is correct
63 Correct 344 ms 60792 KB Output is correct
64 Correct 603 ms 116004 KB Output is correct
65 Correct 582 ms 113648 KB Output is correct
66 Correct 432 ms 95228 KB Output is correct
67 Correct 251 ms 51164 KB Output is correct
68 Correct 448 ms 76536 KB Output is correct
69 Correct 481 ms 81272 KB Output is correct
70 Correct 437 ms 74232 KB Output is correct