oj.uz

Submission #88914

# Submission time Handle Problem Language Result Execution time Memory
88914 2018-12-09T19:30:33 Z jasony123123 Ronald (COCI17_ronald) C++11
120 / 120
 55 ms 9316 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R5 P4 *************************/
int N, org[1000][1000], node[1000];

bool test(int col) {
	// assign
	node[0] = col;
	FOR(i, 1, N)
		node[i] = (3 - node[0] - org[0][i]) % 2;
	// check
	FOR(i, 0, N) FOR(j, i + 1, N) {
		int parity = (node[i] + node[j] + org[i][j]) % 2;
		if (!parity)
			return 0;
	}
	return 1;
}

int main() {
	io();
	cin >> N;
	int M;
	cin >> M;
	FOR(i, 0, M) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		org[a][b] = 1;
		org[b][a] = 1;
	}
	cout << (test(0) || test(1) ? "DA" : "NE") << "\n";
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 636 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 2 ms 676 KB Output is correct
4 Correct 2 ms 696 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 700 KB Output is correct
2 Correct 2 ms 704 KB Output is correct
3 Correct 2 ms 720 KB Output is correct
4 Correct 2 ms 724 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 728 KB Output is correct
4 Correct 2 ms 764 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 764 KB Output is correct
2 Correct 3 ms 764 KB Output is correct
3 Correct 2 ms 876 KB Output is correct
4 Correct 2 ms 880 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1012 KB Output is correct
2 Correct 2 ms 1020 KB Output is correct
3 Correct 3 ms 1172 KB Output is correct
4 Correct 2 ms 1204 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1600 KB Output is correct
2 Correct 13 ms 3352 KB Output is correct
3 Correct 7 ms 3352 KB Output is correct
4 Correct 5 ms 3352 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3352 KB Output is correct
2 Correct 13 ms 4060 KB Output is correct
3 Correct 43 ms 7156 KB Output is correct
4 Correct 55 ms 9316 KB Output is correct