oj.uz

답안 #801725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
801725 2023-08-02T07:23:00 Z SanguineChameleon Travelling Merchant (CCO21_day2problem1) C++17
9 / 25
 2000 ms 32388 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

struct edge {
	int v, a, b;

	edge(int _v, int _a, int _b): v(_v), a(_a), b(_b) {};
};

const int maxn = 2e5 + 20;
const int inf = 1e9 + 20;
vector<edge> adj[maxn];
int lt[maxn];
int rt[maxn];
bool flag[maxn];

bool dfs(int u, int x) {
	if (x < lt[u]) {
		return false;
	}
	if (x > rt[u]) {
		return true;
	}
	flag[u] = true;
	for (auto e: adj[u]) {
		if (x >= e.a) {
			if (flag[e.v] || dfs(e.v, min(inf - 1, x + e.b))) {
				flag[u] = false;
				rt[u] = min(x, inf - 1);
				return true;
			}
		}
	}
	flag[u] = false;
	lt[u] = x + 1;
	return false;
}

void just_do_it() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v, a, b;
		cin >> u >> v >> a >> b;
		adj[u].emplace_back(v, a, b);
	}
	for (int i = 1; i <= n; i++) {
		lt[i] = 0;
		rt[i] = inf;
	}
	for (int i = 1; i <= n; i++) {
		while (lt[i] < rt[i]) {
			dfs(i, (lt[i] + rt[i]) / 2);
		}
		if (lt[i] == inf) {
			cout << -1 << " ";
		}
		else {
			cout << lt[i] << " ";
		}
	}
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5044 KB Output is correct
2 Correct 5 ms 5076 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 5 ms 5116 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 5 ms 5300 KB Output is correct
9 Correct 5 ms 5168 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 3 ms 5056 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 4 ms 5296 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 188 ms 16632 KB Output is correct
2 Correct 198 ms 16736 KB Output is correct
3 Correct 57 ms 12728 KB Output is correct
4 Correct 54 ms 7744 KB Output is correct
5 Correct 162 ms 15692 KB Output is correct
6 Correct 156 ms 15756 KB Output is correct
7 Correct 56 ms 12180 KB Output is correct
8 Correct 1014 ms 32364 KB Output is correct
9 Correct 306 ms 17728 KB Output is correct
10 Correct 46 ms 10692 KB Output is correct
11 Correct 183 ms 14184 KB Output is correct
12 Correct 42 ms 10208 KB Output is correct
13 Correct 37 ms 9112 KB Output is correct
14 Correct 914 ms 32324 KB Output is correct
15 Correct 979 ms 32316 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5044 KB Output is correct
2 Correct 5 ms 5076 KB Output is correct
3 Correct 4 ms 5068 KB Output is correct
4 Correct 4 ms 5076 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 5 ms 5116 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 5 ms 5300 KB Output is correct
9 Correct 5 ms 5168 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 4 ms 5076 KB Output is correct
12 Correct 3 ms 5056 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 4 ms 5296 KB Output is correct
15 Correct 188 ms 16632 KB Output is correct
16 Correct 198 ms 16736 KB Output is correct
17 Correct 57 ms 12728 KB Output is correct
18 Correct 54 ms 7744 KB Output is correct
19 Correct 162 ms 15692 KB Output is correct
20 Correct 156 ms 15756 KB Output is correct
21 Correct 56 ms 12180 KB Output is correct
22 Correct 1014 ms 32364 KB Output is correct
23 Correct 306 ms 17728 KB Output is correct
24 Correct 46 ms 10692 KB Output is correct
25 Correct 183 ms 14184 KB Output is correct
26 Correct 42 ms 10208 KB Output is correct
27 Correct 37 ms 9112 KB Output is correct
28 Correct 914 ms 32324 KB Output is correct
29 Correct 979 ms 32316 KB Output is correct
30 Correct 134 ms 16684 KB Output is correct
31 Correct 157 ms 16720 KB Output is correct
32 Correct 44 ms 11580 KB Output is correct
33 Correct 66 ms 7756 KB Output is correct
34 Correct 137 ms 15728 KB Output is correct
35 Correct 126 ms 15688 KB Output is correct
36 Correct 67 ms 12168 KB Output is correct
37 Correct 957 ms 32388 KB Output is correct
38 Correct 817 ms 18904 KB Output is correct
39 Correct 45 ms 10708 KB Output is correct
40 Correct 139 ms 14180 KB Output is correct
41 Correct 38 ms 10424 KB Output is correct
42 Correct 34 ms 9304 KB Output is correct
43 Correct 999 ms 32324 KB Output is correct
44 Correct 844 ms 32324 KB Output is correct
45 Correct 1010 ms 32320 KB Output is correct
46 Correct 882 ms 22064 KB Output is correct
47 Correct 361 ms 20468 KB Output is correct
48 Execution timed out 2069 ms 14736 KB Time limit exceeded
49 Halted 0 ms 0 KB -