이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
IN THE NAME OF GOD
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
#define Mp make_pair
#define pb push_back
#define pf push_front
#define size(x) ((ll)x.size())
#define all(x) (x).begin(),(x).end()
#define kill(x) cout << x << '\n', exit(0);
#define fuck(x) cout << "(" << #x << " , " << x << ")" << endl
#define endl '\n'
const int N = 5e5+23, lg = 20;
ll Mod = 1e9+7; //998244353;
inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
ll ans = 1;
a=MOD(a, mod);
while (b) {
if (b & 1) ans = MOD(ans*a, mod);
b >>= 1;
a = MOD(a*a, mod);
}
return ans;
}
int n, m, h[N], ok[N], cnt, cnd[N], f[N], par[lg][N], mx[lg][N];
vector<pii> e;
vector<int> tree[N];
int getPar(int v) {return (f[v]==0 ? v : f[v]=getPar(f[v]));}
void merge(int v, int u, int w) {
v=getPar(v), u=getPar(u);
if(v == u) {
ok[v] = 1, mx[cnd[v]] = min(mx[cnd[v]], w);
return;
}
tree[cnt].pb(cnd[v]); tree[cnt].pb(cnd[u]);
ok[v] |= ok[u];
if(ok[v] == 1) mx[cnt] = w;
cnd[v] = cnt;
cnt++;
f[u] = v;
}
void dfs_init(int v, int p=0) {
h[v] = h[p] + 1, par[0][v] = (p==0 ? v : p);
mx[v] = min(mx[v], mx[p]);
for(int i=1; i<lg; i++) {
par[i][v] = par[i-1][par[i-1][v]];
}
for(auto u : tree[v]) {
if(u == p) continue;
dfs_init(u, v);
}
}
int getF(int v, int dist) {
for(int i=0; i<lg; i++) if((dist>>i)%2 == 1) {
v = par[i][v];
}
return v;
}
int LCA(int v, int u) {
if(h[v] > h[u]) swap(v, u);
u = getF(u, h[u]-h[v]);
if(v == u) return v;
for(int i=lg-1; i>=0; i--) {
if(par[i][v] != par[i][u]) v=par[i][v], u=par[i][u];
}
return par[0][v];
}
void init(int _n, int _m, vector<int> V, vector<int> U, vector<int> W) {
n=_n, m=_m, cnt=_n+1;
for(int i=0; i<m; i++) {
V[i]++, U[i]++;
e.pb({W[i], i});
}
fill(mx, mx+N, (int)2e9);
for(int i=0; i<N; i++) cnd[i] = i;
sort(all(e));
for(auto it : e) {
merge(V[it.S], U[it.S], it.F);
}
dfs_init(cnd[getPar(1)]);
}
int getMinimumFuelCapacity(int v, int u) {
v++, u++;
int lca = LCA(v, u);
if(mx[lca] == 2e9) return -1;
return mx[lca];
}
/*
int main() {
init(5, 6, {0, 0, 1, 1, 1, 2}, {1, 2, 2, 3, 4, 3}, {4, 4, 1, 2, 10, 3});
cout<<getMinimumFuelCapacity(1, 2)<<endl;
cout<<getMinimumFuelCapacity(2, 4)<<endl;
cout<<getMinimumFuelCapacity(0, 1)<<endl;
init(3, 2, {0, 0}, {1, 2}, {5, 5});
cout<<getMinimumFuelCapacity(1, 2)<<endl;
return 0;
}
*/
컴파일 시 표준 에러 (stderr) 메시지
swap.cpp: In function 'void merge(int, int, int)':
swap.cpp:52:44: error: no matching function for call to 'min(int [500023], int&)'
52 | ok[v] = 1, mx[cnd[v]] = min(mx[cnd[v]], w);
| ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
from /usr/include/c++/10/cmath:1927,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
from swap.cpp:4:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr 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:
swap.cpp:52:44: note: deduced conflicting types for parameter 'const _Tp' ('int [500023]' and 'int')
52 | ok[v] = 1, mx[cnd[v]] = min(mx[cnd[v]], w);
| ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
from /usr/include/c++/10/cmath:1927,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
from swap.cpp:4:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr 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:
swap.cpp:52:44: note: deduced conflicting types for parameter 'const _Tp' ('int [500023]' and 'int')
52 | ok[v] = 1, mx[cnd[v]] = min(mx[cnd[v]], w);
| ^
In file included from /usr/include/c++/10/algorithm:62,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
from swap.cpp:4:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _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:
swap.cpp:52:44: note: mismatched types 'std::initializer_list<_Tp>' and 'int*'
52 | ok[v] = 1, mx[cnd[v]] = min(mx[cnd[v]], w);
| ^
In file included from /usr/include/c++/10/algorithm:62,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
from swap.cpp:4:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _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:
swap.cpp:52:44: note: mismatched types 'std::initializer_list<_Tp>' and 'int*'
52 | ok[v] = 1, mx[cnd[v]] = min(mx[cnd[v]], w);
| ^
swap.cpp:58:25: error: incompatible types in assignment of 'int' to 'int [500023]'
58 | if(ok[v] == 1) mx[cnt] = w;
| ~~~~~~~~^~~
swap.cpp: In function 'void dfs_init(int, int)':
swap.cpp:66:8: error: invalid array assignment
66 | mx[v] = min(mx[v], mx[p]);
| ~~~~~~^~~~~~~~~~~~~~~~~~~
swap.cpp: In function 'int getMinimumFuelCapacity(int, int)':
swap.cpp:111:13: error: invalid operands of types 'int [500023]' and 'double' to binary 'operator=='
111 | if(mx[lca] == 2e9) return -1;
| ~~~~~~~ ^~ ~~~
| | |
| | double
| int [500023]
swap.cpp:112:15: error: invalid conversion from 'int*' to 'int' [-fpermissive]
112 | return mx[lca];
| ~~~~~~^
| |
| int*
In file included from /usr/include/c++/10/bits/specfun.h:45,
from /usr/include/c++/10/cmath:1927,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
from swap.cpp:4:
/usr/include/c++/10/bits/stl_algobase.h: In instantiation of 'typename __gnu_cxx::__enable_if<std::__is_scalar<_Tp>::__value, void>::__type std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int (*)[500023]; _Tp = int; typename __gnu_cxx::__enable_if<std::__is_scalar<_Tp>::__value, void>::__type = void]':
/usr/include/c++/10/bits/stl_algobase.h:914:21: required from 'void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int (*)[500023]; _Tp = int]'
/usr/include/c++/10/bits/stl_algobase.h:944:20: required from 'void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int (*)[500023]; _Tp = int]'
swap.cpp:99:25: required from here
/usr/include/c++/10/bits/stl_algobase.h:873:11: error: incompatible types in assignment of 'const int' to 'int [500023]'
873 | *__first = __tmp;
| ~~~~~~~~~^~~~~~~