Submission #1281486
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int main() { int N, M; cin >> N >> M; int a[M], b[M]; for (int i = 0; i < M; i++) { cin >> a[i] >> b[i]; } int c[N]; for (int i = 0; i < M; i++) c[i] = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { if (a[j] == i+1 || b[j] == i+1) c[i]++; } } for (int i = 0; i < N; i++) { cout << c[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Counting Roads |
User | iwakiriK |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 471 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | WA | 1 ms | 256 KB |
subtask_1_2.txt | WA | 1 ms | 256 KB |
subtask_1_3.txt | WA | 1 ms | 256 KB |
subtask_1_4.txt | WA | 1 ms | 256 KB |
subtask_1_5.txt | AC | 1 ms | 256 KB |
subtask_1_6.txt | WA | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |