SPOJ 1846 — Project File Dependencies (code: PFDEP)
题意见下:
Killa.sqybi 20:01:20就是说Killa.sqybi 20:01:21有n个任务Killa.sqybi 20:01:24m个限制条件Killa.sqybi 20:01:37每个限制条件都这样描述:t0 k t1 t2 .. tkKilla.sqybi 20:01:46表示t0的完成需要他Killa.sqybi 20:01:52需要t1..tk的完成Killa.sqybi 20:02:03让你输出一个完成序列Killa.sqybi 20:02:12保证靠前的数越小越好Killa.sqybi 20:02:16没了
就这样…建立个有向图随便写个n^2的topsort就AC了.注意如果当前有多个点入度为0,那么选择编号最小的.
{ SPOJ 1846; Project File Dependencies; PFDEP - sqybi’s code - Topsort}//for my winstyprogram pfdep_sqybi; const nn = 100;
var n, m, i, j, k, x, y, t: longint; ind: array[1..nn]of longint; d: array[1..nn, 1..nn]of boolean;
begin readln(n, m); […]