Submission #4659279
Source Code Expand
import sys from collections import deque import copy import math def get_read_func(fileobject): if fileobject == None : return raw_input else: return fileobject.readline def bfs(path, start, visited_set): que = deque([start]) while 1: if len(que) == 0: break; nd = que.popleft() for adj in path[nd]: if adj not in visited_set: visited_set.add(adj) que.append(adj) def main(): if len(sys.argv) > 1: f = open(sys.argv[1]) else: f = None read_func = get_read_func(f); input_raw = read_func().strip().split() [N, M] = [int(input_raw[0]), int(input_raw[1])] path = {} ofset = 1000000 for i in range(N): path[i + ofset] = [] for i in range(N): input_raw = read_func().strip().split() K = int(input_raw[0]) for j in range(1, K + 1): path[i + ofset].append(int(input_raw[j])) if int(input_raw[j]) not in path: path[int(input_raw[j])] = [i + ofset] else: path[int(input_raw[j])].append(i + ofset) visited_set = set([]) bfs(path, ofset, visited_set) for i in range(N): if i + ofset not in visited_set: print "NO" return print "YES" if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | C - Interpretation |
User | YamagenSakam |
Language | PyPy2 (5.6.0) |
Score | 400 |
Code Size | 1433 Byte |
Status | AC |
Exec Time | 217 ms |
Memory | 66924 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 200 / 200 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
dataset1 | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt |
dataset2 | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 39 ms | 28780 KB |
01-02.txt | AC | 53 ms | 30956 KB |
01-03.txt | AC | 55 ms | 32364 KB |
01-04.txt | AC | 57 ms | 32364 KB |
01-05.txt | AC | 54 ms | 32364 KB |
01-06.txt | AC | 52 ms | 32364 KB |
01-07.txt | AC | 51 ms | 32364 KB |
01-08.txt | AC | 59 ms | 32412 KB |
01-09.txt | AC | 52 ms | 32492 KB |
01-10.txt | AC | 55 ms | 32364 KB |
02-01.txt | AC | 158 ms | 52636 KB |
02-02.txt | AC | 200 ms | 63396 KB |
02-03.txt | AC | 160 ms | 51404 KB |
02-04.txt | AC | 202 ms | 59504 KB |
02-05.txt | AC | 210 ms | 59804 KB |
02-06.txt | AC | 211 ms | 60656 KB |
02-07.txt | AC | 217 ms | 60068 KB |
02-08.txt | AC | 141 ms | 57124 KB |
02-09.txt | AC | 155 ms | 66084 KB |
02-10.txt | AC | 146 ms | 60360 KB |
02-11.txt | AC | 147 ms | 62808 KB |
02-12.txt | AC | 150 ms | 66796 KB |
02-13.txt | AC | 149 ms | 66924 KB |
sample-01.txt | AC | 35 ms | 27628 KB |
sample-02.txt | AC | 35 ms | 28012 KB |