oj.uz

Submission #798407

# Submission time Handle Problem Language Result Execution time Memory
798407 2023-07-30T16:46:11 Z hugo_pm Wild Boar (JOI18_wild_boar) C++17
62 / 100
 18000 ms 602816 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define sz(v) ((int)((v).size()))

template<typename T>
void chmax(T &x, const T &v) { if (x < v) x = v; }
template<typename T>
void chmin(T &x, const T &v) { if (x > v) x = v; }

using pii = pair<int, int>;
using vi = vector<int>;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
	bool first = true;
	string res = "[";
	for (const auto &x : v) {
		if (!first)
			res += ", ";
		first = false;
		res += to_string(x);
	}
	res += "]";
	return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
	cout << ' ' << to_string(H);
	dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

const int MAX_N = 2005, MAX_ARRET = 1e5+5;
int nbNode, nbEdge, nbReq, nbArret;
vector<int> adj[MAX_N];
int xorNode[MAX_N];
int poids[MAX_N];
int arrets[MAX_ARRET];
int vus[MAX_N][MAX_N];
int VuTime = 0;

struct Chemin {
	int len, fst, lst;
	bool operator<(const Chemin &oth) const {
		return tie(len, fst, lst) < tie(oth.len, oth.fst, oth.lst);
	}
	bool operator==(const Chemin &oth) const {
		return tie(len, fst, lst) == tie(oth.len, oth.fst, oth.lst);
	}
};

template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

string to_string(const Chemin c) {
	return "(len=" + to_string(c.len) + ", fst=" + to_string(c.fst) + ", lst=" + to_string(c.lst) + ")";
}

