oj.uz

Submission #801861

# Submission time Handle Problem Language Result Execution time Memory
801861 2023-08-02T08:09:04 Z marvinthang Travelling Merchant (CCO21_day2problem1) C++17
25 / 25
 230 ms 31612 KB 
/*************************************
*    author: marvinthang             *
*    created: 02.08.2023 14:55:13    *
*************************************/

#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 << '}'; }

struct Edge {
	int u, v, r, p;
	Edge(int u = 0, int v = 0, int r = 0, int p = 0): u(u), v(v), r(r), p(p) {}
};

// end of template

const int MAX = 2e5 + 5;

int N, M;
Edge edges[MAX];
vector <int> adj[MAX], r_adj[MAX];

void init(void) {
	cin >> N >> M;
	REP(i, M) {
		int u, v, r, p; cin >> u >> v >> r >> p;
		edges[i] = Edge(u, v, r, p);
		adj[u].push_back(i);
		r_adj[v].push_back(i);
	}
}

int deg[MAX], res[MAX];
bool used[MAX];

void process(void) {
	queue <int> q;
	FORE(i, 1, N) {
		deg[i] = adj[i].size();
		if (!deg[i]) q.push(i);		
	}
	while (!q.empty()) {
		int u = q.front(); q.pop();
		res[u] = -1;
		for (int id: r_adj[u]) {
			int v = edges[id].u;
			used[id] = true;
			if (!--deg[v]) q.push(v);
		}
	}
	priority_queue <pair <int, int>> pq;
	REP(i, M) if (!used[i]) pq.emplace(edges[i].r, i);
	while (!pq.empty()) {
		auto [ru, i] = pq.top(); pq.pop();
		if (used[i]) continue;
		used[i] = true;
		int u = edges[i].u;
		if (!--deg[u]) {
			res[u] = ru;
			for (int i: r_adj[u]) if (!used[i] && edges[i].r < ru - edges[i].p) pq.emplace(ru - edges[i].p, i);
		}
	}
	FORE(i, 1, N) cout << res[i] << ' ';
}

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

Compilation message

Main.cpp: In function 'int main()':
Main.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:101:2: note: in expansion of macro 'file'
  101 |  file("A");
      |  ^~~~
Main.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:101:2: note: in expansion of macro 'file'
  101 |  file("A");
      |  ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12996 KB Output is correct
2 Correct 7 ms 12992 KB Output is correct
3 Correct 7 ms 12884 KB Output is correct
4 Correct 7 ms 13012 KB Output is correct
5 Correct 6 ms 12948 KB Output is correct
6 Correct 6 ms 13012 KB Output is correct
7 Correct 6 ms 12884 KB Output is correct
8 Correct 9 ms 13012 KB Output is correct
9 Correct 7 ms 13012 KB Output is correct
10 Correct 7 ms 12884 KB Output is correct
11 Correct 7 ms 12992 KB Output is correct
12 Correct 7 ms 12884 KB Output is correct
13 Correct 6 ms 12884 KB Output is correct
14 Correct 8 ms 13052 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 23944 KB Output is correct
2 Correct 126 ms 23956 KB Output is correct
3 Correct 77 ms 18560 KB Output is correct
4 Correct 23 ms 16252 KB Output is correct
5 Correct 138 ms 23520 KB Output is correct
6 Correct 134 ms 23424 KB Output is correct
7 Correct 79 ms 18008 KB Output is correct
8 Correct 198 ms 31388 KB Output is correct
9 Correct 199 ms 29088 KB Output is correct
10 Correct 74 ms 18160 KB Output is correct
11 Correct 123 ms 22652 KB Output is correct
12 Correct 64 ms 18308 KB Output is correct
13 Correct 61 ms 17536 KB Output is correct
14 Correct 208 ms 31516 KB Output is correct
15 Correct 222 ms 31516 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12996 KB Output is correct
2 Correct 7 ms 12992 KB Output is correct
3 Correct 7 ms 12884 KB Output is correct
4 Correct 7 ms 13012 KB Output is correct
5 Correct 6 ms 12948 KB Output is correct
6 Correct 6 ms 13012 KB Output is correct
7 Correct 6 ms 12884 KB Output is correct
8 Correct 9 ms 13012 KB Output is correct
9 Correct 7 ms 13012 KB Output is correct
10 Correct 7 ms 12884 KB Output is correct
11 Correct 7 ms 12992 KB Output is correct
12 Correct 7 ms 12884 KB Output is correct
13 Correct 6 ms 12884 KB Output is correct
14 Correct 8 ms 13052 KB Output is correct
15 Correct 137 ms 23944 KB Output is correct
16 Correct 126 ms 23956 KB Output is correct
17 Correct 77 ms 18560 KB Output is correct
18 Correct 23 ms 16252 KB Output is correct
19 Correct 138 ms 23520 KB Output is correct
20 Correct 134 ms 23424 KB Output is correct
21 Correct 79 ms 18008 KB Output is correct
22 Correct 198 ms 31388 KB Output is correct
23 Correct 199 ms 29088 KB Output is correct
24 Correct 74 ms 18160 KB Output is correct
25 Correct 123 ms 22652 KB Output is correct
26 Correct 64 ms 18308 KB Output is correct
27 Correct 61 ms 17536 KB Output is correct
28 Correct 208 ms 31516 KB Output is correct
29 Correct 222 ms 31516 KB Output is correct
30 Correct 128 ms 24176 KB Output is correct
31 Correct 137 ms 24164 KB Output is correct
32 Correct 81 ms 18756 KB Output is correct
33 Correct 22 ms 16212 KB Output is correct
34 Correct 142 ms 23676 KB Output is correct
35 Correct 149 ms 23756 KB Output is correct
36 Correct 79 ms 18212 KB Output is correct
37 Correct 230 ms 31564 KB Output is correct
38 Correct 191 ms 28320 KB Output is correct
39 Correct 72 ms 18328 KB Output is correct
40 Correct 154 ms 22600 KB Output is correct
41 Correct 63 ms 18308 KB Output is correct
42 Correct 61 ms 17628 KB Output is correct
43 Correct 191 ms 31568 KB Output is correct
44 Correct 205 ms 31516 KB Output is correct
45 Correct 191 ms 31612 KB Output is correct
46 Correct 116 ms 25408 KB Output is correct
47 Correct 116 ms 24184 KB Output is correct
48 Correct 134 ms 24140 KB Output is correct
49 Correct 126 ms 26656 KB Output is correct
50 Correct 6 ms 12756 KB Output is correct