Submission #2213809
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main() { int n,m; cin >> n >> m; int array[m][2]; int i,j; for (i=0;i<m;i++) { cin >> array[i][0] >> array[i][1]; } for (i=1;i<=n;i++) { int number=0; for (j=0;j<m;j++) { if (array[j][0]==i || array[j][1]==i) number++; } cout << number << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Counting Roads |
User | amar_kumar |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 371 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 256 KB |
subtask_1_2.txt | AC | 1 ms | 256 KB |
subtask_1_3.txt | AC | 1 ms | 256 KB |
subtask_1_4.txt | AC | 1 ms | 256 KB |
subtask_1_5.txt | AC | 1 ms | 256 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |