Submission #2215639
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); int i, cnt = 0;; int[] a = new int[M]; int[] b = new int[M]; for(i = 0;i < M;i ++) { a[i] = sc.nextInt(); b[i] = sc.nextInt(); } for(i = 1;i <= N;i ++) { for(int k = 0;k < M;k ++) { if(i == a[k]) cnt++; if(i == b[k]) cnt++; } System.out.println(cnt); cnt = 0; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Counting Roads |
User | ne290179 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 497 Byte |
Status | AC |
Exec Time | 110 ms |
Memory | 21844 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 93 ms | 19796 KB |
sample_02.txt | AC | 94 ms | 18640 KB |
sample_03.txt | AC | 93 ms | 20820 KB |
subtask_1_1.txt | AC | 98 ms | 21844 KB |
subtask_1_2.txt | AC | 96 ms | 19668 KB |
subtask_1_3.txt | AC | 96 ms | 21844 KB |
subtask_1_4.txt | AC | 98 ms | 19412 KB |
subtask_1_5.txt | AC | 102 ms | 19924 KB |
subtask_1_6.txt | AC | 108 ms | 19284 KB |
subtask_1_7.txt | AC | 110 ms | 19924 KB |