oj.uz

Submission #884410

# Submission time Handle Problem Language Result Execution time Memory
884410 2023-12-07T09:56:44 Z marvinthang Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 16 ms 3412 KB 
/*************************************
*    author: marvinthang             *
*    created: 07.12.2023 16:37:49    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int INF = (int) 4e8 + 7;

struct Edge {
	int u, v, c, d;
	Edge(int u = 0, int v = 0, int c = 0, int d = 0): u(u), v(v), c(c), d(d) {}
};

void process(void) {
	int n, m; cin >> n >> m;
	vector <vector <int>> adj(n), radj(n);
	vector <Edge> edges;
	REP(i, m) {
		int u, v, c, d; cin >> u >> v >> c >> d;
		--u; --v;
		edges.emplace_back(u, v, c, d);
		adj[u].push_back(i);
		radj[v].push_back(i);
	}
	vector <int> dist1, distn;
	auto solve = [&] (int s, int t, vector <int> &res) {
		vector <int> dists, distt, trace(n);
		vector <bool> used(n);
		auto Dijkstra = [&] (int s, vector <int> &dist, const vector <vector <int>> &adj) {
			dist.assign(n, INF);
			fill(ALL(used), false);
			dist[s] = trace[s] = 0;
			REP(love, n - 1) {
				int u = -1;
				REP(i, n) if (!used[i] && (u == -1 || dist[i] < dist[u])) u = i;
				used[u] = true;
				for (int i: adj[u]) {
					int v = edges[i].u ^ edges[i].v ^ u;
					if (minimize(dist[v], dist[u] + edges[i].c)) trace[v] = i;
				}
			}
		};
		res.assign(m + 1, INF);
		Dijkstra(t, distt, radj);
		if (distt[s] == INF) return;
		Dijkstra(s, dists, adj);
		int u = t;
		vector <bool> in_path(m);
		while (u != s) {
			in_path[trace[u]] = true;
			u = edges[trace[u]].u;
		}
		res[m] = dists[t];
		vector <int> distm;
		REP(i, m) {
			auto [u, v, c, d] = edges[i];
			if (!in_path[i]) {
				res[i] = min(res[m], dists[v] + distt[u] + c);
			} else {
				adj[u].erase(find(ALL(adj[u]), i));
				Dijkstra(s, distm, adj);
				res[i] = distm[t];
				adj[u].push_back(i);
			}
		}
	};
	solve(0, n - 1, dist1);
	solve(n - 1, 0, distn);
	int res = dist1[m] + distn[m];
	REP(i, m) minimize(res, dist1[i] + distn[i] + edges[i].d);
	cout << (res >= INF ? -1 : res) << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI20_ho_t4");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

ho_t4.cpp: In function 'int main()':
ho_t4.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t4.cpp:116:2: note: in expansion of macro 'file'
  116 |  file("JOI20_ho_t4");
      |  ^~~~
ho_t4.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
ho_t4.cpp:116:2: note: in expansion of macro 'file'
  116 |  file("JOI20_ho_t4");
      |  ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3280 KB Output is correct
2 Correct 16 ms 3280 KB Output is correct
3 Correct 16 ms 3412 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 12 ms 2516 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 14 ms 3028 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Incorrect 13 ms 3144 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -