# 算法

**Repository Path**: hellower114514/algorithm

## Basic Information

- **Project Name**: 算法
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2025-02-18
- **Last Updated**: 2025-02-18

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 算法


#include <bits/stdc++.h>
using namespace std;

struct node{
	int level = 0;
	int id;
	int ci, ui;
	vector<pair<int>> next;
} net[1005];

vector<node> mid, output;

int main(){
	int n, p;
	cin >> n >> p;
	
	for(int i = 0; i<n; i++){
		cin >> net[i].ci >> net[i].ui;
		net[i].is_input_level = net[i].ci;
	}
	
	for(int i = 0; i<p; i++){
		int a, b, w;
		cin >> a >> b >> w;
		net[a].next.push_back(make_pair(b, w));
	}
	
	for(int i = 0; i<n; i++){
		if(!net[i].is_input_level){
			mid.push_back(net[i]);
		} if(net[i].next.size() == 0){
			output.push_back(net[i]);
		}
	}
	
	
	return 0;
}