제출 #1241753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241753		wedonttalkanymore	Examination (JOI19_examination)	C++20	컴파일 에러	0 ms	0 KiB

examination

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;

#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second

const ll N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ordered_set <pii> s1, s2;

struct item {
	int val, type, idx;
};
vector <item> comp;
int n, q;
int a[N], b[N];
int x[N], y[N], z[N];
int ans[N];

bool cmp(item a, item b) {
	return a.val < b.val;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
		comp.push_back({-(a[i] + b[i]), 0, i});
	}
	for (int i = 1; i <= q; i++) {
		cin >> x[i] >> y[i] >> z[i];
		z[i] = max(z[i], x[i] + y[i]);
		comp.push_back({-z[i], 1, i});
	}
	sort(comp.begin(), comp.end(), cmp);
//	comp.erase(unique(comp.begin(), comp.end()), comp.end());
	int now = 0;
	for (auto val : comp) {
		int idx = val.idx;
		if (val.type == 0) {
			now++;
			s1.insert({a[idx], idx});
			s2.insert({b[idx], idx});
		}
		else {
			int t1 = s1.order_of_key(x[idx], 0LL);
			int t2 = s2.order_of_key(y[idx], 0LL);
			ans[idx] = now - t1 - t2;
		}
	}
	for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

examination.cpp: In function 'int main()':
examination.cpp:56:49: error: no matching function for call to '__gnu_pbds::tree<std::pair<long long int, long long int>, __gnu_pbds::null_type, std::less<std::pair<long long int, long long int> >, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update, std::allocator<char> >::order_of_key(long long int&, long long int)'
   56 |                         int t1 = s1.order_of_key(x[idx], 0LL);
      |                                  ~~~~~~~~~~~~~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/11/ext/pb_ds/detail/standard_policies.hpp:48,
                 from /usr/include/c++/11/ext/pb_ds/assoc_container.hpp:47,
                 from examination.cpp:2:
/usr/include/c++/11/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp:78:1: note: candidate: '__gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::size_type __gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::order_of_key(__gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::key_const_reference) const [with Node_CItr = __gnu_pbds::detail::bin_search_tree_const_node_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, std::allocator<char> >; Node_Itr = __gnu_pbds::detail::bin_search_tree_const_node_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, std::allocator<char> >; Cmp_Fn = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<char>; __gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::size_type = long unsigned int; __gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::key_const_reference = const std::pair<long long int, long long int>&]'
   78 | PB_DS_CLASS_C_DEC::
      | ^~~~~~~~~~~~~~~~~
/usr/include/c++/11/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp:78:1: note:   candidate expects 1 argument, 2 provided
examination.cpp:57:49: error: no matching function for call to '__gnu_pbds::tree<std::pair<long long int, long long int>, __gnu_pbds::null_type, std::less<std::pair<long long int, long long int> >, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update, std::allocator<char> >::order_of_key(long long int&, long long int)'
   57 |                         int t2 = s2.order_of_key(y[idx], 0LL);
      |                                  ~~~~~~~~~~~~~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/11/ext/pb_ds/detail/standard_policies.hpp:48,
                 from /usr/include/c++/11/ext/pb_ds/assoc_container.hpp:47,
                 from examination.cpp:2:
/usr/include/c++/11/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp:78:1: note: candidate: '__gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::size_type __gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::order_of_key(__gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::key_const_reference) const [with Node_CItr = __gnu_pbds::detail::bin_search_tree_const_node_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, std::allocator<char> >; Node_Itr = __gnu_pbds::detail::bin_search_tree_const_node_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, __gnu_pbds::detail::bin_search_tree_const_it_<__gnu_pbds::detail::rb_tree_node_<std::pair<long long int, long long int>, long unsigned int, std::allocator<char> >*, std::pair<long long int, long long int>, std::pair<long long int, long long int>*, const std::pair<long long int, long long int>*, std::pair<long long int, long long int>&, const std::pair<long long int, long long int>&, true, std::allocator<char> >, std::allocator<char> >; Cmp_Fn = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<char>; __gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::size_type = long unsigned int; __gnu_pbds::tree_order_statistics_node_update<Node_CItr, Node_Itr, Cmp_Fn, _Alloc>::key_const_reference = const std::pair<long long int, long long int>&]'
   78 | PB_DS_CLASS_C_DEC::
      | ^~~~~~~~~~~~~~~~~
/usr/include/c++/11/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp:78:1: note:   candidate expects 1 argument, 2 provided