Submission #62800213

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n,m,cnt,ans,lst;
bool vis[N];
priority_queue<int,vector<int>,greater<int>> q[N];
int main(){
  cin>>n>>m;
  for(int i=1;i<=m;i++){
    int u,v;
    cin>>u>>v;
    if(u==v) ans++;
    else{
      q[u].push(v);
      q[v].push(u);
    }
  }
  for(int i=1;i<=n;i++){
    lst=0;
    while(!q[i].empty()){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n,m,cnt,ans,lst;
bool vis[N];
priority_queue<int,vector<int>,greater<int>> q[N];
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v;
		cin>>u>>v;
		if(u==v) ans++;
		else{
			q[u].push(v);
			q[v].push(u);
		}
	}
	for(int i=1;i<=n;i++){
		lst=0;
		while(!q[i].empty()){
			int now=q[i].top();q[i].pop();
			if(now==lst) cnt++;
			else lst=now;
		}
	}
	cout<<ans+cnt/2;
	return 0;
}

Submission Info

Judge Result