# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1142276 | SmuggingSpun | Crossing (JOI21_crossing) | C++20 | 31 ms | 1152 KiB |
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
int n;
string sa, sb, sc;
namespace sub1{
void solve(){
int q;
string t;
cin >> q >> t;
cout << (t == sa ? "Yes\n" : "No\n");
for(int _ = 0; _ < q; _++){
int l, r;
char c;
cin >> l >> r >> c;
for(int i = l - 1; i < r; i++){
t[i] = c;
}
cout << (t == sa ? "Yes\n" : "No\n");
}
}
}
namespace sub2{
void solve(){
}
}
namespace sub3{
void solve(){
}
}
namespace sub4{
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> sa >> sb >> sc;
if(n <= 100 && sa == sb && sb == sc){
sub1::solve();
}
else if(sa == sb && sa == sc){
sub2::solve();
}
else if(n <= 100){
sub3::solve();
}
else{
sub4::solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |