oj.uz

답안 #556047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556047 2022-05-02T09:01:05 Z fuad27 Graph (BOI20_graph) C++17
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
struct edge {
	int u=0, v=0, type=0;
};
const int MAXN = 6, MAXM = 15;
int n, m;
vector<edge> e(MAXM);
vector<int> curr(MAXN);
vector<pair<long long, vector<int>>> answers; 
bool brute(int in, long long sum) {
	if(in == n) {
		for(int i = 0;i<m;i++) {
			if(curr[e[i].u] + curr[e[i].v] != 2*e[i].type)return false;
		}
		answers.push_back(make_pair(sum, curr));
		return true;
	}
	else {
		bool check = false;
		for(int i = -4;i<=4;i++) {
			curr[in] = i;
			check|=brute(in+1, sum+i);
		}
		return check;
	}
}
int main () {
	cin >> n >> m;
	for(int i = 0;i<m;i++) {
		cin >> e[i].u >> e[i].v >> e[i].type;
		e[i].u--, e[i].v--;
	}
	if(n <= 5 and m<=14) {
		if(!brute(0, 0))cout << "NO\n";
		else {
			sort(answers.begin(), answers.end());
			cout << "YES\n";
			for(int i = 0;i<n;i++) {
				cout << 0.5*answers[0].second[i] << " ";
			}
			cout << "\n";
		}	
	}
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Incorrect 0 ms 212 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Incorrect 0 ms 212 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Incorrect 0 ms 212 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Incorrect 0 ms 212 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB answer = YES
2 Incorrect 0 ms 212 KB participant answer is larger than the answer of jury
3 Halted 0 ms 0 KB -