| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1037702 |
2024-07-29T07:02:29 Z |
정민찬(#10982) |
Tourism (JOI23_tourism) |
C++17 |
|
0 ms |
0 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const int inf = 2e9;
int N, M, Q;
vector<int> adj[100010];
int C[100010];
vector<int> s[100010];
int L[100010];
int R[100010];
int ans[100010];
int dia[100010];
int chk[100010];
int sz[100010];
int getSize(int x, int p) {
sz[x] = 1;
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
sz[x] += getSize(y, x);
}
return sz[x];
}
int getCent(int x, int p, int cap) {
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
if (sz[y] * 2 > cap) return getCent(y, x, cap);
}
return x;
}
struct Fenwick{
vector<int> tree;
void init(int n) {
tree.assign(n+1, 0);
}
void upd(int i, int v, int n) {
while (i <= n) {
tree[i] += v;
i += i & -i;
}
}
int qry(int i) {
int ret = 0;
while (i) {
ret += tree[i];
i -= i & -i;
}
return ret;
}
int qry(int l, int r) {
return qry(r) - qry(l-1);
}
};
struct MaxSegmentTree{
vector<pair<int,int>> tree;
void init(int n) {
int sz = 1 << __lg(n-1) + 2;
tree.resize(sz);
build(1, 1, n);
}
void build(int node, int s, int e) {
if (s == e) {
tree[node] = {-inf, s};
return;
}
int mid = s + e >> 1;
build(node*2, s, mid);
build(node*2+1, mid+1, e);
tree[node] = max(tree[node*2], tree[node*2+1]);
}
void update(int node, int s, int e, int tar, int val, int num = -1) {
if (s > tar || tar > e) return;
if (s == e) {
if (num == -1) num = s;
tree[node] = {val, num};
return;
}
int mid = s + e >> 1;
update(node*2, s, mid, tar, val, num);
update(node*2+1, mid+1, e, tar, val, num);
tree[node] = max(tree[node*2], tree[node*2+1]);
}
pair<int,int> query(int node, int s, int e, int l, int r) {
if (l > e || s > r) return {-inf, -1};
if (l <= s && e <= r) return tree[node];
int mid = s + e >> 1;
return max(query(node*2, s, mid, l, r), query(node*2+1, mid+1, e, l, r));
}
};
Fenwick seg;
MaxSegmentTree mxs, mns;
vector<int> data;
int Idx(int v) {
return lower_bound(data.begin(), data.end(), v) - data.begin() + 1;
}
void dfs(int x, int p) {
for (auto &k : s[x]) {
data.push_back(k);
}
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
dfs(y, x);
}
}
void dfs2(int x, int p, int r) {
for (auto &k : s[x]) {
int idx = Idx(k);
mxs.update(1, 1, data.size(), idx, r);
mns.update(1, 1, data.size(), idx, -r);
}
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
dfs2(y, x, r);
}
}
void dfs3(int x, int p, int dep, int r) {
for (auto &k : s[x]) {
int idx = Idx(k);
mxs.update(1, 1, data.size(), idx, dep, r);
}
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
dfs3(y, x, dep+1, r);
}
}
void dfs3_del(int x, int p) {
for (auto &k : s[x]) {
int idx = Idx(k);
mxs.update(1, 1, data.size(), idx, -inf);
}
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
dfs3_del(y, x);
}
}
int getSize2(int x, int p) {
sz[x] = s[x].size();
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
sz[x] += getSize2(y, x);
}
return sz[x];
}
set<int> ss[100010];
int id[100010];
int pv;
vector<pair<int,int>> save[100010];
void my_ins(int i, int k, int cnt, int x) {
auto rit = ss[i].lower_bound(k);
if (rit != ss[i].end()) {
save[k+1].push_back({*rit, cnt});
}
if (rit != ss[i].begin()) {
auto lit = prev(rit);
save[*lit+1].push_back({k, cnt});
if (rit != ss[i].end()) {
save[*lit+1].push_back({*rit, -cnt});
}
}
ss[i].insert(k);
}
int dfs4(int x, int p, int cnt) {
int mxsz = -1, ch = -1;
for (auto &y : adj[x]) {
if (y == p || chk[y]) continue;
if (sz[y] > mxsz) {
mxsz = sz[y];
ch = y;
}
}
if (ch == -1) {
id[x] = pv ++;
int p = 0;
ss[id[x]].insert(0);
for (auto &k : s[x]) {
ss[id[x]].insert(Idx(k));
save[p+1].push_back({Idx(k), cnt});
p = Idx(k);
}
return id[x];
}
else {
id[x] = dfs4(ch, x, cnt + 1);
for (auto &y : adj[x]) {
if (y == p || y == ch || chk[y]) continue;
int z = dfs4(y, x, 1);
for (auto &k : ss[z]) {
if (k == 0) continue;
my_ins(id[x], Idx(k), cnt, x);
}
}
for (auto &k : s[x]) {
my_ins(id[x], Idx(k), cnt, x);
}
return id[x];
}
}
void dnc(int x, vector<int> qrs) {
if (qrs.empty()) return;
x = getCent(x, -1, getSize(x, -1));
data.clear();
dfs(x, -1);
sort(data.begin(), data.end());
mxs.init(data.size()); mns.init(data.size());
for (int i=0; i<adj[x].size(); i++) {
int y = adj[x][i];
if (chk[y]) continue;
dfs2(y, x, i);
}
for (auto &k : s[x]) {
int idx = Idx(k);
mxs.update(1, 1, data.size(), idx, -1);
mns.update(1, 1, data.size(), idx, 1);
}
vector<int> curq;
vector<int> nxtq[adj[x].size()];
for (auto &i : qrs) {
int li = Idx(L[i]), ri = Idx(R[i]);
int ret1 = mxs.query(1, 1, data.size(), li, ri).first;
int ret2 = -mns.query(1, 1, data.size(), li, ri).first;
if (ret1 == ret2 && ret1 != -1) {
nxtq[ret1].push_back(i);
}
else {
curq.push_back(i);
}
}
mxs.init(data.size());
for (int i=0; i<adj[x].size(); i++) {
int y = adj[x][i];
if (chk[y]) continue;
dfs3(y, x, 1, i);
}
vector<int> mxi[adj[x].size()];
for (auto &i : curq) {
if (L[i] == R[i]) dia[i] = 0;
else {
pair<int,int> ret = mxs.query(1, 1, data.size(), Idx(L[i]), Idx(R[i]));
dia[i] = ret.first;
mxi[ret.second].push_back(i);
}
}
for (int i=0; i<adj[x].size(); i++) {
int y = adj[x][i];
if (chk[y]) continue;
dfs3_del(y, x);
for (auto &j : mxi[i]) {
dia[j] += max(0, mxs.query(1, 1, data.size(), Idx(L[j]), Idx(R[j])).first);
}
dfs3(y, x, 1, i);
}
getSize2(x, -1);
pv = 0;
dfs4(x, -1, 0);
for (int i=0; i<pv; i++) {
ss[i].clear();
}
seg.init(data.size());
sort(curq.begin(), curq.end(), [&] (int &u, int &v) { return L[u] < L[v]; });
int j = 0;
for (int i=1; i<=data.size(); i++) {
for (auto &[pos, v] : save[i]) {
seg.upd(pos, v, data.size());
}
while (j < curq.size() && L[curq[j]] == data[i-1]) {
ans[curq[j]] = seg.qry(Idx(L[curq[j]]), Idx(R[curq[j]]));
j ++;
}
}
for (int i=0; i<=data.size() + 2; i++) {
save[i].clear();
}
chk[x] = 1;
for (int i=0; i<adj[x].size(); i++) {
int y = adj[x][i];
if (chk[y]) continue;
dnc(y, nxtq[i]);
}
}
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL);
cin >> N >> M >> Q;
for (int i=0; i<N-1; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i=1; i<=M; i++) {
cin >> C[i];
s[C[i]].push_back(i);
}
for (int i=1; i<=Q; i++) {
cin >> L[i] >> R[i];
}
vector<int> Sum(N+1, 0);
for (int i=1; i<=N; i++) {
sort(s[i].begin(), s[i].end());
Sum[i] = Sum[i-1] + s[i].size();
}
vector<int> initq(Q);
iota(initq.begin(), initq.end(), 1);
dnc(1, initq);
for (int i=1; i<=Q; i++) {
cout << ans[i] + 1 << '\n';
}
}
Compilation message
tourism.cpp: In member function 'void MaxSegmentTree::init(int)':
tourism.cpp:66:33: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
66 | int sz = 1 << __lg(n-1) + 2;
| ~~~~~~~~~~^~~
tourism.cpp: In member function 'void MaxSegmentTree::build(int, int, int)':
tourism.cpp:75:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
75 | int mid = s + e >> 1;
| ~~^~~
tourism.cpp: In member function 'void MaxSegmentTree::update(int, int, int, int, int, int)':
tourism.cpp:87:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
87 | int mid = s + e >> 1;
| ~~^~~
tourism.cpp: In member function 'std::pair<int, int> MaxSegmentTree::query(int, int, int, int, int)':
tourism.cpp:95:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
95 | int mid = s + e >> 1;
| ~~^~~
tourism.cpp: In function 'int Idx(int)':
tourism.cpp:106:24: error: reference to 'data' is ambiguous
106 | return lower_bound(data.begin(), data.end(), v) - data.begin() + 1;
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp:106:38: error: reference to 'data' is ambiguous
106 | return lower_bound(data.begin(), data.end(), v) - data.begin() + 1;
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp:106:55: error: reference to 'data' is ambiguous
106 | return lower_bound(data.begin(), data.end(), v) - data.begin() + 1;
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp: In function 'void dfs(int, int)':
tourism.cpp:112:9: error: reference to 'data' is ambiguous
112 | data.push_back(k);
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp: In function 'void dfs2(int, int, int)':
tourism.cpp:123:26: error: reference to 'data' is ambiguous
123 | mxs.update(1, 1, data.size(), idx, r);
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp:124:26: error: reference to 'data' is ambiguous
124 | mns.update(1, 1, data.size(), idx, -r);
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp: In function 'void dfs3(int, int, int, int)':
tourism.cpp:135:26: error: reference to 'data' is ambiguous
135 | mxs.update(1, 1, data.size(), idx, dep, r);
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp: In function 'void dfs3_del(int, int)':
tourism.cpp:146:26: error: reference to 'data' is ambiguous
146 | mxs.update(1, 1, data.size(), idx, -inf);
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp: In function 'void dnc(int, std::vector<int>)':
tourism.cpp:223:5: error: reference to 'data' is ambiguous
223 | data.clear();
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(_Container&)'
290 | data(_Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
tourism.cpp:103:13: note: 'std::vector<int> data'
103 | vector<int> data;
| ^~~~
tourism.cpp:225:10: error: reference to 'data' is ambiguous
225 | sort(data.begin(), data.end());
| ^~~~
In file included from /usr/include/c++/10/string:54,
from /usr/include/c++/10/bits/locale_classes.h:40,
from /usr/include/c++/10/bits/ios_base.h:41,
from /usr/include/c++/10/ios:42,
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 tourism.cpp:1:
/usr/include/c++/10/bits/range_access.h:319:5: note: candidates are: 'template<class _Tp> constexpr const _Tp* std::data(std::initializer_list<_Tp>)'
319 | data(initializer_list<_Tp> __il) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:310:5: note: 'template<class _Tp, long unsigned int _Nm> constexpr _Tp* std::data(_Tp (&)[_Nm])'
310 | data(_Tp (&__array)[_Nm]) noexcept
| ^~~~
/usr/include/c++/10/bits/range_access.h:300:5: note: 'template<class _Container> constexpr decltype (__cont.data()) std::data(const _Container&)'
300 | data(const _Container& __cont) noexcept(noexcept(__cont.data()))
| ^~~~
/usr/include/c++/10/bits/range_access.h:290:5: note: 'template<class _Container> constexpr decltype (__cont.data()) st
