제출 #1016990

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1016990		Pekiban	Bitaro’s Party (JOI18_bitaro)	C++17	0 / 100	3 ms	860 KiB

bitaro

#include <bits/stdc++.h>

using namespace std;

const int K = 400, mxN = 1e5+2;

bool vis[mxN];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m, q;
    cin >> n >> m >> q;
    vector<int> fw[n+1], bc[n+1];
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        fw[u].push_back(v), bc[v].push_back(u);
    }
    for (int i = 1; i <= n; ++i)    sort(fw[i].begin(), fw[i].end());
    vector<array<int, 2>> a[n+1];
    for (int i = 1; i <= n; ++i) {
        priority_queue<array<int, 3>> pq;
        for (auto x : bc[i]) {
            pq.push({a[x][0][0], x, 0});
        }
        while (a[i].size() < K && !pq.empty()) {
            auto [d, id, c] = pq.top();
            pq.pop();
            if (!vis[a[id][c][1]]) a[i].push_back({d+1, a[id][c][1]});
            vis[a[id][c][1]] = 1;
            if (c+1 != a[id].size())  pq.push({a[id][c+1][0], id, c+1});
        }
        for (auto x : a[i])    vis[x[1]] = 0;
        if (a[i].size() < K)    a[i].push_back({0, i});
    }
    int di[n+1];
    while (q--) {
        int t, y;
        cin >> t >> y;
        vector<int> v(y);
        for (int i = 0; i < y; ++i) {
            cin >> v[i];
            vis[v[i]] = 1;
        }
        int ans = -1;
        if (y < K) {
            for (auto [d, i] : a[t]) {
                if (!vis[i]) {
                    ans = d;
                    break;
                }
            }
        }
        else {
            for (int i = t; i >= 1; --i) {
                di[i] = 0;
                for (auto u : fw[i]) {
                    if (u > t)  break;
                    di[i] = max(di[u] + 1, di[i]);
                }
                if (!vis[i])    ans = max(ans, di[i]);
            }    
        }
        for (int i = 0; i < y; ++i) {
            vis[v[i]] = 0;
        }
        cout << ans << '\n';
    }
}

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

bitaro.cpp: In function 'int main()':
bitaro.cpp:31:21: warning: comparison of integer expressions of different signedness: 'std::tuple_element<2, std::array<int, 3> >::type' {aka 'int'} and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             if (c+1 != a[id].size())  pq.push({a[id][c+1][0], id, c+1});
      |                 ~~~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 86