1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
| #include <iostream>
#include <cmath>
#include <set>
#include <iomanip>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <utility>
#include <cctype>
#include <map>
#include <algorithm>
#include <iterator>
#include <climits>
#include <unistd.h>
#include <functional>
#define p_b push_back
#define matrix_t(TYPE) vector< vector< TYPE > >
#define matrix(TYPE,NAME,N,M) vector< vector< TYPE > > NAME(N, vector< TYPE >(M));
#define matrix_init(TYPE,NAME,N,M,INIT) vector< vector< TYPE > > NAME(N, vector< TYPE >(M,INIT));
#define loop(_S,_PAR,_N) for(ll _PAR = _S;_PAR<_N;++_PAR)
#define deloop(_S,_PAR,_N) for(ll _PAR = _S;_PAR>_N;--_PAR)
#define cin_vec(_V) for(ll _i = 0;_i < _V.size();++_i) cin >> _V[_i];
#define cin_mat(_M) for(ll _i = 0;_i < _M.size();++_i) for(ll _j = 0;_j < _M[_i].size();++_j) cin >> _M[_i][_j];
#define cout_vec(_V) for(ll _i = 0;_i < _V.size();++_i) cout << _V[_i] << ' ';
#define set_accur(_A) cout << fixed << setprecision(_A);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned char uchar;
const long double pi = 3.14159265358979323846;
const long double eps = 1e-12;
const ll mod = 1e9 + 7;
const int inf = INT_MAX;
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
int n, d, a;
cin >> n >> d >> a;
matrix(char, g, n, n);
cin_mat(g);
matrix(int, gr, n, n);
matrix_init(char, ans, n, n, '0');
int cnt=0;
loop(0,i,n) {
loop(0,j,n) {
g[i][j] -= '0';
if(g[i][j]) {
gr[i][j] = 0;
++cnt;
}
else gr[i][j] = a;
}
}
cnt >>= 1;
ll res=0;
/* //метод за n*n
vector<bool> used(n,0);
vector<int> min_e (n, inf), sel_e (n, -1);
min_e[0] = 0;
loop(0,i,n) {
int v = -1;
loop(0,j,n) {
if (!used[j] && (v == -1 || min_e[j] < min_e[v])) {
v = j;
}
}
if (min_e[v] == inf) {
cout << "No MST!\n";
return 0;
}
used[v] = 1;
if (sel_e[v] != -1) {
if(!g[v][sel_e[v]]) {
ans[v][sel_e[v]] = 'a';
ans[sel_e[v]][v] = 'a';
res += a;
}
else {
--cnt;
ans[v][sel_e[v]] = 'z';
ans[sel_e[v]][v] = 'z';
}
}
loop(0,to,n) {
if (gr[v][to] < min_e[to]) {
min_e[to] = gr[v][to];
sel_e[to] = v;
}
}
}
*/
//метод за m*log(n)
vector<vector< pair<int,int> > > gl(n, vector< pair<int,int> >(0));
loop(0,i,n) {
loop(0,j,n) {
if (g[i][j]) gl[i].p_b(make_pair(j,0));
else gl[i].p_b(make_pair(j,a));
}
}
vector<int> min_e(n, inf), sel_e(n, -1);
min_e[0] = 0;
set < pair<int,int> > q;
q.insert (make_pair (0, 0));
loop(0,i,n) {
if (q.empty()) {
cout << "No MST!";
return 0;
}
int v = q.begin()->second;
q.erase(q.begin());
if (sel_e[v] != -1) {
cout << v << " " << sel_e[v] << endl;
if(!g[v][sel_e[v]]) {
ans[v][sel_e[v]] = 'a';
ans[sel_e[v]][v] = 'a';
res += a;
}
else {
--cnt;
ans[v][sel_e[v]] = 'z';
ans[sel_e[v]][v] = 'z';
}
}
loop(0,j,gl[v].size()) {
int to = gl[v][j].first, cost = gl[v][j].second;
if (cost < min_e[to]) {
q.erase (make_pair (min_e[to], to));
min_e[to] = cost;
sel_e[to] = v;
q.insert (make_pair (min_e[to], to));
}
}
}
cout << res + 1LL * cnt * d << '\n';
loop(0,i,n) {
loop(0,j,n) {
if (ans[i][j] == 'z') cout << '0';
else if (g[i][j] && ans[i][j] == '0') cout << 'd';
else if (ans[i][j] == 'a') cout << 'a';
else cout << '0';
}
cout << '\n';
}
return 0;
} |
. 
(
