Submission #261243

#	Time	Username	Problem	Language	Result	Execution time	Memory
261243		Saboon	Treatment Project (JOI20_treatment)	C++14	4 / 100	99 ms	7928 KiB

treatment

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

Compilation message (stderr)

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

• Subtask 1: 4 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 30
• Subtask 4: 0 / 61