제출 #1174059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1174059		nuutsnoynton	Ronald (COCI17_ronald)	C++20	0 / 120	67 ms	8264 KiB

ronald

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const ll N = 1e3 + 2;
ll a[N][N], c[N];
int main() {
	ll n, m, can, r, x, y, i, j, ans, t;

	cin >> n >> m;
	
	for (i = 1; i <= m; i++) {
		cin >> x >> y;
		a[x][y] = a[y][x] = 1;
	}
	c[1] = 1;
	for (i = 2; i <= n; i++) {
		if ( a[1][i] == 1) {
			c[i] = 0;
		}
		else {
			c[i] = 1;
		}
	}
	can = 1;
	for (i = 1; i <= n; i ++) {
		for (j = i + 1; j <= n; j ++) {
			if ( a[i][j] == 1) {
				if ( c[i] + c[j] != 1) {
					can =0 ;
				}
			}
			else {
				if ( c[i] + c[j] == 1) can = 0;
			}
		}
	}
	if ( can == 1) {
		cout << "DA" << endl;
		return 0;
	}
	for (i = 1; i <= n; i ++) c[i] ^= 1;
	can = 1;
	for (i = 1; i <= n; i ++) {
		for (j = i + 1; j <= n; j ++) {
			if ( a[i][j] == 1) {
				if ( c[i] + c[j] != 1) {
					can =0 ;
				}
			}
			else {
				if ( c[i] + c[j] == 1) can = 0;
			}
		}
	}
	if ( can == 1) {
		cout << "DA" << endl;
		return 0;
	}
	cout <<"NE" << endl;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15
• Subtask 7: 0 / 15
• Subtask 8: 0 / 15