oj.uz

Submission #492305

# Submission time Handle Problem Language Result Execution time Memory
492305 2021-12-06T15:02:11 Z mosiashvililuka Crossing (JOI21_crossing) C++14
0 / 100
 37 ms 2204 KB 
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t;
string S[9],s;
char ch;
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>a;
	cin>>S[1]>>S[2]>>S[3];
	for(i=1; i<=3; i++) S[i]="0"+S[i];
	cin>>tes;
	cin>>s;s="0"+s;
	for(t=1; t<=tes; t++){
		cin>>c>>d>>ch;
		for(i=c; i<=d; i++){
			s[i]=ch;
		}
		for(i=1; i<=a; i++){
			if(S[1][i]!=s[i]) break;
		}
		if(i==a+1){
			cout<<"Yes\n";
		}else{
			cout<<"No\n";
		}
	}
	return 0;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 2204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 2204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 2204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 2204 KB Output isn't correct
2 Halted 0 ms 0 KB -