oj.uz

Submission #314408

# Submission time Handle Problem Language Result Execution time Memory
314408 2020-10-19T19:56:23 Z mohamedsobhi777 Zamjena (COCI18_zamjena) C++14
70 / 70
 97 ms 11128 KB 
#include <bits/stdc++.h>

/*
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")*/

#define I inline void
#define S struct
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>

using namespace std;
using ll = long long;
using ld = long double;

const int N = 1e5 + 7, mod = 1e9 + 7;
const int inf = N;
// How interesting!

int n;

string s[N], t[N];
int fat[N], val[N];
map<string, int> mp;
int T;

int find(int x)
{
        return fat[x] = (x == fat[x] ? x : find(fat[x]));
}

void link(int u, int v)
{
        u = find(u);
        v = find(v);
        if (u != v)
        {
                if (val[u] && val[v])
                {
                        cout << "NE";
                        exit(0);
                }
                fat[u] = v;
                val[v] += val[u];
                val[u] = 0;
        }
}

int comp(string x)
{
        if (mp[x])
                return mp[x];
        if (x[0] >= '0' && x[0] <= '9')
                val[T + 1] = 1;
        return mp[x] = ++T;
}

int main()
{

        ios_base::sync_with_stdio(0);
        cin.tie(0);
        //freopen("in.in", "r", stdin);
        cin >> n;
        for (int i = 0; i < N; ++i)
                fat[i] = i;
        for (int i = 0; i < n; ++i)
                cin >> s[i];
        for (int i = 0; i < n; ++i)
                cin >> t[i];
        bool ok = 1;
        for (int i = 0; i < n; ++i)
        {
                int x = comp(s[i]);
                int y = comp(t[i]);
                link(x, y);
        }
        cout << "DA";
        return 0;
}

Compilation message

zamjena.cpp: In function 'int main()':
zamjena.cpp:76:14: warning: unused variable 'ok' [-Wunused-variable]
   76 |         bool ok = 1;
      |              ^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7040 KB Output is correct
2 Correct 5 ms 7040 KB Output is correct
3 Correct 5 ms 7040 KB Output is correct
4 Correct 5 ms 7040 KB Output is correct
5 Correct 5 ms 7040 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7044 KB Output is correct
2 Correct 5 ms 7040 KB Output is correct
3 Correct 5 ms 7040 KB Output is correct
4 Correct 5 ms 7040 KB Output is correct
5 Correct 5 ms 7040 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7040 KB Output is correct
2 Correct 5 ms 6948 KB Output is correct
3 Correct 5 ms 7040 KB Output is correct
4 Correct 5 ms 7040 KB Output is correct
5 Correct 5 ms 6912 KB Output is correct
6 Correct 5 ms 7040 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7040 KB Output is correct
2 Correct 6 ms 7040 KB Output is correct
3 Correct 7 ms 7168 KB Output is correct
4 Correct 8 ms 7168 KB Output is correct
5 Correct 9 ms 7296 KB Output is correct
6 Correct 8 ms 7168 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 7552 KB Output is correct
2 Correct 30 ms 8312 KB Output is correct
3 Correct 43 ms 9080 KB Output is correct
4 Correct 41 ms 9080 KB Output is correct
5 Correct 97 ms 11128 KB Output is correct
6 Correct 70 ms 9080 KB Output is correct