oj.uz

답안 #261277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261277 2020-08-11T15:47:17 Z Saboon 치료 계획 (JOI20_treatment) C++14
4 / 100
 99 ms 6388 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 10;

ll T[maxn], L[maxn], R[maxn], C[maxn], p[maxn], dp[maxn];

int main(){
	ios_base::sync_with_stdio(false);
	ll n, m;
	cin >> n >> m;
	for (ll i = 1; i <= m; i++)
		cin >> T[i] >> L[i] >> R[i] >> C[i];
	if (*max_element(T+1, T+m+1) == 1){
		for (ll i = 1; i <= m; i++)
			p[i] = i;
		sort(p+1, p+m+1, [](ll a, ll b){ return R[a] < R[b]; });
		vector<ll> S;
		for (ll iit = 1; iit <= m; iit++){
			ll i = p[iit];
			if (L[i] == 1)
				dp[i] = C[i];
			else
				dp[i] = -1;
			if (S.empty()){
				if (dp[i] != -1)
					S.push_back(i);
				continue;
			}
			ll lo = -1, hi = S.size();
			while (hi - lo > 1){
				ll mid = (lo + hi) >> 1;
				if (R[S[mid]]+1 < L[i])
					lo = mid;
				else
					hi = mid;
			}
			if (hi == S.size())
				continue;
			if (dp[i] == -1 or dp[i] > dp[S[hi]] + C[i])
				dp[i] = dp[S[hi]] + C[i];
			while (!S.empty() and dp[S.back()] >= dp[i])
				S.pop_back();
			S.push_back(i);
		}
		ll answer = -1;
		for (ll i = 1; i <= m; i++)
			if (R[i] == n and dp[i] != -1 and (answer == -1 or answer > dp[i]))
				answer = dp[i];
		cout << answer << endl;
		return 0;
	}
	for (ll i = 1; i <= m; i++)
		p[i] = i;
	for (ll _ = 0; _ < m; _++){
		for (ll iit = 1; iit <= m; iit++){
			ll i = p[iit];
			if (L[i] == 1)
				dp[i] = C[i];
			for (ll jit = 1; jit <= m; jit++){
				ll j = p[jit];
				if (abs(T[i]-T[j]) <= R[j]-L[i]+1 and dp[j] != -1)
					if (dp[i] == -1 or dp[i] > dp[j] + C[i])
						dp[i] = dp[j] + C[i];
			}
			for (ll jit = 1; jit <= m; jit++){
				ll j = p[jit];
				if (abs(T[i]-T[j]) <= R[i]-L[j]+1 and dp[i] != -1){
					if (dp[j] == -1 or dp[j] > dp[i] + C[j])
						dp[j] = dp[i] + C[j];
				}
			}
		}
	}
	ll answer = -1;
	for (ll i = 1; i <= m; i++)
		if (R[i] == n and dp[i] != -1 and (answer == -1 or answer > dp[i]))
			answer = dp[i];
	cout << answer << endl;
}

Compilation message

treatment.cpp: In function 'int main()':
treatment.cpp:38:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (hi == S.size())
        ~~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 6388 KB Output is correct
2 Correct 86 ms 5752 KB Output is correct
3 Correct 78 ms 5752 KB Output is correct
4 Correct 97 ms 5752 KB Output is correct
5 Correct 75 ms 5112 KB Output is correct
6 Correct 87 ms 5112 KB Output is correct
7 Correct 89 ms 5240 KB Output is correct
8 Correct 76 ms 5112 KB Output is correct
9 Correct 68 ms 5112 KB Output is correct
10 Correct 63 ms 5112 KB Output is correct
11 Correct 71 ms 5112 KB Output is correct
12 Correct 73 ms 5112 KB Output is correct
13 Correct 91 ms 5112 KB Output is correct
14 Correct 78 ms 5112 KB Output is correct
15 Correct 82 ms 5112 KB Output is correct
16 Correct 81 ms 5112 KB Output is correct
17 Correct 77 ms 5112 KB Output is correct
18 Correct 65 ms 5116 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 6388 KB Output is correct
2 Correct 86 ms 5752 KB Output is correct
3 Correct 78 ms 5752 KB Output is correct
4 Correct 97 ms 5752 KB Output is correct
5 Correct 75 ms 5112 KB Output is correct
6 Correct 87 ms 5112 KB Output is correct
7 Correct 89 ms 5240 KB Output is correct
8 Correct 76 ms 5112 KB Output is correct
9 Correct 68 ms 5112 KB Output is correct
10 Correct 63 ms 5112 KB Output is correct
11 Correct 71 ms 5112 KB Output is correct
12 Correct 73 ms 5112 KB Output is correct
13 Correct 91 ms 5112 KB Output is correct
14 Correct 78 ms 5112 KB Output is correct
15 Correct 82 ms 5112 KB Output is correct
16 Correct 81 ms 5112 KB Output is correct
17 Correct 77 ms 5112 KB Output is correct
18 Correct 65 ms 5116 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Incorrect 1 ms 384 KB Output isn't correct
21 Halted 0 ms 0 KB -