int repondre() {
	vector<vector<vector<Chemin>>> matrice(nbNode);
	vector<int> cntFirst(nbEdge+1), cntLast(nbEdge+1);
	auto compressTab = [&](vector<Chemin> &chemins) {
		#ifdef DEBUG
		assert(is_sorted(all(chemins)));
		#endif
		VuTime++;
		vector<Chemin> ret;
		for (Chemin chem : chemins) {
			if (ret.size() > 8)
				break;
			dbg(chem);
			if (cntFirst[1+chem.fst] == 3 or cntLast[1+chem.lst] == 3 or vus[1+chem.fst][1+chem.lst] == VuTime)
				continue;
			ret.push_back(chem);
			cntFirst[1+chem.fst]++;
			cntLast[1+chem.lst]++;
			vus[1+chem.fst][1+chem.lst] = VuTime;
		}
		for (Chemin chem : ret) {
			cntFirst[1+chem.fst]--;
			cntLast[1+chem.lst]--;
		}
		return ret;
	};
	auto interesting = [&] (const Chemin &add, vector<Chemin> &V) {
		V.insert(upper_bound(all(V), add), add);
		V = compressTab(V);
		return (find(all(V), add) != end(V));
	};
	rep(depart, 0, nbNode) {
		auto& cand = matrice[depart];
		cand.resize(nbNode);
		cand[depart].push_back({0, -1, -1});
		minpq<pair<Chemin, int>> pq;
		pq.push({cand[depart].back(), depart});
		vector<int> nbVus(nbNode);
		while (!pq.empty()) {
			auto [oldChemin, node] = pq.top();
			pq.pop();
			nbVus[node]++;
			// oldChemin.len == dist[node]
			dbg(depart, node);
			if (find(all(cand[node]), oldChemin) == end(cand[node])) {
				continue;
			}
			for (int iEdge : adj[node]) {
				if (iEdge == oldChemin.lst) continue;
				int voisin = xorNode[iEdge]^node;
				Chemin nouvChemin {
					oldChemin.len + poids[iEdge],
					(oldChemin.fst == -1 ? iEdge : oldChemin.fst),
					iEdge
				};
				if (interesting(nouvChemin, cand[voisin])) {
					dbg(voisin, cand[voisin], nouvChemin);
					pq.push({nouvChemin, voisin});
				}
			}
		}
		rep(node, 0, nbNode) {
			cand[node] = compressTab(cand[node]);
			assert(sz(cand[node]) <= 9);
		}
	}
	vector<Chemin> candidats;
	candidats.push_back({0, -1, -1});
	rep(iRawArret, 1, nbArret) {
		int prev = arrets[iRawArret-1];
		int cur = arrets[iRawArret];
		dbg(prev+1, cur+1);
		dbg(matrice[prev][cur]);
		vector<Chemin> nv;
		for (Chemin c1 : candidats) for (Chemin c2 : matrice[prev][cur]) {
			if (c1.lst != c2.fst) {
				int newFst = (c1.fst == -1 ? c2.fst : c1.fst);
				nv.push_back({c1.len + c2.len, newFst, c2.lst});
			}
		}
		sort(all(nv));
		candidats = compressTab(nv);
		assert(sz(candidats) <= 9);
		dbg(candidats);
	}
	if (candidats.empty()) return -1;
	return min_element(all(candidats))->len;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> nbNode >> nbEdge >> nbReq >> nbArret;
	rep(iEdge, 0, nbEdge) {
		int u, v; cin >> u >> v;
		--u, --v;
		cin >> poids[iEdge];
		xorNode[iEdge] = u^v;
		adj[u].push_back(iEdge);
		adj[v].push_back(iEdge);
	}
	rep(iArret, 0, nbArret) {
		cin >> arrets[iArret];
		--arrets[iArret];
	}
	rep(iReq, 0, nbReq) {
		int indice, val;
		cin >> indice >> val;
		--indice, --val;
		arrets[indice] = val;
		cout << repondre() << '\n';
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 380 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 380 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 3 ms 636 KB Output is correct
27 Correct 9 ms 2516 KB Output is correct
28 Correct 10 ms 2576 KB Output is correct
29 Correct 358 ms 7500 KB Output is correct
30 Correct 373 ms 7096 KB Output is correct
31 Correct 293 ms 7316 KB Output is correct
32 Correct 308 ms 7268 KB Output is correct
33 Correct 362 ms 11572 KB Output is correct
34 Correct 374 ms 11640 KB Output is correct
35 Correct 305 ms 10776 KB Output is correct
36 Correct 305 ms 10224 KB Output is correct
37 Correct 379 ms 11972 KB Output is correct
38 Correct 316 ms 14712 KB Output is correct
39 Correct 344 ms 12488 KB Output is correct
40 Correct 269 ms 14840 KB Output is correct
41 Correct 257 ms 14920 KB Output is correct
42 Correct 313 ms 13900 KB Output is correct
43 Correct 210 ms 16364 KB Output is correct
44 Correct 218 ms 16180 KB Output is correct
45 Correct 57 ms 11216 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 380 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 3 ms 636 KB Output is correct
27 Correct 9 ms 2516 KB Output is correct
28 Correct 10 ms 2576 KB Output is correct
29 Correct 358 ms 7500 KB Output is correct
30 Correct 373 ms 7096 KB Output is correct
31 Correct 293 ms 7316 KB Output is correct
32 Correct 308 ms 7268 KB Output is correct
33 Correct 362 ms 11572 KB Output is correct
34 Correct 374 ms 11640 KB Output is correct
35 Correct 305 ms 10776 KB Output is correct
36 Correct 305 ms 10224 KB Output is correct
37 Correct 379 ms 11972 KB Output is correct
38 Correct 316 ms 14712 KB Output is correct
39 Correct 344 ms 12488 KB Output is correct
40 Correct 269 ms 14840 KB Output is correct
41 Correct 257 ms 14920 KB Output is correct
42 Correct 313 ms 13900 KB Output is correct
43 Correct 210 ms 16364 KB Output is correct
44 Correct 218 ms 16180 KB Output is correct
45 Correct 57 ms 11216 KB Output is correct
46 Correct 352 ms 19496 KB Output is correct
47 Correct 3602 ms 129112 KB Output is correct
48 Correct 4790 ms 231424 KB Output is correct
49 Correct 5572 ms 333876 KB Output is correct
50 Correct 5662 ms 341296 KB Output is correct
51 Correct 5814 ms 348588 KB Output is correct
52 Correct 7287 ms 402636 KB Output is correct
53 Correct 7203 ms 404156 KB Output is correct
54 Correct 7034 ms 400656 KB Output is correct
55 Correct 6999 ms 397756 KB Output is correct
56 Correct 7292 ms 450012 KB Output is correct
57 Correct 7990 ms 505572 KB Output is correct
58 Correct 7296 ms 532672 KB Output is correct
59 Correct 7335 ms 569556 KB Output is correct
60 Correct 6970 ms 588748 KB Output is correct
61 Correct 6621 ms 600420 KB Output is correct
62 Correct 6534 ms 602816 KB Output is correct
63 Correct 6087 ms 592968 KB Output is correct
64 Correct 1885 ms 377680 KB Output is correct
65 Correct 1838 ms 377732 KB Output is correct

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 380 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 372 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 372 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 3 ms 636 KB Output is correct
27 Correct 9 ms 2516 KB Output is correct
28 Correct 10 ms 2576 KB Output is correct
29 Correct 358 ms 7500 KB Output is correct
30 Correct 373 ms 7096 KB Output is correct
31 Correct 293 ms 7316 KB Output is correct
32 Correct 308 ms 7268 KB Output is correct
33 Correct 362 ms 11572 KB Output is correct
34 Correct 374 ms 11640 KB Output is correct
35 Correct 305 ms 10776 KB Output is correct
36 Correct 305 ms 10224 KB Output is correct
37 Correct 379 ms 11972 KB Output is correct
38 Correct 316 ms 14712 KB Output is correct
39 Correct 344 ms 12488 KB Output is correct
40 Correct 269 ms 14840 KB Output is correct
41 Correct 257 ms 14920 KB Output is correct
42 Correct 313 ms 13900 KB Output is correct
43 Correct 210 ms 16364 KB Output is correct
44 Correct 218 ms 16180 KB Output is correct
45 Correct 57 ms 11216 KB Output is correct
46 Correct 352 ms 19496 KB Output is correct
47 Correct 3602 ms 129112 KB Output is correct
48 Correct 4790 ms 231424 KB Output is correct
49 Correct 5572 ms 333876 KB Output is correct
50 Correct 5662 ms 341296 KB Output is correct
51 Correct 5814 ms 348588 KB Output is correct
52 Correct 7287 ms 402636 KB Output is correct
53 Correct 7203 ms 404156 KB Output is correct
54 Correct 7034 ms 400656 KB Output is correct
55 Correct 6999 ms 397756 KB Output is correct
56 Correct 7292 ms 450012 KB Output is correct
57 Correct 7990 ms 505572 KB Output is correct
58 Correct 7296 ms 532672 KB Output is correct
59 Correct 7335 ms 569556 KB Output is correct
60 Correct 6970 ms 588748 KB Output is correct
61 Correct 6621 ms 600420 KB Output is correct
62 Correct 6534 ms 602816 KB Output is correct
63 Correct 6087 ms 592968 KB Output is correct
64 Correct 1885 ms 377680 KB Output is correct
65 Correct 1838 ms 377732 KB Output is correct
66 Execution timed out 18032 ms 1748 KB Time limit exceeded
67 Halted 0 ms 0 KB -