Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main() {
- int n;
- cin >> n;
- vector<vector<int>> m(n, vector<int>(n));
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < n; ++j) {
- cin >> m[i][j];
- }
- }
- int best = 0;
- int best_mask = 0;
- for (int mask = 0; mask < (1 << n); ++mask) {
- int res = 0;
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < i; ++j) {
- if (static_cast<bool>(mask & (1 << i)) != static_cast<bool>(mask & (1 << j))) {
- res += m[i][j];
- }
- }
- }
- if (res > best) {
- best = res;
- best_mask = mask;
- }
- }
- cout << best << "\n";
- for (int i = 0; i < n; ++i) {
- if (best_mask & (1 << i)) {
- cout << "2 ";
- } else {
- cout << "1 ";
- }
- }
- cout << "\n";
- }
Add Comment
Please, Sign In to add comment