Submission #66571088


Source Code Expand

/*
 * author: LostKeyToReach
 * created time: 2025-06-07 21:01:06
 */
#include <bits/stdc++.h>
#define int long long
#define vi vt<int>
using ll = long long; using pii = std::pair<int, int>;
template<typename T> using vt = std::vector<T>;
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define For(i, a, b) for(int i = (a); i <= (b); ++i)
#define Rof(i, a, b) for(int i = (a); i >= (b); --i)
#define S std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0)
template<typename T> T chkmax(T& x, T y) {
    return (x < y) ? (x = y, y) : x;
} template<typename T> T chkmin(T& x, T y) {
    return (x > y) ? (x = y, y) : x;
}int fio = (S, 0); constexpr int N = 5e5 + 5;
int32_t main() {int n;
    std::string t, a; std::cin >> n >> t >> a;
    For(i, 0, n - 1) if (t[i] == 'o' && a[i] == 'o') {
        return std::cout << "Yes\n", 0;
    } std::cout << "No\n";
}

Submission Info

Submission Time
Task A - Conflict
User lkfush
Language C++ 20 (gcc 12.2)
Score 100
Code Size 913 Byte
Status AC
Exec Time 1 ms
Memory 3616 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 15
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3428 KiB
00_sample_01.txt AC 1 ms 3476 KiB
00_sample_02.txt AC 1 ms 3340 KiB
01_test_00.txt AC 1 ms 3316 KiB
01_test_01.txt AC 1 ms 3612 KiB
01_test_02.txt AC 1 ms 3420 KiB
01_test_03.txt AC 1 ms 3404 KiB
01_test_04.txt AC 1 ms 3416 KiB
01_test_05.txt AC 1 ms 3416 KiB
01_test_06.txt AC 1 ms 3476 KiB
01_test_07.txt AC 1 ms 3432 KiB
01_test_08.txt AC 1 ms 3440 KiB
01_test_09.txt AC 1 ms 3464 KiB
01_test_10.txt AC 1 ms 3616 KiB
01_test_11.txt AC 1 ms 3468 KiB