제출 #1170495

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170495		tamzid	Zamjena (COCI18_zamjena)	C++20	0 / 70	1 ms	1612 KiB

zamjena

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout<<it<<" ";cout<<endl;
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

bool is_num(string s)
{
    for(char ch : s)
    {
        if(!isdigit(ch))
        {
            return false;
        }
    }
    return true;
}

void solve()
{
    int n;
    cin>>n;
    vector<string> a(n),b(n);
    for(int i=0;i<n;++i)
    {
        cin>>a[i];
    }
    for(int i=0;i<n;++i)
    {
        cin>>b[i];
        if(is_num(b[i]))
        {
            int num = stoi(b[i]);
            if(b[i]!=a[i])
            {
                cout<<"NE\n";
                return;
            }
        }
    }
    cout<<"DA\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14