답안 #1026505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1026505	2024-07-18T07:13:46 Z	vjudge1	Bliskost (COI23_bliskost)	C++17	15 / 100	26 ms	37612 KB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
#define _ << " " <<

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t;
int cev;
string s,ss;
vector<int> v;

inline int fark(int x,int y){
	if(x>y)return 26-x+y;
	return y-x;
}

inline char ekle(int x,int y){
	x+=y;
	if(x>'z')x-=26;
	return x;
}

struct segtree{
	array<int,li*4> tree;
	int md=0;
	segtree(int x){
		md=x;
	}
	inline void update(int node,int start,int end,int l,int r,int val){
		if(start>end || start>r || end<l)return ;
		if(start>=l && end<=r){if(md!=start%2)return ;tree[node]+=val;return ;}
		update(node*2,start,mid,l,r,val),update(node*2+1,mid+1,end,l,r,val);
		tree[node]=tree[node*2]+tree[node*2+1];
	}
	inline int query(int node,int start,int end,int l,int r){
		if(start>end || start>r || end<l)return 0;
		if(start>=l && end<=r)return tree[node];
		return query(node*2,start,mid,l,r)+query(node*2+1,mid+1,end,l,r);
	}
};

int32_t main(void){
	fio();
	cin>>n>>k;
	cin>>s>>ss;
	s="%"+s;
	ss="%"+ss;
	for(int i=1;i<=n-1;i++){
		int at=fark(s[i],ss[i]);
		a[i]=at;
		s[i]=ekle(s[i],at);
		s[i+1]=ekle(s[i+1],at);
	}
	if(s[n]==ss[n]){cout<<"da\n";}
	else cout<<"ne\n";
	segtree st1(1);
	segtree st2(0);
	while(k--){
		int i;char c;
		cin>>i>>c;
		int val=a[i-1]+st1.query(1,1,n,1,i-2)*(i%2?-1:1)+st2.query(1,1,n,1,i-2)*(i%2?1:-1)+26*100000000000;
		int val2=a[i]+st1.query(1,1,n,1,i-1)*(i%2?1:-1)+st2.query(1,1,n,1,i-1)*(i%2?-1:1)+26*100000000000;
		val%=26;val2%=26;
		c=ekle(c,val);
		int tut=fark(c,ss[i]);
		st1.update(1,1,n,i,i,tut-val2);
		st2.update(1,1,n,i,i,tut-val2);
		val=a[n-1]+st1.query(1,1,n,1,n-2)*(n%2?-1:1)+st2.query(1,1,n,1,n-2)*(n%2?1:-1)+26*100000000000;
		val%=26;
		if(val==a[n-1])cout<<"da\n";
		else cout<<"ne\n";
	}
	return 0;
}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31580 KB	Output is correct
2	Correct	18 ms	31596 KB	Output is correct
3	Correct	13 ms	31600 KB	Output is correct
4	Correct	15 ms	31580 KB	Output is correct
5	Correct	15 ms	31524 KB	Output is correct
6	Correct	16 ms	31576 KB	Output is correct
7	Correct	14 ms	31576 KB	Output is correct
8	Correct	18 ms	31576 KB	Output is correct
9	Correct	17 ms	31556 KB	Output is correct
10	Correct	16 ms	31580 KB	Output is correct
11	Correct	17 ms	31564 KB	Output is correct
12	Correct	16 ms	31580 KB	Output is correct
13	Correct	15 ms	31580 KB	Output is correct
14	Correct	16 ms	31692 KB	Output is correct
15	Correct	20 ms	31560 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31580 KB	Output is correct
2	Correct	18 ms	31596 KB	Output is correct
3	Correct	13 ms	31600 KB	Output is correct
4	Correct	15 ms	31580 KB	Output is correct
5	Correct	15 ms	31524 KB	Output is correct
6	Correct	16 ms	31576 KB	Output is correct
7	Correct	14 ms	31576 KB	Output is correct
8	Correct	18 ms	31576 KB	Output is correct
9	Correct	17 ms	31556 KB	Output is correct
10	Correct	16 ms	31580 KB	Output is correct
11	Correct	17 ms	31564 KB	Output is correct
12	Correct	16 ms	31580 KB	Output is correct
13	Correct	15 ms	31580 KB	Output is correct
14	Correct	16 ms	31692 KB	Output is correct
15	Correct	20 ms	31560 KB	Output is correct
16	Correct	15 ms	31580 KB	Output is correct
17	Correct	15 ms	31760 KB	Output is correct
18	Correct	14 ms	31580 KB	Output is correct
19	Correct	15 ms	31604 KB	Output is correct
20	Correct	14 ms	31576 KB	Output is correct
21	Correct	15 ms	31580 KB	Output is correct
22	Correct	21 ms	31580 KB	Output is correct
23	Correct	15 ms	31580 KB	Output is correct
24	Correct	14 ms	31580 KB	Output is correct
25	Correct	14 ms	31568 KB	Output is correct
26	Correct	14 ms	31576 KB	Output is correct
27	Correct	16 ms	31576 KB	Output is correct
28	Correct	15 ms	31580 KB	Output is correct
29	Correct	14 ms	31648 KB	Output is correct
30	Correct	16 ms	31580 KB	Output is correct

