oj.uz

Submission #85861

# Submission time Handle Problem Language Result Execution time Memory
85861 2018-11-22T05:55:41 Z qkxwsm Wild Boar (JOI18_wild_boar) C++14
47 / 100
 1744 ms 27504 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM; x += 11400714819323198485ull;
		x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << x << endl;
#define SZ(x) ((int) (x.size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) x.begin(), x.end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 4013
#define MAXK 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;
typedef pair<pll, pll> ppp;

int N, M, Q, K, E = 2;
int arr[MAXK];
int to[MAXN], nxt[MAXN], head[MAXN];
ll len[MAXN];
ll dist[MAXN][MAXN];
ll dp[MAXN];
ll ans;

void addedge(int u, int v, ll d)
{
	if (u == v) return;
	to[E] = v;
	nxt[E] = head[u];
	head[u] = E;
	len[E] = d;
	E++;
	to[E] = u;
	nxt[E] = head[v];
	head[v] = E;
	len[E] = d;
	E++;
}
void solve()
{
	FOR(i, 0, E)
	{
		dp[i] = LLINF;
	}
	dp[head[arr[0] + N]] = 0;
	FOR(i, 0, K - 1)
	{
		int u = arr[i], v = arr[i + 1];
		for (int s = head[u]; s; s = nxt[s])
		{
			for (int t = head[v]; t; t = nxt[t])
			{
				ckmin(dp[t ^ 1], dp[s ^ 1] + dist[s ^ 1][t ^ 1]);
			}
			dp[s ^ 1] = LLINF;
		}
	}
	ans = LLINF;
	FOR(i, 2, E)
	{
		ckmin(ans, dp[i]);
	}
	ans = (ans == LLINF ? -1 : ans);
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// freopen ("file.in", "r", stdin);
	// freopen ("file.out", "w", stdout);
	cin >> N >> M >> Q >> K;
	FOR(i, 0, M)
	{
		int u, v; ll d;
		cin >> u >> v >> d;
		u--; v--;
		addedge(u, v, d);
	}
	FOR(i, 0, N)
	{
		addedge(i, i + N, 0);
	}
	FOR(i, 0, N)
	{
		// for (int s = head[i]; s; s = nxt[s])
		// {
		// 	cerr << i << " -> " << to[s] << " id " << s << endl;
		// }
	}
	FOR(u, 0, 2 * N)
	{
		for (int s = head[u]; s; s = nxt[s])
		{
			priority_queue<pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > pq;
			FOR(i, 0, E)
			{
				dist[s][i] = LLINF;
			}
			dist[s][s] = 0;
			pq.push(MP(0, s));
			while(!pq.empty())
			{
				ll d = pq.top().fi; int ed = pq.top().se;
				pq.pop();
				for (int ed1 = head[to[ed]]; ed1; ed1 = nxt[ed1])
				{
					if ((ed1 xor ed) == 1) continue;
					// cerr << ed << " to " << ed1 << endl;
					// cerr << d + len[ed1] << " cmp " << dist[s][ed1] << endl;
					if (dist[s][ed1] > d + len[ed1])
					{
						dist[s][ed1] = d + len[ed1];
						pq.push(MP(dist[s][ed1], ed1));
					}
				}
			}
		}
	}
	// FOR(i, 2, E)
	// {
	// 	FOR(j, 2, E)
	// 	{
	// 		cerr << (dist[i][j] == LLINF ? -1 : dist[i][j]) << ' ';
	// 	}
	// 	cerr << endl;
	// }
	//a vertex numbered (i, j) means you're at j, but you just came from i
	FOR(i, 0, K)
	{
		cin >> arr[i];
		arr[i]--;
	}
	FOR(i, 0, Q)
	{
		int qid, qv;
		cin >> qid >> qv;
		qid--; qv--;
		arr[qid] = qv;
		solve();
		cout << ans << '\n';
	}
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 3 ms 752 KB Output is correct
3 Correct 2 ms 864 KB Output is correct
4 Correct 2 ms 864 KB Output is correct
5 Correct 2 ms 872 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 2 ms 940 KB Output is correct
8 Correct 2 ms 960 KB Output is correct
9 Correct 2 ms 964 KB Output is correct
10 Correct 2 ms 968 KB Output is correct
11 Correct 3 ms 1012 KB Output is correct
12 Correct 2 ms 1068 KB Output is correct
13 Correct 2 ms 1068 KB Output is correct
14 Correct 3 ms 1068 KB Output is correct
15 Correct 3 ms 1204 KB Output is correct
16 Correct 2 ms 1204 KB Output is correct
17 Correct 3 ms 1204 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 3 ms 1204 KB Output is correct
20 Correct 3 ms 1204 KB Output is correct
21 Correct 3 ms 1204 KB Output is correct
22 Correct 2 ms 1204 KB Output is correct
23 Correct 3 ms 1204 KB Output is correct
24 Correct 2 ms 1204 KB Output is correct
25 Correct 3 ms 1204 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 3 ms 752 KB Output is correct
3 Correct 2 ms 864 KB Output is correct
4 Correct 2 ms 864 KB Output is correct
5 Correct 2 ms 872 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 2 ms 940 KB Output is correct
8 Correct 2 ms 960 KB Output is correct
9 Correct 2 ms 964 KB Output is correct
10 Correct 2 ms 968 KB Output is correct
11 Correct 3 ms 1012 KB Output is correct
12 Correct 2 ms 1068 KB Output is correct
13 Correct 2 ms 1068 KB Output is correct
14 Correct 3 ms 1068 KB Output is correct
15 Correct 3 ms 1204 KB Output is correct
16 Correct 2 ms 1204 KB Output is correct
17 Correct 3 ms 1204 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 3 ms 1204 KB Output is correct
20 Correct 3 ms 1204 KB Output is correct
21 Correct 3 ms 1204 KB Output is correct
22 Correct 2 ms 1204 KB Output is correct
23 Correct 3 ms 1204 KB Output is correct
24 Correct 2 ms 1204 KB Output is correct
25 Correct 3 ms 1204 KB Output is correct
26 Correct 4 ms 1588 KB Output is correct
27 Correct 21 ms 4536 KB Output is correct
28 Correct 29 ms 4840 KB Output is correct
29 Correct 110 ms 10576 KB Output is correct
30 Correct 280 ms 10912 KB Output is correct
31 Correct 1477 ms 11024 KB Output is correct
32 Correct 1456 ms 11320 KB Output is correct
33 Correct 103 ms 13232 KB Output is correct
34 Correct 102 ms 13560 KB Output is correct
35 Correct 1744 ms 13888 KB Output is correct
36 Correct 855 ms 14104 KB Output is correct
37 Correct 117 ms 14304 KB Output is correct
38 Correct 107 ms 16680 KB Output is correct
39 Correct 461 ms 16852 KB Output is correct
40 Correct 108 ms 17100 KB Output is correct
41 Correct 109 ms 17464 KB Output is correct
42 Correct 515 ms 18940 KB Output is correct
43 Correct 110 ms 20040 KB Output is correct
44 Correct 100 ms 20424 KB Output is correct
45 Correct 52 ms 22928 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 3 ms 752 KB Output is correct
3 Correct 2 ms 864 KB Output is correct
4 Correct 2 ms 864 KB Output is correct
5 Correct 2 ms 872 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 2 ms 940 KB Output is correct
8 Correct 2 ms 960 KB Output is correct
9 Correct 2 ms 964 KB Output is correct
10 Correct 2 ms 968 KB Output is correct
11 Correct 3 ms 1012 KB Output is correct
12 Correct 2 ms 1068 KB Output is correct
13 Correct 2 ms 1068 KB Output is correct
14 Correct 3 ms 1068 KB Output is correct
15 Correct 3 ms 1204 KB Output is correct
16 Correct 2 ms 1204 KB Output is correct
17 Correct 3 ms 1204 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 3 ms 1204 KB Output is correct
20 Correct 3 ms 1204 KB Output is correct
21 Correct 3 ms 1204 KB Output is correct
22 Correct 2 ms 1204 KB Output is correct
23 Correct 3 ms 1204 KB Output is correct
24 Correct 2 ms 1204 KB Output is correct
25 Correct 3 ms 1204 KB Output is correct
26 Correct 4 ms 1588 KB Output is correct
27 Correct 21 ms 4536 KB Output is correct
28 Correct 29 ms 4840 KB Output is correct
29 Correct 110 ms 10576 KB Output is correct
30 Correct 280 ms 10912 KB Output is correct
31 Correct 1477 ms 11024 KB Output is correct
32 Correct 1456 ms 11320 KB Output is correct
33 Correct 103 ms 13232 KB Output is correct
34 Correct 102 ms 13560 KB Output is correct
35 Correct 1744 ms 13888 KB Output is correct
36 Correct 855 ms 14104 KB Output is correct
37 Correct 117 ms 14304 KB Output is correct
38 Correct 107 ms 16680 KB Output is correct
39 Correct 461 ms 16852 KB Output is correct
40 Correct 108 ms 17100 KB Output is correct
41 Correct 109 ms 17464 KB Output is correct
42 Correct 515 ms 18940 KB Output is correct
43 Correct 110 ms 20040 KB Output is correct
44 Correct 100 ms 20424 KB Output is correct
45 Correct 52 ms 22928 KB Output is correct
46 Correct 254 ms 27504 KB Output is correct
47 Runtime error 7 ms 27504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 3 ms 752 KB Output is correct
3 Correct 2 ms 864 KB Output is correct
4 Correct 2 ms 864 KB Output is correct
5 Correct 2 ms 872 KB Output is correct
6 Correct 2 ms 876 KB Output is correct
7 Correct 2 ms 940 KB Output is correct
8 Correct 2 ms 960 KB Output is correct
9 Correct 2 ms 964 KB Output is correct
10 Correct 2 ms 968 KB Output is correct
11 Correct 3 ms 1012 KB Output is correct
12 Correct 2 ms 1068 KB Output is correct
13 Correct 2 ms 1068 KB Output is correct
14 Correct 3 ms 1068 KB Output is correct
15 Correct 3 ms 1204 KB Output is correct
16 Correct 2 ms 1204 KB Output is correct
17 Correct 3 ms 1204 KB Output is correct
18 Correct 3 ms 1204 KB Output is correct
19 Correct 3 ms 1204 KB Output is correct
20 Correct 3 ms 1204 KB Output is correct
21 Correct 3 ms 1204 KB Output is correct
22 Correct 2 ms 1204 KB Output is correct
23 Correct 3 ms 1204 KB Output is correct
24 Correct 2 ms 1204 KB Output is correct
25 Correct 3 ms 1204 KB Output is correct
26 Correct 4 ms 1588 KB Output is correct
27 Correct 21 ms 4536 KB Output is correct
28 Correct 29 ms 4840 KB Output is correct
29 Correct 110 ms 10576 KB Output is correct
30 Correct 280 ms 10912 KB Output is correct
31 Correct 1477 ms 11024 KB Output is correct
32 Correct 1456 ms 11320 KB Output is correct
33 Correct 103 ms 13232 KB Output is correct
34 Correct 102 ms 13560 KB Output is correct
35 Correct 1744 ms 13888 KB Output is correct
36 Correct 855 ms 14104 KB Output is correct
37 Correct 117 ms 14304 KB Output is correct
38 Correct 107 ms 16680 KB Output is correct
39 Correct 461 ms 16852 KB Output is correct
40 Correct 108 ms 17100 KB Output is correct
41 Correct 109 ms 17464 KB Output is correct
42 Correct 515 ms 18940 KB Output is correct
43 Correct 110 ms 20040 KB Output is correct
44 Correct 100 ms 20424 KB Output is correct
45 Correct 52 ms 22928 KB Output is correct
46 Correct 254 ms 27504 KB Output is correct
47 Runtime error 7 ms 27504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Halted 0 ms 0 KB -