oj.uz

답안 #884344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884344 2023-12-07T07:45:35 Z marvinthang 치료 계획 (JOI20_treatment) C++17
100 / 100
 123 ms 41928 KB 
/*************************************
*    author: marvinthang             *
*    created: 07.12.2023 11:09:20    *
*************************************/

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

// end of template

const long long INF = 1e18;

struct Project {
	int t, l, r, c;
};

void process(void) {
	int n, m; cin >> n >> m;
	vector <Project> prj(m);
	for (auto &[t, u, v, c]: prj) cin >> t >> u >> v >> c;
	priority_queue <pair <long long, int>, vector <pair <long long, int>>, greater <pair <long long, int>>> pq;
	vector <long long> dist(m, -1);
	REP(i, m) if (prj[i].l == 1) pq.emplace(dist[i] = prj[i].c, i);
	vector <int> order(m);
	iota(ALL(order), 0);
	sort(ALL(order), [&] (int a, int b) { return prj[a].l - prj[a].t < prj[b].l - prj[b].t; });
	vector <vector <pair <int, int>>> st(m * 4 + 23);
	vector <int> v1(m), ptr(m * 4 + 23);
	function<void(int, int, int)> build = [&] (int i, int l, int r) {
		if (r - l == 1) {
			v1[l] = prj[order[l]].l - prj[order[l]].t;
			st[i].emplace_back(prj[order[l]].l + prj[order[l]].t, order[l]);
			return;
		}
		int m = l + r >> 1;
		build(i << 1, l, m);
		build(i << 1 | 1, m, r);
		merge(ALL(st[i << 1]), ALL(st[i << 1 | 1]), back_inserter(st[i]));
	};
	build(1, 0, m);
	while (!pq.empty()) {
		auto [du, u] = pq.top(); pq.pop();
		if (du != dist[u]) continue;
		if (prj[u].r == n) return void(cout << du << '\n');
		int i = 1, l = 0, r = m;
		int p1 = prj[u].r - prj[u].t + 1;
		int p2 = prj[u].r + prj[u].t + 1;
		while (true) {
			if (r - l == 1) {
				if (v1[l] <= p1 && !ptr[i] && st[i][0].fi <= p2) {
					int v = st[i][ptr[i]].se;
					if (dist[v] == -1) pq.emplace(dist[v] = du + prj[v].c, v);
					++ptr[i];
				}
				break;
			}
			int m = l + r >> 1;
			i <<= 1;
			if (v1[m] <= p1) {
				while (ptr[i] < (int) st[i].size() && st[i][ptr[i]].fi <= p2) {
					int v = st[i][ptr[i]].se;
					if (dist[v] == -1) pq.emplace(dist[v] = du + prj[v].c, v);
					++ptr[i];
				}
				++i; l = m;
			} else r = m;
		}
	}
	cout << "-1\n";
}

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

Compilation message

treatment.cpp: In lambda function:
treatment.cpp:69:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |   int m = l + r >> 1;
      |           ~~^~~
treatment.cpp: In function 'void process()':
treatment.cpp:91:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   91 |    int m = l + r >> 1;
      |            ~~^~~
treatment.cpp: In function 'int main()':
treatment.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
treatment.cpp:108:2: note: in expansion of macro 'file'
  108 |  file("JOI20_treatment");
      |  ^~~~
treatment.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
treatment.cpp:108:2: note: in expansion of macro 'file'
  108 |  file("JOI20_treatment");
      |  ^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 35784 KB Output is correct
