oj.uz

Submission #85926

# Submission time Handle Problem Language Result Execution time Memory
85926 2018-11-22T21:01:25 Z qkxwsm Wild Boar (JOI18_wild_boar) C++14
62 / 100
 18000 ms 514100 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 8013
#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 ndist[MAXN / 4][MAXN / 4], dist[MAXN][MAXN];
int go[MAXN / 4][MAXN / 4];
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];
		ppp opt = MP(MP(LLINF, LLINF), MP(LLINF, LLINF));
		for (int s = head[u]; s; s = nxt[s])
		{
			pll cur = MP(dp[s ^ 1], s);
			if (cur < opt.fi)
			{
				opt.se = opt.fi;
				opt.fi = cur;
			}
			else if (cur < opt.se)
			{
				opt.se = cur;
			}
			dp[s ^ 1] = LLINF;
		}
		for (int t = head[v]; t; t = nxt[t])
		{
			if (opt.fi.se != LLINF)
			ckmin(dp[t ^ 1], opt.fi.fi + dist[opt.fi.se ^ 1][t ^ 1]);
			if (opt.se.se != LLINF)
			ckmin(dp[t ^ 1], opt.se.fi + dist[opt.se.se ^ 1][t ^ 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;
		// }
		//find the one with minimum dist[s ^ 1][t ^ 1], then the rest all have the same one!
	}
	ans = LLINF;
	for (int s = head[arr[K - 1]]; s; s = nxt[s])
	{
		ckmin(ans, dp[s ^ 1]);
	}
	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(u, 0, 2 * N)
	{
		for (int s = head[u]; s; s = nxt[s])
		{
			priority_queue<pll, vector<pll>, greater<pll> > 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 2 ms 504 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 740 KB Output is correct
5 Correct 2 ms 740 KB Output is correct
6 Correct 2 ms 740 KB Output is correct
7 Correct 2 ms 740 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 788 KB Output is correct
12 Correct 2 ms 792 KB Output is correct
13 Correct 2 ms 796 KB Output is correct
14 Correct 2 ms 804 KB Output is correct
15 Correct 2 ms 932 KB Output is correct
16 Correct 2 ms 932 KB Output is correct
17 Correct 2 ms 932 KB Output is correct
18 Correct 2 ms 932 KB Output is correct
19 Correct 2 ms 932 KB Output is correct
20 Correct 2 ms 932 KB Output is correct
21 Correct 2 ms 932 KB Output is correct
22 Correct 2 ms 932 KB Output is correct
23 Correct 2 ms 932 KB Output is correct
24 Correct 2 ms 932 KB Output is correct
25 Correct 2 ms 932 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 740 KB Output is correct
5 Correct 2 ms 740 KB Output is correct
6 Correct 2 ms 740 KB Output is correct
7 Correct 2 ms 740 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 788 KB Output is correct
12 Correct 2 ms 792 KB Output is correct
13 Correct 2 ms 796 KB Output is correct
14 Correct 2 ms 804 KB Output is correct
15 Correct 2 ms 932 KB Output is correct
16 Correct 2 ms 932 KB Output is correct
17 Correct 2 ms 932 KB Output is correct
18 Correct 2 ms 932 KB Output is correct
19 Correct 2 ms 932 KB Output is correct
20 Correct 2 ms 932 KB Output is correct
21 Correct 2 ms 932 KB Output is correct
22 Correct 2 ms 932 KB Output is correct
23 Correct 2 ms 932 KB Output is correct
24 Correct 2 ms 932 KB Output is correct
25 Correct 2 ms 932 KB Output is correct
26 Correct 3 ms 1376 KB Output is correct
27 Correct 29 ms 4324 KB Output is correct
28 Correct 21 ms 4612 KB Output is correct
29 Correct 102 ms 10276 KB Output is correct
30 Correct 117 ms 10604 KB Output is correct
31 Correct 144 ms 10928 KB Output is correct
32 Correct 145 ms 10980 KB Output is correct
33 Correct 104 ms 12972 KB Output is correct
34 Correct 109 ms 13384 KB Output is correct
35 Correct 168 ms 13580 KB Output is correct
36 Correct 132 ms 13696 KB Output is correct
37 Correct 100 ms 13696 KB Output is correct
38 Correct 102 ms 15488 KB Output is correct
39 Correct 116 ms 15488 KB Output is correct
40 Correct 100 ms 15488 KB Output is correct
41 Correct 101 ms 15580 KB Output is correct
42 Correct 114 ms 16640 KB Output is correct
43 Correct 106 ms 17496 KB Output is correct
44 Correct 105 ms 17536 KB Output is correct
45 Correct 57 ms 19960 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 740 KB Output is correct
5 Correct 2 ms 740 KB Output is correct
6 Correct 2 ms 740 KB Output is correct
7 Correct 2 ms 740 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 788 KB Output is correct
12 Correct 2 ms 792 KB Output is correct
13 Correct 2 ms 796 KB Output is correct
14 Correct 2 ms 804 KB Output is correct
15 Correct 2 ms 932 KB Output is correct
16 Correct 2 ms 932 KB Output is correct
17 Correct 2 ms 932 KB Output is correct
18 Correct 2 ms 932 KB Output is correct
19 Correct 2 ms 932 KB Output is correct
20 Correct 2 ms 932 KB Output is correct
21 Correct 2 ms 932 KB Output is correct
22 Correct 2 ms 932 KB Output is correct
23 Correct 2 ms 932 KB Output is correct
24 Correct 2 ms 932 KB Output is correct
25 Correct 2 ms 932 KB Output is correct
26 Correct 3 ms 1376 KB Output is correct
27 Correct 29 ms 4324 KB Output is correct
28 Correct 21 ms 4612 KB Output is correct
29 Correct 102 ms 10276 KB Output is correct
30 Correct 117 ms 10604 KB Output is correct
31 Correct 144 ms 10928 KB Output is correct
32 Correct 145 ms 10980 KB Output is correct
33 Correct 104 ms 12972 KB Output is correct
34 Correct 109 ms 13384 KB Output is correct
35 Correct 168 ms 13580 KB Output is correct
36 Correct 132 ms 13696 KB Output is correct
37 Correct 100 ms 13696 KB Output is correct
38 Correct 102 ms 15488 KB Output is correct
39 Correct 116 ms 15488 KB Output is correct
40 Correct 100 ms 15488 KB Output is correct
41 Correct 101 ms 15580 KB Output is correct
42 Correct 114 ms 16640 KB Output is correct
43 Correct 106 ms 17496 KB Output is correct
44 Correct 105 ms 17536 KB Output is correct
45 Correct 57 ms 19960 KB Output is correct
46 Correct 249 ms 24296 KB Output is correct
47 Correct 9577 ms 219836 KB Output is correct
48 Correct 8983 ms 272364 KB Output is correct
49 Correct 7241 ms 310240 KB Output is correct
50 Correct 7836 ms 310564 KB Output is correct
51 Correct 8863 ms 310856 KB Output is correct
52 Correct 4387 ms 310856 KB Output is correct
53 Correct 4467 ms 310864 KB Output is correct
54 Correct 4422 ms 311336 KB Output is correct
55 Correct 4352 ms 311736 KB Output is correct
56 Correct 4382 ms 332112 KB Output is correct
57 Correct 4608 ms 353048 KB Output is correct
58 Correct 4631 ms 374576 KB Output is correct
59 Correct 4649 ms 396940 KB Output is correct
60 Correct 4530 ms 419696 KB Output is correct
61 Correct 4632 ms 443032 KB Output is correct
62 Correct 4429 ms 467136 KB Output is correct
63 Correct 4389 ms 485916 KB Output is correct
64 Correct 1366 ms 511340 KB Output is correct
65 Correct 1350 ms 511784 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 740 KB Output is correct
5 Correct 2 ms 740 KB Output is correct
6 Correct 2 ms 740 KB Output is correct
7 Correct 2 ms 740 KB Output is correct
8 Correct 2 ms 752 KB Output is correct
9 Correct 2 ms 752 KB Output is correct
10 Correct 2 ms 756 KB Output is correct
11 Correct 2 ms 788 KB Output is correct
12 Correct 2 ms 792 KB Output is correct
13 Correct 2 ms 796 KB Output is correct
14 Correct 2 ms 804 KB Output is correct
15 Correct 2 ms 932 KB Output is correct
16 Correct 2 ms 932 KB Output is correct
17 Correct 2 ms 932 KB Output is correct
18 Correct 2 ms 932 KB Output is correct
19 Correct 2 ms 932 KB Output is correct
20 Correct 2 ms 932 KB Output is correct
21 Correct 2 ms 932 KB Output is correct
22 Correct 2 ms 932 KB Output is correct
23 Correct 2 ms 932 KB Output is correct
24 Correct 2 ms 932 KB Output is correct
25 Correct 2 ms 932 KB Output is correct
26 Correct 3 ms 1376 KB Output is correct
27 Correct 29 ms 4324 KB Output is correct
28 Correct 21 ms 4612 KB Output is correct
29 Correct 102 ms 10276 KB Output is correct
30 Correct 117 ms 10604 KB Output is correct
31 Correct 144 ms 10928 KB Output is correct
32 Correct 145 ms 10980 KB Output is correct
33 Correct 104 ms 12972 KB Output is correct
34 Correct 109 ms 13384 KB Output is correct
35 Correct 168 ms 13580 KB Output is correct
36 Correct 132 ms 13696 KB Output is correct
37 Correct 100 ms 13696 KB Output is correct
38 Correct 102 ms 15488 KB Output is correct
39 Correct 116 ms 15488 KB Output is correct
40 Correct 100 ms 15488 KB Output is correct
41 Correct 101 ms 15580 KB Output is correct
42 Correct 114 ms 16640 KB Output is correct
43 Correct 106 ms 17496 KB Output is correct
44 Correct 105 ms 17536 KB Output is correct
45 Correct 57 ms 19960 KB Output is correct
46 Correct 249 ms 24296 KB Output is correct
47 Correct 9577 ms 219836 KB Output is correct
48 Correct 8983 ms 272364 KB Output is correct
49 Correct 7241 ms 310240 KB Output is correct
50 Correct 7836 ms 310564 KB Output is correct
51 Correct 8863 ms 310856 KB Output is correct
52 Correct 4387 ms 310856 KB Output is correct
53 Correct 4467 ms 310864 KB Output is correct
54 Correct 4422 ms 311336 KB Output is correct
55 Correct 4352 ms 311736 KB Output is correct
56 Correct 4382 ms 332112 KB Output is correct
57 Correct 4608 ms 353048 KB Output is correct
58 Correct 4631 ms 374576 KB Output is correct
59 Correct 4649 ms 396940 KB Output is correct
60 Correct 4530 ms 419696 KB Output is correct
61 Correct 4632 ms 443032 KB Output is correct
62 Correct 4429 ms 467136 KB Output is correct
63 Correct 4389 ms 485916 KB Output is correct
64 Correct 1366 ms 511340 KB Output is correct
65 Correct 1350 ms 511784 KB Output is correct
66 Correct 607 ms 511784 KB Output is correct
67 Correct 924 ms 511784 KB Output is correct
68 Correct 1804 ms 512496 KB Output is correct
69 Correct 2615 ms 513580 KB Output is correct
70 Execution timed out 18109 ms 514100 KB Time limit exceeded
71 Halted 0 ms 0 KB -