Submission #956737

#	Time	Username	Problem	Language	Result	Execution time	Memory
956737		ono_de206	Bliskost (COI23_bliskost)	C++14	100 / 100	186 ms	37716 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;

void go() {
	int n, q;
	cin >> n >> q;
	vector<int> a(n), b(n), d(n);
	int sum = 0;
	for(int i = 0; i < n; i++) {
		char ch;
		cin >> ch;
		a[i] = ch - 'a';
		if(i & 1) sum += a[i];
		else sum -= a[i];
	}
	for(int i = 0; i < n; i++) {
		char ch;
		cin >> ch;
		b[i] = ch - 'a';
		if(i & 1) sum -= b[i];
		else sum += b[i];
	}
	auto print_ans = [&]() {
		if(sum % 26 == 0) cout << "da\n";
		else cout << "ne\n";
	};
	print_ans();
	while(q--) {
		int x;
		char ch;
		cin >> x >> ch;
		x--;
		int val = ch - 'a';
		if(x & 1) sum -= a[x];
		else sum += a[x];
		a[x] = val;
		if(x & 1) sum += a[x];
		else sum -= a[x];
		print_ans();
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 17 / 17
• Subtask 6: 43 / 43