oj.uz

Submission #627408

# Submission time Handle Problem Language Result Execution time Memory
627408 2022-08-12T14:36:13 Z Farhan_HY Zamjena (COCI18_zamjena) C++14
14 / 70
 37 ms 62996 KB 
#include <bits/stdc++.h>
#define int long long
#define float double
#define pb push_back
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;
/// Benzema is the best player in the world
const int inf = 8e18;
const int N = 1e6 + 6;
const int M = 1e3 + 3;
const int LOG = 31;
const int mod = 1e9 + 7;
const float pi = atan(1) * 4;
string a[N], b[N];
int n;
map<string, string> mp;

bool num(string s)
{
    bool ok = 1;
    for(auto x: s)
        ok &= x >= '0' && x <= '9';
    return ok;
}

main()
{
    IOS
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i <= n; i++)
        cin >> b[i];
    bool ans = 1;
    for(int i = 1; i <= n; i++)
    {
        bool A = num(a[i]);
        bool B = num(b[i]);
        if (A) mp[a[i]] = a[i];
        if (B) mp[b[i]] = b[i];
        if (A && B)
            ans &= a[i] == b[i];
        else if (A && !B)
        {
            if (mp.count(b[i]))
                ans &= mp[b[i]] == a[i];
            else
                mp[b[i]] = a[i];
        }
        else if (!A && B)
        {
            if (mp.count(a[i]))
                ans &= mp[a[i]] == b[i];
            else
                mp[a[i]] = b[i];
        }
    }
    if (ans) cout << "DA";
    else cout << "NE";
}
///use scanf

Compilation message

zamjena.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main()
      | ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 62932 KB Output is correct
2 Correct 30 ms 62852 KB Output is correct
3 Correct 29 ms 62996 KB Output is correct
4 Correct 30 ms 62900 KB Output is correct
5 Correct 34 ms 62932 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 62916 KB Output is correct
2 Incorrect 33 ms 62880 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 62896 KB Output is correct
2 Correct 37 ms 62928 KB Output is correct
3 Correct 31 ms 62944 KB Output is correct
4 Incorrect 30 ms 62924 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 62936 KB Output is correct
2 Correct 30 ms 62928 KB Output is correct
3 Incorrect 30 ms 62988 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

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