oj.uz

Submission #1046960

# Submission time Handle Problem Language Result Execution time Memory
1046960 2024-08-07T06:58:06 Z ㄷㄷ(#11083) Treatment Project (JOI20_treatment) C++17
100 / 100
 647 ms 428760 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const ll INF = 1LL * 1e18;

inline int getc(vector<int> &V, int x) { return lower_bound(V.begin(), V.end(), x) - V.begin() + 1; }

ll D[100009];
deque<pii> PT[300009], QT[300009];
int T[100009], L[100009], R[100009], C[100009];
priority_queue<pli> pq;
bool chk[100009];

void updP(int idx, int s, int e, int l, int r, int id) {
	if(r < s || e < l) return;
	if(l <= s && e <= r) {
		PT[idx].push_back({T[id], id});
		return;
	}
	int m = s+e >> 1;
	updP(idx*2, s, m, l, r, id);
	updP(idx*2+1, m+1, e, l, r, id);
}

void updQ(int idx, int s, int e, int l, int r, int id) {
	if(r < s || e < l) return;
	if(l <= s && e <= r) {
		QT[idx].push_back({T[id], id});
		return;
	}
	int m = s+e >> 1;
	updQ(idx*2, s, m, l, r, id);
	updQ(idx*2+1, m+1, e, l, r, id);
}

void getP(ll pc, int idx, int s, int e, int p, int t) {
	if(p < s || e < p) return;
	while(PT[idx].size()) {
		int ti, id; tie(ti, id) = PT[idx].back();
		if(ti < t) break;
		PT[idx].pop_back();
		if(chk[id]) continue;
		chk[id] = 1;
		pq.push({-(pc + C[id]), id});
	}
	if(s == e) return;
	int m = s+e >> 1;
	getP(pc, idx*2, s, m, p, t);
	getP(pc, idx*2+1, m+1, e, p, t);
}

void getQ(ll pc, int idx, int s, int e, int p, int t) {
	if(p < s || e < p) return;
	while(QT[idx].size()) {
		int ti, id; tie(ti, id) = QT[idx].front();
		if(ti > t) break;
		QT[idx].pop_front();
		if(chk[id]) continue;
		chk[id] = 1;
		pq.push({-(pc + C[id]), id});
	}
	if(s == e) return;
	int m = s+e >> 1;
	getQ(pc, idx*2, s, m, p, t);
	getQ(pc, idx*2+1, m+1, e, p, t);
}

int main() {
	vector<int> PV, QV;
	int N, M; scanf("%d%d",&N,&M);
	for(int i=1; i<=M; i++) {
		scanf("%d%d%d%d", &T[i], &L[i], &R[i], &C[i]); --L[i];
		if(L[i] == 0) {
			pq.push({-C[i], i});
			chk[i] = 1;
		}
		PV.push_back(R[i] + T[i]);
		QV.push_back(R[i] - T[i]);
	}
	sort(PV.begin(), PV.end()); PV.resize(unique(PV.begin(), PV.end()) - PV.begin());
	sort(QV.begin(), QV.end()); QV.resize(unique(QV.begin(), QV.end()) - QV.begin());
	int PM = PV.size(), QM = QV.size();
	for(int i=1; i<=M; i++) {
		int pl = getc(PV, L[i] + T[i]), pr = getc(PV, R[i] + T[i]);
		updP(1, 1, PM, pl, pr, i);
		int ql = getc(QV, L[i] - T[i]), qr = getc(QV, R[i] - T[i]);
		updQ(1, 1, QM, ql, qr, i);
	}
	for(int i=1; i<=300000; i++) sort(PT[i].begin(), PT[i].end());
	for(int i=1; i<=300000; i++) sort(QT[i].begin(), QT[i].end());
	memset(D, -1, sizeof(D));
	while(pq.size()) {
		ll c; int x; tie(c, x) = pq.top(); pq.pop(); c = -c;
		D[x] = c;
		getP(c, 1, 1, PM, getc(PV, R[x] + T[x]), T[x]);
		getQ(c, 1, 1, QM, getc(QV, R[x] - T[x]), T[x]);
	}
	ll ans = INF;
	for(int i=1; i<=M; i++) if(R[i] == N && D[i] != -1) ans = min(ans, D[i]);
	if(ans != INF) printf("%lld", ans);
	else puts("-1");
	return 0;
}

Compilation message

treatment.cpp: In function 'void updP(int, int, int, int, int, int)':
treatment.cpp:22:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |  int m = s+e >> 1;
      |          ~^~
treatment.cpp: In function 'void updQ(int, int, int, int, int, int)':
treatment.cpp:33:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |  int m = s+e >> 1;
      |          ~^~
treatment.cpp: In function 'void getP(ll, int, int, int, int, int)':
treatment.cpp:49:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |  int m = s+e >> 1;
      |          ~^~
treatment.cpp: In function 'void getQ(ll, int, int, int, int, int)':
treatment.cpp:65:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |  int m = s+e >> 1;
      |          ~^~
treatment.cpp: In function 'int main()':
treatment.cpp:72:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  int N, M; scanf("%d%d",&N,&M);
      |            ~~~~~^~~~~~~~~~~~~~
treatment.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d%d%d%d", &T[i], &L[i], &R[i], &C[i]); --L[i];
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 407748 KB Output is correct
2 Correct 274 ms 407764 KB Output is correct
3 Correct 379 ms 419904 KB Output is correct
4 Correct 364 ms 419720 KB Output is correct
5 Correct 224 ms 412256 KB Output is correct
6 Correct 216 ms 409288 KB Output is correct
7 Correct 240 ms 408000 KB Output is correct
8 Correct 208 ms 409028 KB Output is correct
9 Correct 220 ms 408620 KB Output is correct
10 Correct 193 ms 407492 KB Output is correct
11 Correct 359 ms 419872 KB Output is correct
12 Correct 373 ms 419904 KB Output is correct
13 Correct 481 ms 412228 KB Output is correct
14 Correct 474 ms 412228 KB Output is correct
15 Correct 394 ms 407668 KB Output is correct
16 Correct 400 ms 407748 KB Output is correct
17 Correct 387 ms 407748 KB Output is correct
18 Correct 401 ms 419904 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 406556 KB Output is correct
2 Correct 142 ms 406540 KB Output is correct
3 Correct 145 ms 406612 KB Output is correct
4 Correct 133 ms 406468 KB Output is correct
5 Correct 149 ms 406608 KB Output is correct
6 Correct 135 ms 406608 KB Output is correct
7 Correct 141 ms 406608 KB Output is correct
8 Correct 155 ms 406608 KB Output is correct
9 Correct 142 ms 406540 KB Output is correct
10 Correct 146 ms 406612 KB Output is correct
11 Correct 168 ms 406604 KB Output is correct
12 Correct 157 ms 406616 KB Output is correct
13 Correct 123 ms 406588 KB Output is correct
14 Correct 139 ms 406528 KB Output is correct
15 Correct 135 ms 406512 KB Output is correct
16 Correct 145 ms 406556 KB Output is correct
17 Correct 131 ms 406608 KB Output is correct
18 Correct 138 ms 406448 KB Output is correct
19 Correct 142 ms 406608 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 406556 KB Output is correct
2 Correct 142 ms 406540 KB Output is correct
3 Correct 145 ms 406612 KB Output is correct
4 Correct 133 ms 406468 KB Output is correct
5 Correct 149 ms 406608 KB Output is correct
6 Correct 135 ms 406608 KB Output is correct
7 Correct 141 ms 406608 KB Output is correct
8 Correct 155 ms 406608 KB Output is correct
9 Correct 142 ms 406540 KB Output is correct
10 Correct 146 ms 406612 KB Output is correct
11 Correct 168 ms 406604 KB Output is correct
12 Correct 157 ms 406616 KB Output is correct
13 Correct 123 ms 406588 KB Output is correct
14 Correct 139 ms 406528 KB Output is correct
15 Correct 135 ms 406512 KB Output is correct
16 Correct 145 ms 406556 KB Output is correct
17 Correct 131 ms 406608 KB Output is correct
18 Correct 138 ms 406448 KB Output is correct
19 Correct 142 ms 406608 KB Output is correct
20 Correct 165 ms 406944 KB Output is correct
21 Correct 153 ms 406868 KB Output is correct
22 Correct 145 ms 406712 KB Output is correct
23 Correct 148 ms 406604 KB Output is correct
24 Correct 155 ms 406868 KB Output is correct
25 Correct 153 ms 406608 KB Output is correct
26 Correct 137 ms 406532 KB Output is correct
27 Correct 144 ms 406612 KB Output is correct
28 Correct 163 ms 406864 KB Output is correct
29 Correct 144 ms 406608 KB Output is correct
30 Correct 141 ms 406620 KB Output is correct
31 Correct 144 ms 406484 KB Output is correct
32 Correct 178 ms 406988 KB Output is correct
33 Correct 172 ms 407124 KB Output is correct
34 Correct 156 ms 406612 KB Output is correct
35 Correct 149 ms 407052 KB Output is correct
36 Correct 155 ms 406936 KB Output is correct
37 Correct 141 ms 406720 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 407748 KB Output is correct
2 Correct 274 ms 407764 KB Output is correct
3 Correct 379 ms 419904 KB Output is correct
4 Correct 364 ms 419720 KB Output is correct
5 Correct 224 ms 412256 KB Output is correct
6 Correct 216 ms 409288 KB Output is correct
7 Correct 240 ms 408000 KB Output is correct
8 Correct 208 ms 409028 KB Output is correct
9 Correct 220 ms 408620 KB Output is correct
10 Correct 193 ms 407492 KB Output is correct
11 Correct 359 ms 419872 KB Output is correct
12 Correct 373 ms 419904 KB Output is correct
13 Correct 481 ms 412228 KB Output is correct
14 Correct 474 ms 412228 KB Output is correct
15 Correct 394 ms 407668 KB Output is correct
16 Correct 400 ms 407748 KB Output is correct
17 Correct 387 ms 407748 KB Output is correct
18 Correct 401 ms 419904 KB Output is correct
19 Correct 140 ms 406556 KB Output is correct
20 Correct 142 ms 406540 KB Output is correct
21 Correct 145 ms 406612 KB Output is correct
22 Correct 133 ms 406468 KB Output is correct
23 Correct 149 ms 406608 KB Output is correct
24 Correct 135 ms 406608 KB Output is correct
25 Correct 141 ms 406608 KB Output is correct
26 Correct 155 ms 406608 KB Output is correct
27 Correct 142 ms 406540 KB Output is correct
28 Correct 146 ms 406612 KB Output is correct
29 Correct 168 ms 406604 KB Output is correct
30 Correct 157 ms 406616 KB Output is correct
31 Correct 123 ms 406588 KB Output is correct
32 Correct 139 ms 406528 KB Output is correct
33 Correct 135 ms 406512 KB Output is correct
34 Correct 145 ms 406556 KB Output is correct
35 Correct 131 ms 406608 KB Output is correct
36 Correct 138 ms 406448 KB Output is correct
37 Correct 142 ms 406608 KB Output is correct
38 Correct 165 ms 406944 KB Output is correct
39 Correct 153 ms 406868 KB Output is correct
40 Correct 145 ms 406712 KB Output is correct
41 Correct 148 ms 406604 KB Output is correct
42 Correct 155 ms 406868 KB Output is correct
43 Correct 153 ms 406608 KB Output is correct
44 Correct 137 ms 406532 KB Output is correct
45 Correct 144 ms 406612 KB Output is correct
46 Correct 163 ms 406864 KB Output is correct
47 Correct 144 ms 406608 KB Output is correct
48 Correct 141 ms 406620 KB Output is correct
49 Correct 144 ms 406484 KB Output is correct
50 Correct 178 ms 406988 KB Output is correct
51 Correct 172 ms 407124 KB Output is correct
52 Correct 156 ms 406612 KB Output is correct
53 Correct 149 ms 407052 KB Output is correct
54 Correct 155 ms 406936 KB Output is correct
55 Correct 141 ms 406720 KB Output is correct
56 Correct 468 ms 422460 KB Output is correct
57 Correct 477 ms 422276 KB Output is correct
58 Correct 434 ms 411340 KB Output is correct
59 Correct 450 ms 411852 KB Output is correct
60 Correct 402 ms 411080 KB Output is correct
61 Correct 440 ms 411440 KB Output is correct
62 Correct 499 ms 422448 KB Output is correct
63 Correct 325 ms 410816 KB Output is correct
64 Correct 326 ms 410820 KB Output is correct
65 Correct 320 ms 411056 KB Output is correct
66 Correct 370 ms 410968 KB Output is correct
67 Correct 539 ms 414976 KB Output is correct
68 Correct 428 ms 411672 KB Output is correct
69 Correct 343 ms 411588 KB Output is correct
70 Correct 509 ms 415016 KB Output is correct
71 Correct 431 ms 411432 KB Output is correct
72 Correct 340 ms 411636 KB Output is correct
73 Correct 523 ms 414964 KB Output is correct
74 Correct 285 ms 411588 KB Output is correct
75 Correct 235 ms 411588 KB Output is correct
76 Correct 588 ms 427336 KB Output is correct
77 Correct 618 ms 425096 KB Output is correct
78 Correct 525 ms 415684 KB Output is correct
79 Correct 522 ms 412944 KB Output is correct
80 Correct 411 ms 411072 KB Output is correct
81 Correct 351 ms 411632 KB Output is correct
82 Correct 469 ms 413080 KB Output is correct
83 Correct 478 ms 413124 KB Output is correct
84 Correct 507 ms 412096 KB Output is correct
85 Correct 331 ms 411588 KB Output is correct
86 Correct 339 ms 411580 KB Output is correct
87 Correct 347 ms 411608 KB Output is correct
88 Correct 352 ms 411588 KB Output is correct
89 Correct 340 ms 411588 KB Output is correct
90 Correct 460 ms 413248 KB Output is correct
91 Correct 471 ms 412900 KB Output is correct
92 Correct 423 ms 411588 KB Output is correct
93 Correct 512 ms 412656 KB Output is correct
94 Correct 463 ms 413636 KB Output is correct
95 Correct 436 ms 411592 KB Output is correct
96 Correct 457 ms 413444 KB Output is correct
97 Correct 619 ms 424516 KB Output is correct
98 Correct 598 ms 424680 KB Output is correct
99 Correct 647 ms 424660 KB Output is correct
100 Correct 603 ms 427524 KB Output is correct
101 Correct 609 ms 424576 KB Output is correct
102 Correct 615 ms 428760 KB Output is correct
103 Correct 311 ms 411472 KB Output is correct