Subtask #3
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31580 KB	Output is correct
2	Correct	18 ms	31596 KB	Output is correct
3	Correct	13 ms	31600 KB	Output is correct
4	Correct	15 ms	31580 KB	Output is correct
5	Correct	15 ms	31524 KB	Output is correct
6	Correct	16 ms	31576 KB	Output is correct
7	Correct	14 ms	31576 KB	Output is correct
8	Correct	18 ms	31576 KB	Output is correct
9	Correct	17 ms	31556 KB	Output is correct
10	Correct	16 ms	31580 KB	Output is correct
11	Correct	17 ms	31564 KB	Output is correct
12	Correct	16 ms	31580 KB	Output is correct
13	Correct	15 ms	31580 KB	Output is correct
14	Correct	16 ms	31692 KB	Output is correct
15	Correct	20 ms	31560 KB	Output is correct
16	Correct	15 ms	31580 KB	Output is correct
17	Correct	15 ms	31760 KB	Output is correct
18	Correct	14 ms	31580 KB	Output is correct
19	Correct	15 ms	31604 KB	Output is correct
20	Correct	14 ms	31576 KB	Output is correct
21	Correct	15 ms	31580 KB	Output is correct
22	Correct	21 ms	31580 KB	Output is correct
23	Correct	15 ms	31580 KB	Output is correct
24	Correct	14 ms	31580 KB	Output is correct
25	Correct	14 ms	31568 KB	Output is correct
26	Correct	14 ms	31576 KB	Output is correct
27	Correct	16 ms	31576 KB	Output is correct
28	Correct	15 ms	31580 KB	Output is correct
29	Correct	14 ms	31648 KB	Output is correct
30	Correct	16 ms	31580 KB	Output is correct
31	Incorrect	22 ms	37612 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

