Submission #1592999

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 10000000000000;
const double PI = acos(-1);

int main() {
	int N, M;
	cin >> N >> M;
	bool cl[100001] = {};
	for (int i = 0; i < M; i++) {
		int a, b;
		cin >> a >> b;
		--a, --b;
		cl[a] = !cl[a];
		cl[b] = !cl[b];
	}
	for (int i = 0; i < N; i++) {
		if (cl[i]) {
			cout << "NO" << endl;
			return 0;
		}
	}
	cout << "YES" << endl;
}

Submission Info

Judge Result