제출 #1349640

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

bitaro

#include <bits/stdc++.h>
#define endl '\n'

#pragma GCC optimize("O3" , "Ofast" , "unroll-loops")
#pragma GCC target("avx2")


const int MAXN = 1e5;
const int block = 120;

int n, m, q, x, y, dp[MAXN + 5], mx[MAXN + 5];
std::vector<std::pair<int,int>>vals[MAXN + 5];
std::vector<int>v[MAXN + 5], v1[MAXN + 5];
bool used[MAXN + 5], is[MAXN + 5], canR[MAXN + 5], vis[MAXN + 5];

inline void dfss(int node)
{
    used[node] = true;

    for(auto i: v[node])
    {
        if(!used[i])dfss(i);
        if(canR[i])
        {
            canR[node] = true;
            dp[node] = std::max(dp[node], dp[i] + 1);
        }
    }
}

inline void solve1()
{
    for(int i = 1; i <= n; i++)
    {
        used[i] = false;
        is[i] = false;
        dp[i] = 0;
        canR[i] = false;
    }
    for(int i = 1; i <= y; i++)
    {
        int a; std::cin >> a;
        is[a] = true;
    }

    canR[x] = true;

    for(int i = 1; i <= n; i++)
    {
        if(!used[i] && i != x)
        {
            dfss(i);
        }
    }

    int ans = -1;
    for(int i = 1; i <= n; i++)
    {
        if(canR[i] && !is[i])
        {
            ans = std::max(ans, dp[i]);
        }
    }
    std::cout << ans << endl;
}
inline void dfs(int node)
{
    vis[node] = true;
    std::vector<int>ve;
    ve.push_back(node);
    mx[node] = 0;

    for(auto i: v1[node])
    {
        if(!vis[i])
            dfs(i);

        for(auto j: vals[i])
        {
            ve.push_back(j.second);
            mx[j.second] = std::max(mx[j.second], j.first + 1);
        }

    }

    std::sort(ve.begin(), ve.end());

    vals[node].push_back({mx[ve[0]], ve[0]});
    mx[ve[0]] = -1;

    for(int i = 1; i < ve.size(); i++)
    {
        if(ve[i] != ve[i - 1])
        {
            vals[node].push_back({mx[ve[i]], ve[i]});
            mx[ve[i]] = -1;
        }
    }

    std::sort(vals[node].rbegin(), vals[node].rend());
    while(vals[node].size() > block)vals[node].pop_back();
}

inline void solve2()
{
    for(int i = 1; i <= n; i++)
        is[i] = false;

    for(int i = 1; i <= y; i++)
    {
        int a; std::cin >> a;
        is[a] = true;
    }

    int ptr = 0;
    while(ptr < vals[x].size() && is[vals[x][ptr].second])ptr++;

    if(ptr == vals[x].size())std::cout << -1 << endl;
    else std::cout << vals[x][ptr].first << endl;
}

signed main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin >> n >> m >> q;
    for(int i = 1; i <= m; i++)
    {
        int x, y; cin >> x >> y;
        v[x].push_back(y);
        v1[y].push_back(x);
    }

    for(int i = 1; i <= n; i++)
        if(vals[i].empty())dfs(i);

    while(q--)
    {
        std::cin >> x >> y;

        if(y >= block)
            solve1();
        else
            solve2();
    }

    return 0;
}

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

bitaro.cpp: In function 'int main()':
bitaro.cpp:130:19: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
  130 |         int x, y; cin >> x >> y;
      |                   ^~~
      |                   std::cin
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:146,
                 from bitaro.cpp:1:
/usr/include/c++/13/iostream:62:18: note: 'std::cin' declared here
   62 |   extern istream cin;           ///< Linked to standard input
      |                  ^~~