图的静态前向星表示中统计入度和出度

#include<iostream>
#include<vector>


using namespace std;


const int maxn = 1000 + 10;
int head[maxn];
int indegree[maxn], outdegree[maxn];
struct EdgeNode {
int to;
int w;
int next;
};
EdgeNode Edge[maxn];
int main() {
int m, n;
freopen("input.txt", "r", stdin);
cin >> n >> m;
memset(head, -1, sizeof(head));
for (int i = 0; i < m; i++) {
int t1, t2, w;
cin >> t1 >> t2 >> w;
Edge[i].to = t2;
Edge[i].w = w;
Edge[i].next = head[i];
head[t1] = i;
}



for (int i = 1; i <= n; i++) {
for (int j = head[i]; j != -1; j = Edge[j].next) {
indegree[Edge[j].to]++;
outdegree[i]++;
}
}


for (int i = 1; i <= n; i++)
{
cout << indegree[i] << " " << outdegree[i] << endl;
}


return 0;
}