| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229739 | SpyrosAliv | Crossing (JOI21_crossing) | C++20 | 7091 ms | 1944 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
string a, b, c; cin >> a >> b >> c;
int q; cin >> q;
string curr; cin >> curr;
if (curr == a) cout << "Yes\n";
else cout << "No\n";
while (q--) {
int l, r; cin >> l >> r;
l--;
r--;
char c; cin >> c;
for (int i = l; i <= r; i++) curr[i] = c;
if (curr == a) {
cout << "Yes\n";
}
else cout << "No\n";
}
}| # | 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... | ||||
