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
181
182
183
184
185
186
187
188
189
190
191
192
#include "message.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <vector>
#include <cstdio>
#include <array>
#include <deque>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
namespace {
	using namespace std;

	typedef vector<int> vint;
	typedef long long unsigned ulo;
	typedef long long lint;
	
	void __attribute__((unused)) spacje(int k) {
		int magic;
		static stack<int*> stos;
		while (!stos.empty() && stos.top() <= &magic) stos.pop();
		stos.push(&magic);
		for (int n = k * stos.size(); n--;) fprintf(stderr, " ");
	}
	
	#define BOTH(x) for (int x = 0; x < 2; ++x)
	
	#define UPlt(xx, yy) (xx) = min(xx, yy)
	#define UPgt(xx, yy) (xx) = max(xx, yy)
	
	struct in_t {
		template<class T>
		operator T () {
			static bool __attribute__((unused)) dummy = ios_base::sync_with_stdio(false);
			T x;
			cin >> x;
			return x;
		}
	};
	in_t __attribute__((unused)) in;
	
	class Print {
		ostream & os;
		bool nfirst;
	 public:
		Print(ostream & os = cout) : os(os), nfirst(false) {}
		~Print() { os << endl; }
		template<class T> Print & operator , (T const& e) {
			if (nfirst) os << " "; os << e; nfirst = true; return *this; }
	};
	
	#define print Print{cout},
	#define prerr Print{cerr},
	
	template <class T>
	struct Range {
		struct Intit {
			T x; Intit(T x) : x(x) {}
			T & operator * () { return x; };
			bool operator != (Intit other) { return x < other.x; }
			void operator ++ () { ++x; }
		};
		
		T b, e;
		explicit Range(T n) : b(0), e(n) {}
		Range(T b, T e) : b(b), e(e) {}
		Intit begin() { return b; }
		Intit end() { return e; }
	};
	
	template <class T>
	Range<T> range(T n) { return Range<T>(n); }
	
	template <class T>
	Range<T> range(T b, T e) { return Range<T>(b, e); }

	template <class T>
	Range<T> inclusive(T b, T e) { return Range<T>(b, e + 1); }
	
	#define _ __attribute__((unused)) _
};

#define dprintf(...) if (1) spacje(2), fprintf(stderr, __VA_ARGS__)

const int inf = 123123123;

struct Wyn {
	int odl;
	int szoki;
	
	Wyn & operator += (Wyn const& w) { odl += w.odl, szoki += w.szoki; return *this; }
	Wyn operator + (Wyn const& w) const { return Wyn(*this) += w; }
	
	bool operator < (Wyn const& w) const { return tie(odl, szoki) < tie(w.odl, w.szoki); }
};

int main() {
	int nodes = NumberOfNodes();
	int mynode = MyNodeId();
	bool pierwszy = mynode == 0;
	
	int n = in;
	int m = in;
	string pierwsze = in;
	string drugie = in;
	
	int width = n / nodes;
	if (width * nodes < n) ++width;
	int pstart = width * mynode;
	
	if (pstart >= n) return 0;
	bool ostatni = false;
	if (pstart + width >= n) {
		ostatni = true;
		width = n - pstart;
	}
	
	string moje = pierwsze.substr(pstart, width);
	int drugoff = 0;
	int height = m / 1000 + 1;
	
	vector<Wyn> v;
	for (int i : inclusive(0, width)) {
		v.push_back({pstart + i, 0});
	}
	
	// ~ prerr "moje słowo:", moje;
	
	while (true) {
		// ~ print drugoff, "/", m;
		if (drugoff + height > m) height = m - drugoff;
		
		if (drugoff == m) {
			if (ostatni) {
				print v.back().odl, v.back().szoki;
			}
			break;
		}
		
		vector<Wyn> lewo;
		if (!pierwszy) {
			Receive(mynode - 1);
			for (int _ : range(height)) {
				int odl = GetInt(mynode - 1);
				int szoki = GetInt(mynode - 1);
				lewo.push_back({odl, szoki});
			}
		} else {
			for (int i : range(height)) {
				lewo.push_back({drugoff + i + 1, 0});
			}
		}
		
		vector<Wyn> prawo;
		
		for (int dh : range(height)) {
			Wyn skos = v[0];
			v[0] = lewo[dh];
			char z = drugie[drugoff + dh];
			for (int i : inclusive(1, width)) {
				char c = moje[i-1];
				Wyn gora = v[i];
				
				Wyn zlewa = v[i-1] + Wyn{1, 0};
				Wyn zgory = gora + Wyn{1, 0};
				Wyn zukosa = skos + (c == z ? Wyn{0, 0} : Wyn{1, c<z});
				
				v[i] = min({zlewa, zgory, zukosa});
				
				// ~ prerr drugoff + dh, pstart + i - 1, "=", v[i].odl, v[i].szoki;
				
				skos = gora;
			}
			prawo.push_back(v.back());
		}
		
		if (!ostatni) {
			for (Wyn w : prawo) {
				PutInt(mynode + 1, w.odl);
				PutInt(mynode + 1, w.szoki);
			}
			Send(mynode + 1);
		}
		
		drugoff += height;
	}
	
	return 0;
}