Submission #66213596

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 <stdio.h>
int ec[212345], es[212345][2];
int main(void) {
  int N, M;
  int i;
  int cur, prev, count;
  if (scanf("%d%d", &N, &M) != 2) return 1;
  if (N != M) {
    puts("No");
    return 0;
  }
  for (i = 0; i < M; i++) {
    int A, B;
    if (scanf("%d%d", &A, &B) != 2) return 1;
    if (A == B || ec[A] >= 2 || ec[B] >= 2) {
      puts("No");
      return 0;
    }
    es[A][ec[A]++] = B;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int ec[212345], es[212345][2];

int main(void) {
	int N, M;
	int i;
	int cur, prev, count;
	if (scanf("%d%d", &N, &M) != 2) return 1;
	if (N != M) {
		puts("No");
		return 0;
	}
	for (i = 0; i < M; i++) {
		int A, B;
		if (scanf("%d%d", &A, &B) != 2) return 1;
		if (A == B || ec[A] >= 2 || ec[B] >= 2) {
			puts("No");
			return 0;
		}
		es[A][ec[A]++] = B;
		es[B][ec[B]++] = A;
	}
	cur = 1;
	prev = -1;
	count = 1;
	for (;;) {
		int next = es[cur][es[cur][0] == prev];
		if (next == 1) break;
		prev = cur;
		cur = next;
		count++;
	}
	puts(count == N ? "Yes" : "No");
	return 0;
}

Submission Info

Judge Result