제출 #982141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982141		blackslex	Bitaro’s Party (JOI18_bitaro)	C++17	14 / 100	1177 ms	417232 KiB

bitaro

#include<bits/stdc++.h>
 
using namespace std;
using pii = pair<int, int>;
using P = pair<pii, int>;
 
const int N = 1e5 + 5, K = 320;
int n, m, q, x, y, t, r, ptr[N], cdp[N];
vector<int> v[N], rev[N];
vector<pii> dp[N];
bool f[N], f2[N];
 
int main() {
    scanf("%d %d %d", &n, &m, &q);
    int k = K;
    while (m--) scanf("%d %d", &x, &y), v[x].emplace_back(y), rev[y].emplace_back(x);
    for (int i = 1; i <= n; i++) cdp[i] = -1e9;
    for (int i = 1; i <= n; i++) {
        priority_queue<P> pq;
        pq.emplace(pii(0, i), n + 1);
        for (auto &e: rev[i]) {
            auto [x, y] = dp[e][0];
            pq.emplace(pii(x + 1, y), e);
            ptr[e] = 1;
        }
        while (!pq.empty() && dp[i].size() <= k) {
            auto [x, y] = pq.top(); pq.pop();
            if (f2[x.second]) continue;
            dp[i].emplace_back(x); f2[x.second] = 1;
            while (ptr[y] < dp[y].size()) {
                auto [cx, cy] = dp[y][ptr[y]]; ptr[y]++;
                if (f2[cy]) continue;
                pq.emplace(pii(cx + 1, cy), y);
                break;
            }
        }
        for (auto &[x, y]: dp[i]) f2[y] = 0;
    }
    while (q--) {
        scanf("%d %d", &t, &r);
        vector<int> c(r);
        for (auto &e: c) scanf("%d", &e), f[e] = 1;
        int ans = -1;
        if (r < k) {
            for (auto &[x, y]: dp[t]) if (!f[y]) {ans = x; break;}
        } else {
            cdp[t] = 0;
            for (int i = t; i >= 1; i--) {
                for (auto &e: v[i]) cdp[i] = max(cdp[i], cdp[e] + 1);
                if (!f[i]) ans = max(ans, cdp[i]);
            }
            for (int i = t; i >= 1; i--) cdp[i] = -1e9;
        }
        printf("%d\n", ans);
        for (auto &e: c) f[e] = 0;
    }
}

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

bitaro.cpp: In function 'int main()':
bitaro.cpp:26:44: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |         while (!pq.empty() && dp[i].size() <= k) {
      |                               ~~~~~~~~~~~~~^~~~
bitaro.cpp:30:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |             while (ptr[y] < dp[y].size()) {
      |                    ~~~~~~~^~~~~~~~~~~~~~
bitaro.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d %d %d", &n, &m, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:16:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     while (m--) scanf("%d %d", &x, &y), v[x].emplace_back(y), rev[y].emplace_back(x);
      |                 ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         scanf("%d %d", &t, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:42:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         for (auto &e: c) scanf("%d", &e), f[e] = 1;
      |                          ~~~~~^~~~~~~~~~

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