oj.uz

답안 #338166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338166 2020-12-22T15:28:32 Z Benq 경주 (Race) (IOI11_race) C++14
100 / 100
 318 ms 52760 KB 
#include "race.h"

#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!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#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>; 
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

// 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 ft front()
#define bk back()
#define pb push_back
#define eb emplace_back 
#define pf push_front

#define lb lower_bound
#define ub upper_bound 
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }

// loops
#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 = 1e6+5; // 998244353;
const int MX = 2e5+5;
const ll INF = 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>>;

// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
	return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }

ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; }

tcTU> T fstTrue(T lo, T hi, U f) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo)/2;
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = lo+(hi-lo+1)/2;
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
	sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
	auto it = t.find(u); assert(it != end(t));
	t.erase(it); } // element that doesn't exist from (multi)set

// INPUT
#define tcTUU tcT, class ...U
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(V<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);

tcT> void re(T& x) { cin >> x; }
void re(double& d) { str t; re(t); d = stod(t); }
void re(long double& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }

tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(V<T>& x) { trav(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }
tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
tcT> str ts(complex<T> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(V<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+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; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
tcTU> str ts(pair<T,U> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) { 
	pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) { 
	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
	DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

void setPrec() { cout << fixed << setprecision(15); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s = "") {
	unsyncIO(); setPrec();
	// 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
}

const int BIG = 1000005;

vpi adj[MX];
int sz[MX], depth[MX], K;
ll len[MX];
int ti[BIG], bes[BIG];
int timer = 1;

void dfs_sz(int a) {
	sz[a] = 1;
	trav(t,adj[a]) {
		depth[t.f] = depth[a]+1;
		len[t.f] = len[a]+t.s;
		adj[t.f].erase(find(all(adj[t.f]),mp(a,t.s)));
		dfs_sz(t.f);
		sz[a] += sz[t.f];
		if (sz[t.f] > sz[adj[a][0].f]) swap(adj[a][0],t);
	}
}

vi tmp;
int ans;

void add_all(int a) {
	// dbg("ADD ALL",tmp,a);
	trav(t,tmp) {
		ll rest = K-(len[t]-len[a]);
		if (rest < 0) continue;
		rest += len[a];
		int pos = rest%MOD;
		if (ti[pos] != timer) continue;
		if (len[bes[pos]] == rest) {
			// dbg("WHOOPS",a,t,bes[pos]);
			ckmin(ans,depth[bes[pos]]-2*depth[a]+depth[t]);
		}
	}
	trav(t,tmp) {
		int pos = len[t]%MOD;
		if (ti[pos] != timer) {
			ti[pos] = timer;
			bes[pos] = t;
		} else if (len[bes[pos]] != len[t]) {
			if (len[t] < len[bes[pos]]) swap(bes[pos],t);
		} else {
			if (depth[t] < depth[bes[pos]]) swap(bes[pos],t);
		}
	}
	tmp.clear();
}

void get_list(int a) {
	tmp.pb(a);
	trav(t,adj[a]) get_list(t.f);
}

void go(int a) {
	// dbg("GO",a,adj[a]);
	R0F(i,sz(adj[a])) {
		go(adj[a][i].f);
		if (i != 0) {
			++ timer;
			// dbg("CLEARED");
		}
	}
	tmp = {a}; add_all(a);
	FOR(i,1,sz(adj[a])) {
		get_list(adj[a][i].f); 
		add_all(a);
	}
}

int best_path(int N, int _K, int H[][2], int L[]) {
	K = _K;
	F0R(i,N-1) {
		adj[H[i][0]].pb({H[i][1],L[i]});
		adj[H[i][1]].pb({H[i][0],L[i]});
	}
	dfs_sz(0);
	F0R(i,N) dbg(i,len[i],depth[i]);
	ans = N;
	go(0);
	if (ans == N) ans = -1;
	return ans;
}

Compilation message

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:190:19: warning: statement has no effect [-Wunused-value]
  190 |  #define dbg(...) 0
      |                   ^
race.cpp:285:11: note: in expansion of macro 'dbg'
  285 |  F0R(i,N) dbg(i,len[i],depth[i]);
      |           ^~~
race.cpp: In function 'void setIn(str)':
race.cpp:197:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  197 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
race.cpp: In function 'void setOut(str)':
race.cpp:198:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  198 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 3 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 3 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 3 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 3 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 3 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 3 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 3 ms 5100 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 7 ms 10092 KB Output is correct
23 Correct 7 ms 10092 KB Output is correct
24 Correct 8 ms 10092 KB Output is correct
25 Correct 7 ms 8172 KB Output is correct
26 Correct 8 ms 10220 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 6 ms 8044 KB Output is correct
29 Correct 7 ms 8576 KB Output is correct
30 Correct 6 ms 8172 KB Output is correct
31 Correct 7 ms 8812 KB Output is correct
32 Correct 6 ms 8300 KB Output is correct
33 Correct 7 ms 9068 KB Output is correct
34 Correct 8 ms 9964 KB Output is correct
35 Correct 7 ms 9836 KB Output is correct
36 Correct 7 ms 9708 KB Output is correct
37 Correct 6 ms 8684 KB Output is correct
38 Correct 6 ms 7532 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 3 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 3 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 3 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 115 ms 13244 KB Output is correct
20 Correct 110 ms 13052 KB Output is correct
21 Correct 110 ms 13164 KB Output is correct
22 Correct 111 ms 13164 KB Output is correct
23 Correct 88 ms 13420 KB Output is correct
24 Correct 74 ms 13292 KB Output is correct
25 Correct 76 ms 19312 KB Output is correct
26 Correct 58 ms 24812 KB Output is correct
27 Correct 179 ms 21100 KB Output is correct
28 Correct 210 ms 52760 KB Output is correct
29 Correct 193 ms 50924 KB Output is correct
30 Correct 179 ms 21060 KB Output is correct
31 Correct 187 ms 21120 KB Output is correct
32 Correct 251 ms 21356 KB Output is correct
33 Correct 204 ms 20744 KB Output is correct
34 Correct 244 ms 29164 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5100 KB Output is correct
2 Correct 3 ms 5100 KB Output is correct
3 Correct 3 ms 5100 KB Output is correct
4 Correct 3 ms 5100 KB Output is correct
5 Correct 3 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 3 ms 5100 KB Output is correct
12 Correct 4 ms 5100 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 3 ms 5100 KB Output is correct
15 Correct 4 ms 5100 KB Output is correct
16 Correct 3 ms 5100 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 4 ms 5100 KB Output is correct
19 Correct 3 ms 5100 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 4 ms 5100 KB Output is correct
22 Correct 7 ms 10092 KB Output is correct
23 Correct 7 ms 10092 KB Output is correct
24 Correct 8 ms 10092 KB Output is correct
25 Correct 7 ms 8172 KB Output is correct
26 Correct 8 ms 10220 KB Output is correct
27 Correct 4 ms 5100 KB Output is correct
28 Correct 6 ms 8044 KB Output is correct
29 Correct 7 ms 8576 KB Output is correct
30 Correct 6 ms 8172 KB Output is correct
31 Correct 7 ms 8812 KB Output is correct
32 Correct 6 ms 8300 KB Output is correct
33 Correct 7 ms 9068 KB Output is correct
34 Correct 8 ms 9964 KB Output is correct
35 Correct 7 ms 9836 KB Output is correct
36 Correct 7 ms 9708 KB Output is correct
37 Correct 6 ms 8684 KB Output is correct
38 Correct 6 ms 7532 KB Output is correct
39 Correct 115 ms 13244 KB Output is correct
40 Correct 110 ms 13052 KB Output is correct
41 Correct 110 ms 13164 KB Output is correct
42 Correct 111 ms 13164 KB Output is correct
43 Correct 88 ms 13420 KB Output is correct
44 Correct 74 ms 13292 KB Output is correct
45 Correct 76 ms 19312 KB Output is correct
46 Correct 58 ms 24812 KB Output is correct
47 Correct 179 ms 21100 KB Output is correct
48 Correct 210 ms 52760 KB Output is correct
49 Correct 193 ms 50924 KB Output is correct
50 Correct 179 ms 21060 KB Output is correct
51 Correct 187 ms 21120 KB Output is correct
52 Correct 251 ms 21356 KB Output is correct
53 Correct 204 ms 20744 KB Output is correct
54 Correct 244 ms 29164 KB Output is correct
55 Correct 11 ms 5996 KB Output is correct
56 Correct 9 ms 5868 KB Output is correct
57 Correct 64 ms 13420 KB Output is correct
58 Correct 47 ms 12896 KB Output is correct
59 Correct 58 ms 26348 KB Output is correct
60 Correct 189 ms 51564 KB Output is correct
61 Correct 183 ms 21484 KB Output is correct
62 Correct 181 ms 21228 KB Output is correct
63 Correct 242 ms 21304 KB Output is correct
64 Correct 318 ms 24556 KB Output is correct
65 Correct 305 ms 29932 KB Output is correct
66 Correct 195 ms 47212 KB Output is correct
67 Correct 163 ms 21724 KB Output is correct
68 Correct 269 ms 27244 KB Output is correct
69 Correct 255 ms 28140 KB Output is correct
70 Correct 234 ms 27500 KB Output is correct