2 Correct 77 ms 38728 KB Output is correct
3 Correct 90 ms 38604 KB Output is correct
4 Correct 82 ms 38440 KB Output is correct
5 Correct 79 ms 41032 KB Output is correct
6 Correct 91 ms 38600 KB Output is correct
7 Correct 86 ms 38608 KB Output is correct
8 Correct 72 ms 38768 KB Output is correct
9 Correct 67 ms 38840 KB Output is correct
10 Correct 66 ms 38620 KB Output is correct
11 Correct 74 ms 41172 KB Output is correct
12 Correct 75 ms 41160 KB Output is correct
13 Correct 99 ms 41160 KB Output is correct
14 Correct 92 ms 41164 KB Output is correct
15 Correct 97 ms 38612 KB Output is correct
16 Correct 96 ms 38724 KB Output is correct
17 Correct 96 ms 37908 KB Output is correct
18 Correct 69 ms 40316 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 4 ms 2140 KB Output is correct
21 Correct 4 ms 2140 KB Output is correct
22 Correct 6 ms 2140 KB Output is correct
23 Correct 4 ms 2140 KB Output is correct
24 Correct 4 ms 2140 KB Output is correct
25 Correct 5 ms 2140 KB Output is correct
26 Correct 4 ms 2136 KB Output is correct
27 Correct 4 ms 2080 KB Output is correct
28 Correct 4 ms 2208 KB Output is correct
29 Correct 5 ms 2136 KB Output is correct
30 Correct 4 ms 2136 KB Output is correct
31 Correct 4 ms 2140 KB Output is correct
32 Correct 4 ms 2140 KB Output is correct
33 Correct 4 ms 2072 KB Output is correct
34 Correct 5 ms 2136 KB Output is correct
35 Correct 4 ms 2140 KB Output is correct
36 Correct 4 ms 2324 KB Output is correct
37 Correct 4 ms 2140 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 35784 KB Output is correct
2 Correct 77 ms 38728 KB Output is correct
3 Correct 90 ms 38604 KB Output is correct
4 Correct 82 ms 38440 KB Output is correct
5 Correct 79 ms 41032 KB Output is correct
6 Correct 91 ms 38600 KB Output is correct
7 Correct 86 ms 38608 KB Output is correct
8 Correct 72 ms 38768 KB Output is correct
9 Correct 67 ms 38840 KB Output is correct
10 Correct 66 ms 38620 KB Output is correct
11 Correct 74 ms 41172 KB Output is correct
12 Correct 75 ms 41160 KB Output is correct
13 Correct 99 ms 41160 KB Output is correct
14 Correct 92 ms 41164 KB Output is correct
15 Correct 97 ms 38612 KB Output is correct
16 Correct 96 ms 38724 KB Output is correct
17 Correct 96 ms 37908 KB Output is correct
18 Correct 69 ms 40316 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 4 ms 2140 KB Output is correct
39 Correct 4 ms 2140 KB Output is correct
40 Correct 6 ms 2140 KB Output is correct
41 Correct 4 ms 2140 KB Output is correct
42 Correct 4 ms 2140 KB Output is correct
43 Correct 5 ms 2140 KB Output is correct
44 Correct 4 ms 2136 KB Output is correct
45 Correct 4 ms 2080 KB Output is correct
46 Correct 4 ms 2208 KB Output is correct
47 Correct 5 ms 2136 KB Output is correct
48 Correct 4 ms 2136 KB Output is correct
49 Correct 4 ms 2140 KB Output is correct
50 Correct 4 ms 2140 KB Output is correct
51 Correct 4 ms 2072 KB Output is correct
52 Correct 5 ms 2136 KB Output is correct
53 Correct 4 ms 2140 KB Output is correct
54 Correct 4 ms 2324 KB Output is correct
55 Correct 4 ms 2140 KB Output is correct
56 Correct 88 ms 38860 KB Output is correct
57 Correct 88 ms 39384 KB Output is correct
58 Correct 86 ms 37848 KB Output is correct
59 Correct 90 ms 38356 KB Output is correct
60 Correct 111 ms 38988 KB Output is correct
61 Correct 85 ms 37940 KB Output is correct
62 Correct 92 ms 38812 KB Output is correct
63 Correct 80 ms 38856 KB Output is correct
64 Correct 83 ms 38732 KB Output is correct
65 Correct 86 ms 38856 KB Output is correct
66 Correct 90 ms 39112 KB Output is correct
67 Correct 120 ms 39400 KB Output is correct
68 Correct 115 ms 39368 KB Output is correct
69 Correct 99 ms 39880 KB Output is correct
70 Correct 119 ms 39432 KB Output is correct
71 Correct 114 ms 39512 KB Output is correct
72 Correct 112 ms 39496 KB Output is correct
73 Correct 123 ms 39936 KB Output is correct
74 Correct 73 ms 39504 KB Output is correct
75 Correct 69 ms 39368 KB Output is correct
76 Correct 76 ms 41556 KB Output is correct
77 Correct 86 ms 40776 KB Output is correct
78 Correct 93 ms 41416 KB Output is correct
79 Correct 121 ms 39504 KB Output is correct
80 Correct 99 ms 39112 KB Output is correct
81 Correct 78 ms 39372 KB Output is correct
82 Correct 102 ms 38220 KB Output is correct
83 Correct 107 ms 38600 KB Output is correct
84 Correct 118 ms 38856 KB Output is correct
85 Correct 101 ms 39368 KB Output is correct
86 Correct 91 ms 39368 KB Output is correct
87 Correct 108 ms 39500 KB Output is correct
88 Correct 95 ms 39368 KB Output is correct
89 Correct 94 ms 39376 KB Output is correct
90 Correct 79 ms 41928 KB Output is correct
91 Correct 82 ms 39372 KB Output is correct
92 Correct 100 ms 39372 KB Output is correct
93 Correct 121 ms 39504 KB Output is correct
94 Correct 112 ms 39624 KB Output is correct
95 Correct 112 ms 39528 KB Output is correct
96 Correct 81 ms 40708 KB Output is correct
97 Correct 87 ms 41924 KB Output is correct
98 Correct 82 ms 41924 KB Output is correct
99 Correct 85 ms 41928 KB Output is correct
100 Correct 78 ms 41432 KB Output is correct
101 Correct 85 ms 41740 KB Output is correct
102 Correct 82 ms 41816 KB Output is correct
103 Correct 95 ms 39372 KB Output is correct