Submission #69077978

---

Source Code Expand

/* Code By WCm */
/*
Date:
大致思路：
复杂度：
期望得分：
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <vector>
#include <queue>
#define int long long

using namespace std;

inline int read();
void write(int);
void writeln(int);

const int N = 2e5 + 5;
int n, m, deg[N];

signed main() {

//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);

	n = read(), m = read();
	for(int i = 0; i < m; i++) {
		int u = read(), v = read();
		deg[u]++, deg[v]++;
	}
	
	int tar = (n - 1) & 1, cnt = 0;
	for(int i = 1; i <= n; i++) if((deg[i] & 1) != tar) cnt++;

	int ans = (n * (n - 1) >> 1) - (cnt >> 1);
	printf("%lld\n", ans);
	
//	printf("\nThe time used: ");
//	printf("%.2lfs",(double)clock()/CLOCKS_PER_SEC);

	return 0;

}

inline int read() {
	int res = 0, f = 1;
	char ch = getchar();
	while( !(ch >= '0' && ch <= '9') ) {
		if(ch == '-') f =  - 1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		res = (res << 1) + (res << 3) + (ch ^ 48);
		ch = getchar();
	}
	return res * f;
}

void write(int x) {
	static int sta[35];
	int top = 0;
	do {
		sta[top++] = x % 10;
		x /= 10;
	} while(x);
	while(top) putchar(sta[--top] ^ 48);
}

void writeln(int x) {
	write(x);
	putchar('\n');
}

Submission Info

Judge Result