一个set集合解决战斗!
满分代码实现
#include <set>
#include <iostream>
using namespace std;
class Solution {
public:
void solve();
};
void Solution::solve() {
int n = 0, m = 0;
cin >> n >> m;
int ans = 0;
set<int> _set;
_set.insert(0);
int left = 0, right = 0;
for (int i = 0; i < m; i++) {
cin >> left >> right;
if (!_set.count(right)) ans++;
_set.insert(left);
}
cout << ans << endl;
}
int main() {
// 提高cin,cout的速度
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
Solution solution;
solution.solve();
return 0;
}