이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx,avx2,fma")
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;
#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1);
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()
cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;
template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
return out << '(' << a.first << ", " << a.second << ')'; }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
if(!a.size())return cout<<"[]";cout<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) cout<< ", " << a[i];cout<< ']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;
cl N = 1e5 + 7, SQ = 0;
ll dis [N], n, m, q, ans;
vector <ll> adj [N], vec;
vector <pll> dp [N];
bool mark [N];
int main ()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
memset(dis, -61, sizeof dis); cin>> n >> m >> q;
for (ll i = 0, v, u; i < m; i++) cin>> v >> u, adj[u].push_back(v);
for (ll i = 1; i <= n; i++) {
dp[i] = {{0, i}};
for (auto u : adj[i]) {
dp[0] = dp[u];
for (auto &x : dp[0]) x.fr++;
dp[n+1].clear();
merge(All(dp[i]), All(dp[0]), back_inserter(dp[n+1]), greater<pll>());
dp[n+1].resize(min(SQ, unique(All(dp[n+1])) - dp[n+1].begin()));
dp[i].swap(dp[n+1]);
}
}
for (ll v, t, i; q--;) {
cin>> v >> t;
vec.resize(t); for (auto &x : vec) cin>> x, mark[x] = 1;
if (t < SQ) {
for (i = 0; i < SZ(dp[v]) && mark[dp[v][i].sc]; i++);
cout<< (i < SZ(dp[v]) ? dp[v][i].fr : -1) << '\n';
} else {
for (ans = -1, dis[v] = 0, i = v; i; i--) {
for (auto u : adj[i]) dis[u] = max(dis[u], dis[i] + 1);
if (!mark[i]) ans = max(ans, dis[i]);
}
cout<< ans << '\n';
memset(dis, -61, sizeof(ll) * (v + 1));
}
for (auto &x : vec) mark[x] = 0;
}
return 0;
}
/*
*/
컴파일 시 표준 에러 (stderr) 메시지
bitaro.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
bitaro.cpp:43:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
43 | if(!a.size())return cout<<"[]";cout<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) cout<< ", " << a[i];cout<< ']'; }
| ^~
bitaro.cpp:43:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
43 | if(!a.size())return cout<<"[]";cout<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) cout<< ", " << a[i];cout<< ']'; }
| ^~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:67:65: error: no matching function for call to 'min(const ll&, __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >::difference_type)'
67 | dp[n+1].resize(min(SQ, unique(All(dp[n+1])) - dp[n+1].begin()));
| ^
In file included from /usr/include/c++/9/bits/specfun.h:45,
from /usr/include/c++/9/cmath:1927,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:41,
from bitaro.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:198:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
198 | min(const _Tp& __a, const _Tp& __b)
| ^~~
/usr/include/c++/9/bits/stl_algobase.h:198:5: note: template argument deduction/substitution failed:
bitaro.cpp:67:65: note: deduced conflicting types for parameter 'const _Tp' ('int' and '__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >::difference_type' {aka 'long int'})
67 | dp[n+1].resize(min(SQ, unique(All(dp[n+1])) - dp[n+1].begin()));
| ^
In file included from /usr/include/c++/9/bits/specfun.h:45,
from /usr/include/c++/9/cmath:1927,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:41,
from bitaro.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:246:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
246 | min(const _Tp& __a, const _Tp& __b, _Compare __comp)
| ^~~
/usr/include/c++/9/bits/stl_algobase.h:246:5: note: template argument deduction/substitution failed:
bitaro.cpp:67:65: note: deduced conflicting types for parameter 'const _Tp' ('int' and '__gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >::difference_type' {aka 'long int'})
67 | dp[n+1].resize(min(SQ, unique(All(dp[n+1])) - dp[n+1].begin()));
| ^
In file included from /usr/include/c++/9/algorithm:62,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from bitaro.cpp:1:
/usr/include/c++/9/bits/stl_algo.h:3444:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
3444 | min(initializer_list<_Tp> __l)
| ^~~
/usr/include/c++/9/bits/stl_algo.h:3444:5: note: template argument deduction/substitution failed:
bitaro.cpp:67:65: note: mismatched types 'std::initializer_list<_Tp>' and 'int'
67 | dp[n+1].resize(min(SQ, unique(All(dp[n+1])) - dp[n+1].begin()));
| ^
In file included from /usr/include/c++/9/algorithm:62,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
from bitaro.cpp:1:
/usr/include/c++/9/bits/stl_algo.h:3450:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
3450 | min(initializer_list<_Tp> __l, _Compare __comp)
| ^~~
/usr/include/c++/9/bits/stl_algo.h:3450:5: note: template argument deduction/substitution failed:
bitaro.cpp:67:65: note: mismatched types 'std::initializer_list<_Tp>' and 'int'
67 | dp[n+1].resize(min(SQ, unique(All(dp[n+1])) - dp[n+1].begin()));
| ^