oj.uz

Submission #378164

# Submission time Handle Problem Language Result Execution time Memory
378164 2021-03-16T05:54:09 Z arwaeystoamneg Race (IOI11_race) C++17
100 / 100
 503 ms 75372 KB 
/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

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

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 998244353;//1000000007
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
#ifndef arwaeystoamneg
#include "race.h"
#endif
int n, k;
vector<vpi>adj;
vi parent, dist, depth;
int ans = inf;
void dfs0(int i, int p)
{
	parent[i] = p;
	trav(x, adj[i])
	{
		if (x.f != p)
		{
			depth[x.f] = 1 + depth[i];
			dist[x.f] = x.s + dist[i];
			dfs0(x.f, i);
		}
	}
}
void merge(map<ll, int>& a, map<ll, int>& b, int dist, int depth)
{
	if (sz(a) < sz(b))swap(a, b);
	// merge b into a
	trav(x, b)
	{
		if (a.count(k - x.f + 2 * dist))ans = min(ans, x.s + a[k - x.f + 2 * dist] - 2 * depth);
	}
	trav(x, b)
	{
		if (a.count(x.f))a[x.f] = min(a[x.f], x.s);
		else a.insert(x);
	}
}
map<ll, int> dfs(int i, int p)
{
	map<ll, int>a, t;
	trav(x, adj[i])
	{
		if (x.f == p)continue;
		t = dfs(x.f, i);
		merge(a, t, dist[i], depth[i]);
		if (ans == 321)
			message
	}
	if (a.count(dist[i] + k))ans = min(ans, a[dist[i] + k] - depth[i]);
	if (ans == 321)
		message
	a[dist[i]] = depth[i];
	return a;
}
int best_path(int N, int K, int H[][2], int L[])
{
	n = N;
	k = K;
	adj.rsz(n);
	F0R(i, n - 1)
	{
		int x = H[i][0], y = H[i][1];
		adj[x].pb({ y,L[i] });
		adj[y].pb({ x,L[i] });
	}
	parent.rsz(n);
	dist.rsz(n);
	depth.rsz(n);
	dfs0(0, -1);
	dfs(0, -1);
	if (ans == inf)return -1;
	return ans;
}
#ifdef arwaeystoamneg
int main()
{
	setIO("");

	int n, k;
	cin >> n >> k;
	const int MAX = 2e5;
	int H[MAX][2], L[MAX];
	F0R(i, n - 1)cin >> H[i][0] >> H[i][1] >> L[i];
	cout << best_path(n, k, H, L) << endl;
}
#endif

Compilation message

race.cpp: In function 'void setIO(std::string)':
race.cpp:53:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   53 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
race.cpp:55:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   55 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 117 ms 8812 KB Output is correct
20 Correct 125 ms 10136 KB Output is correct
21 Correct 117 ms 10220 KB Output is correct
22 Correct 118 ms 10220 KB Output is correct
23 Correct 144 ms 10732 KB Output is correct
24 Correct 113 ms 10476 KB Output is correct
25 Correct 91 ms 21868 KB Output is correct
26 Correct 63 ms 31488 KB Output is correct
27 Correct 224 ms 20656 KB Output is correct
28 Correct 267 ms 75372 KB Output is correct
29 Correct 270 ms 73324 KB Output is correct
30 Correct 222 ms 20712 KB Output is correct
31 Correct 220 ms 20588 KB Output is correct
32 Correct 278 ms 20860 KB Output is correct
33 Correct 225 ms 19948 KB Output is correct
34 Correct 382 ms 33644 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 117 ms 8812 KB Output is correct
40 Correct 125 ms 10136 KB Output is correct
41 Correct 117 ms 10220 KB Output is correct
42 Correct 118 ms 10220 KB Output is correct
43 Correct 144 ms 10732 KB Output is correct
44 Correct 113 ms 10476 KB Output is correct
45 Correct 91 ms 21868 KB Output is correct
46 Correct 63 ms 31488 KB Output is correct
47 Correct 224 ms 20656 KB Output is correct
48 Correct 267 ms 75372 KB Output is correct
49 Correct 270 ms 73324 KB Output is correct
50 Correct 222 ms 20712 KB Output is correct
51 Correct 220 ms 20588 KB Output is correct
52 Correct 278 ms 20860 KB Output is correct
53 Correct 225 ms 19948 KB Output is correct
54 Correct 382 ms 33644 KB Output is correct
55 Correct 15 ms 1772 KB Output is correct
56 Correct 8 ms 1260 KB Output is correct
57 Correct 62 ms 10348 KB Output is correct
58 Correct 55 ms 10080 KB Output is correct
59 Correct 96 ms 37716 KB Output is correct
60 Correct 249 ms 73580 KB Output is correct
61 Correct 263 ms 22508 KB Output is correct
62 Correct 225 ms 20588 KB Output is correct
63 Correct 261 ms 20716 KB Output is correct
64 Correct 496 ms 29292 KB Output is correct
65 Correct 503 ms 34156 KB Output is correct
66 Correct 294 ms 68076 KB Output is correct
67 Correct 166 ms 21084 KB Output is correct
68 Correct 393 ms 31704 KB Output is correct
69 Correct 432 ms 36460 KB Output is correct
70 Correct 410 ms 30376 KB Output is correct