提出 #73529840

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll n,m;
vector<ll> v[300030];
ll chk[300030],sum[300030];
vector<ll> order;

void dijkstra()
{
    priority_queue<ll,vector<ll>,greater<ll>> pq;
    chk[1]=1;
    pq.push(1);
    while (!pq.empty())
    {
        ll top=pq.top(); pq.pop();
        order.push_back(top);
        for (auto x : v[top])
        {
            if (chk[x]==0)
            {
                chk[x]=1;
                pq.push(x);
            }
        }
    }
}

int main()
{
    cin>>n>>m;
    set<array<ll,2>> st;
    for (ll i=1;i<=m;i++)
    {
        ll x,y;
        cin>>x>>y;
        if (x==y||st.find({x,y})!=st.end()) continue;
        v[x].push_back(y);
        st.insert({x,y});
    }
    order.push_back(0);
    dijkstra();
    ll siz=order.size()-1;
    for (ll i=1;i<=siz;i++)
    {
        sum[i]=max(sum[i-1],order[i]);
    }
    set<ll> s;
    for (ll i=1;i<=siz;i++)
    {
        if (s.find(i)!=s.end()) s.erase(i);
        for (auto x : v[i])
        {
            if (x>i) s.insert(x);
        }
        if (sum[i]!=i) cout<<"-1\n";
        else
        {
            cout<<s.size()<<"\n";
        }
    }
    for (ll i=siz+1;i<=n;i++) cout<<"-1\n";
}

提出情報

ジャッジ結果