제출 #1096690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096690		nguyenvu	Railway (BOI17_railway)	C++14	0 / 100	32 ms	28756 KiB

railway

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

#define ll long long
#define endl "\n"
#define F first
#define S second

const ll ool=1e18;
const int ooi=1e9;
const int MOD=1e9+7;
const int N=1e6;

int n,m,k;
bool ok[N+5];
ll cnt[N+5];

vector <int> a[N+5];

void dfs(int node)
{
    ok[node]=1;
    for (int i:a[node])
        if (!ok[i])
        {
            cnt[i]=cnt[node]+1;
            dfs(i);
        }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    

    cin>>n>>m>>k;
    for (int i=1;i<=n;i++)
    {
        int u,v; cin>>u>>v;
        a[u].push_back(v);
    }
    for (int i=1;i<=m;i++)
    {
        int x; cin>>x;
        for (int j=1;j<=x;j++) cin>>x;
    }
    cout<<0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 7
• Subtask 4: 0 / 29
• Subtask 5: 0 / 16
• Subtask 6: 0 / 25