Subtask #4
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31580 KB	Output is correct
2	Correct	18 ms	31596 KB	Output is correct
3	Correct	13 ms	31600 KB	Output is correct
4	Correct	15 ms	31580 KB	Output is correct
5	Correct	15 ms	31524 KB	Output is correct
6	Correct	16 ms	31576 KB	Output is correct
7	Correct	14 ms	31576 KB	Output is correct
8	Correct	18 ms	31576 KB	Output is correct
9	Correct	17 ms	31556 KB	Output is correct
10	Correct	16 ms	31580 KB	Output is correct
11	Correct	17 ms	31564 KB	Output is correct
12	Correct	16 ms	31580 KB	Output is correct
13	Correct	15 ms	31580 KB	Output is correct
14	Correct	16 ms	31692 KB	Output is correct
15	Correct	20 ms	31560 KB	Output is correct
16	Incorrect	26 ms	31836 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31580 KB	Output is correct
2	Correct	18 ms	31596 KB	Output is correct
3	Correct	13 ms	31600 KB	Output is correct
4	Correct	15 ms	31580 KB	Output is correct
5	Correct	15 ms	31524 KB	Output is correct
6	Correct	16 ms	31576 KB	Output is correct
7	Correct	14 ms	31576 KB	Output is correct
8	Correct	18 ms	31576 KB	Output is correct
9	Correct	17 ms	31556 KB	Output is correct
10	Correct	16 ms	31580 KB	Output is correct
11	Correct	17 ms	31564 KB	Output is correct
12	Correct	16 ms	31580 KB	Output is correct
13	Correct	15 ms	31580 KB	Output is correct
14	Correct	16 ms	31692 KB	Output is correct
15	Correct	20 ms	31560 KB	Output is correct
16	Correct	15 ms	31580 KB	Output is correct
17	Correct	15 ms	31760 KB	Output is correct
18	Correct	14 ms	31580 KB	Output is correct
19	Correct	15 ms	31604 KB	Output is correct
20	Correct	14 ms	31576 KB	Output is correct
21	Correct	15 ms	31580 KB	Output is correct
22	Correct	21 ms	31580 KB	Output is correct
23	Correct	15 ms	31580 KB	Output is correct
24	Correct	14 ms	31580 KB	Output is correct
25	Correct	14 ms	31568 KB	Output is correct
26	Correct	14 ms	31576 KB	Output is correct
27	Correct	16 ms	31576 KB	Output is correct
28	Correct	15 ms	31580 KB	Output is correct
29	Correct	14 ms	31648 KB	Output is correct
30	Correct	16 ms	31580 KB	Output is correct
31	Incorrect	26 ms	31836 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

Subtask #6
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31580 KB	Output is correct
2	Correct	18 ms	31596 KB	Output is correct
3	Correct	13 ms	31600 KB	Output is correct
4	Correct	15 ms	31580 KB	Output is correct
5	Correct	15 ms	31524 KB	Output is correct
6	Correct	16 ms	31576 KB	Output is correct
7	Correct	14 ms	31576 KB	Output is correct
8	Correct	18 ms	31576 KB	Output is correct
9	Correct	17 ms	31556 KB	Output is correct
10	Correct	16 ms	31580 KB	Output is correct
11	Correct	17 ms	31564 KB	Output is correct
12	Correct	16 ms	31580 KB	Output is correct
13	Correct	15 ms	31580 KB	Output is correct
14	Correct	16 ms	31692 KB	Output is correct
15	Correct	20 ms	31560 KB	Output is correct
16	Correct	15 ms	31580 KB	Output is correct
17	Correct	15 ms	31760 KB	Output is correct
18	Correct	14 ms	31580 KB	Output is correct
19	Correct	15 ms	31604 KB	Output is correct
20	Correct	14 ms	31576 KB	Output is correct
21	Correct	15 ms	31580 KB	Output is correct
22	Correct	21 ms	31580 KB	Output is correct
23	Correct	15 ms	31580 KB	Output is correct
24	Correct	14 ms	31580 KB	Output is correct
25	Correct	14 ms	31568 KB	Output is correct
26	Correct	14 ms	31576 KB	Output is correct
27	Correct	16 ms	31576 KB	Output is correct
28	Correct	15 ms	31580 KB	Output is correct
29	Correct	14 ms	31648 KB	Output is correct
30	Correct	16 ms	31580 KB	Output is correct
31	Incorrect	22 ms	37612 KB	Output isn't correct
32	Halted	0 ms	0 KB	-

답안 #1026505

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 8.0 / 8.0

Subtask #3 0 / 13.0

Subtask #4 0 / 12.0

Subtask #5 0 / 17.0

Subtask #6 0 / 43.0

Subtask #1
7.0 / 7.0

Subtask #2
8.0 / 8.0

Subtask #3
0 / 13.0

Subtask #4
0 / 12.0

Subtask #5
0 / 17.0

Subtask #6
0 / 43.0