oj.uz

답안 #228662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228662 2020-05-02T09:49:57 Z Cantfindme Ronald (COCI17_ronald) C++17
120 / 120
 55 ms 10232 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 1010;

int n,e;
int edge[maxn][maxn];

int flip[maxn];

int32_t main() {
	FAST
	cin >> n >> e;
	for (int i =0;i<e;i++) {
		int a,b; cin >> a >> b;
		edge[a][b] = edge[b][a] = 1;
	}
	
	for (int i =2; i<= n;i++) {
		if (!edge[1][i]) flip[i] = 1;
	}
	
	bool fail = false;
	
	for (int a = 1; a<= n;a++) {
		for (int b = 1; b <= n; b++) {
			if (a == b) continue;
			//cout << "a:" <<  a << " b:" << b << "\n";
			//cout << flip[a] << " " << flip[b] << " " << edge[a][b] << "\n";
			
			if (flip[a] and !flip[b] and edge[a][b]) fail = true;
			if (flip[b] and !flip[a] and edge[a][b]) fail = true;
			if (!flip[a] and !flip[b] and !edge[a][b]) fail = true;
			//cout << fail << "\n";
		}
	}
	
	
	memset(flip,0,sizeof flip);
	flip[1] = 1;
	for (int i =2; i<= n;i++) {
		if (edge[1][i]) flip[i] = 1;
	}
	
	for (int a = 1; a<= n;a++) {
		for (int b = 1; b <= n; b++) {
			if (a == b) continue;
			if (flip[a] and !flip[b] and edge[a][b]) fail = true;
			if (flip[b] and !flip[a] and edge[a][b]) fail = true;
			if (!flip[a] and !flip[b] and !edge[a][b]) fail = true;
		}
	}
	
	if (fail) cout << "NE";
	else cout << "DA";
	
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 640 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 5 ms 896 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1536 KB Output is correct
2 Correct 18 ms 4736 KB Output is correct
3 Correct 11 ms 2432 KB Output is correct
4 Correct 8 ms 2432 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1536 KB Output is correct
2 Correct 13 ms 4608 KB Output is correct
3 Correct 39 ms 9472 KB Output is correct
4 Correct 55 ms 10232 KB Output is correct