Submission #1279075


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define INF 2000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;


int main()
{
	int n,m;
	cin >> n >> m;
	int ans[n];
	memset(ans, 0, sizeof(ans));
	for (int i = 0; i < m; i++) {
		int tmpa, tmpb;
		cin >> tmpa >> tmpb;
		tmpa--;
		tmpb--;
		ans[tmpa]++;
		ans[tmpb]++;
	}
	for (int i = 0; i < n; i++) {
		cout << ans[i] << "\n";
	}
}

Submission Info

Submission Time
Task B - Counting Roads
User nak3
Language C++14 (GCC 5.4.1)
Score 200
Code Size 441 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 10
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