oj.uz

답안 #701364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
701364 2023-02-21T04:23:53 Z GusterGoose27 Arranging Tickets (JOI17_arranging_tickets) C++11
컴파일 오류
 0 ms 0 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 2e5;
const int MAXM = 1e5;
int n, m;
ll overall[MAXN];
ll arr[MAXN];
ll req_red[MAXN];
ll r_end[MAXN];
vector<pii> ranges[MAXN]; // right endpoint, index

ll max(ll a, ll b) {
	if (a > b) return a;
	return b;
}

int num_req(int target) {
	for (int i = 0; i < n; i++) req_red[i] = max(0, arr[i]-target);
	fill(r_end, r_end+n, 0);
	priority_queue<pii> pq;
	ll sub = 0;
	ll num = 0;
	for (pii i: ranges[0]) pq.push(i);
	for (int i = 0; i < n; i++) {
		if (sub < req_red[i]) {
			pii r = pq.top();
			pq.pop();
			int amt;
			if (r.second > req_red[i]-sub) {
				r.second -= (req_red[i]-sub);
				amt = (req_red[i]-sub);
				pq.push(r);
			}
			else amt = r.second;
			r_end[r.first] += amt;
			sub += amt;
			i--;
			num += amt;
			continue;
		}
		for (pii v: ranges[i+1]) pq.push(v);
		sub -= r_end[i];
	}
	return num;
}

int solve() {
	int mn = -1;
	int mx = 0;
	for (int i = 0; i < n; i++) mx = max(mx, arr[i]);
	mx++;
	// int b = -1;
	// for (int i = mn+1; i < mx; i++) {
	// 	int v = 2*i+num_req(i);
	// 	if (b == -1 || v < b) b = v;
	// }
	// return b;
	while (mx > mn+2) {
		int cur = (mn+mx)/2;
		int v1 = num_req(cur);
		int v2 = num_req(cur+1);
		if (v1 >= v2+2) mn = cur;
		else mx = cur+1;
	}
	return 2*(mn+1)+num_req(mn+1);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m;
	n--;
	for (int i = 0; i < m; i++) {
		int a, b, c; cin >> a >> b >> c;
		a--; b--;
		if (a > b) swap(a, b);
		ranges[a].push_back(pii(b-1, c));
		overall[a] += c;
		overall[b] -= c;
	}
	for (int i = 0; i < n; i++) {
		overall[i+1] += overall[i];
	}
	for (int i = 0; i < n; i++) {
		arr[i] = (overall[i]+1)/2;
	}
	ll ans = solve();
	for (int i = 0; i < n; i++) arr[i] = overall[i]/2;
	ans = min(ans, solve()+1);
	cout << ans << "\n";
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:93:26: error: no matching function for call to 'min(ll&, int)'
   93 |  ans = min(ans, solve()+1);
      |                          ^
In file included from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from arranging_tickets.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
arranging_tickets.cpp:93:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   93 |  ans = min(ans, solve()+1);
      |                          ^
In file included from /usr/include/c++/10/bits/char_traits.h:39,
                 from /usr/include/c++/10/ios:40,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from arranging_tickets.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
arranging_tickets.cpp:93:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   93 |  ans = min(ans, solve()+1);
      |                          ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from arranging_tickets.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
arranging_tickets.cpp:93:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   93 |  ans = min(ans, solve()+1);
      |                          ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from arranging_tickets.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
arranging_tickets.cpp:93:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   93 |  ans = min(ans, solve()+1);
      |                          ^