제출 #1342861

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1342861		nagorn_ph	Bitaro’s Party (JOI18_bitaro)	C++20	컴파일 에러	0 ms	0 KiB

bitaro

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>

// #define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));

const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;

void solve(){
    int n, m, q; cin >> n >> m >> q; int sq = sqrt(n);
    vector <int> adj[n + 1], radj[n + 1];
    for (int i = 1; i <= m; i++) {
        int u, v; cin >> u >> v;
        adj[u].emb(v);
        radj[v].emb(u);
    }
    vector <pii> dp[n + 1];
    vector <int> visited(n + 1);
    for (int u = 1; u <= n; u++) {
        vector <pii> cur;
        for (auto v : radj[u]) {
            cur.emb(1, v);
            for (auto [dis, node] : dp[v]) {
                cur.emb(dis + 1, node);
            }
        }
        sort(rall(cur));
        for (auto [dis, node] : cur) {
            if (visited[node] == u) continue;
            visited[node] = u;
            dp[u].emplace(dis, node);
            if (dp[u].size() == sq) break;
        }
    }
    vector <int> cant(n + 1, inf);
    int cnt = 0;
    while (q--) {
        int st, y; cin >> st >> y;
        // cout << ++cnt << " : ";
        for (int i = 1; i <= y; i++) {
            int x; cin >> x;
            cant[x] = q;
        }
        if (y <= sq) {
            int ans = (cant[st] == q ? -1 : 0);
            for (auto [dis, node] : dp[st]) {
                if (cant[node] == q) continue;
                ans = max(ans, dis);
            }
            // cout << "SQ : ";
            cout << ans << "\n";
        }
        else {
            vector <int> mx(n + 1, -inf);
            for (int u = 1; u <= st; u++) {
                if (cant[u] != q) mx[u] = 0;
                for (auto v : radj[u]) {
                    mx[u] = max(mx[u], mx[v] + 1);
                }
            }
            cout << (mx[st] < 0 ? -1ll : mx[st]) << "\n";
        }
    }
}

int32_t main(){
    iShowSpeed;
    // int q; cin >> q; while (q--) 
    solve();
}

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

bitaro.cpp:24:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   24 | const int inf = 1e18;
      |                 ^~~~
bitaro.cpp: In function 'void solve()':
bitaro.cpp:50:26: error: no matching function for call to 'std::vector<std::pair<int, int> >::emplace(std::tuple_element<0, std::pair<int, int> >::type&, std::tuple_element<1, std::pair<int, int> >::type&)'
   50 |             dp[u].emplace(dis, node);
      |             ~~~~~~~~~~~~~^~~~~~~~~~~
In file included from /usr/include/c++/13/vector:66,
                 from /usr/include/c++/13/functional:64,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53,
                 from bitaro.cpp:1:
/usr/include/c++/13/bits/stl_vector.h:1346:9: note: candidate: 'template<class ... _Args> constexpr std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::emplace(const_iterator, _Args&& ...) [with _Args = {_Args ...}; _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >]'
 1346 |         emplace(const_iterator __position, _Args&&... __args)
      |         ^~~~~~~
/usr/include/c++/13/bits/stl_vector.h:1346:9: note:   template argument deduction/substitution failed:
bitaro.cpp:50:27: note:   cannot convert 'dis' (type 'std::tuple_element<0, std::pair<int, int> >::type' {aka 'int'}) to type 'std::vector<std::pair<int, int> >::const_iterator'
   50 |             dp[u].emplace(dis, node);
      |                           ^~~