oj.uz

Submission #837962

# Submission time Handle Problem Language Result Execution time Memory
837962 2023-08-25T23:08:23 Z tfgs Zamjena (COCI18_zamjena) C++17
70 / 70
 165 ms 14540 KB 
#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define vi vector<ll>
#define vb vector<bool>
#define f0(i,a) for(ll i=0;i<(a);i++)
#define f1(i,a) for(ll i=1;i<(a);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define f first
#define s second
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0200r0.html
template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }
#ifdef I_AM_NOOB
#define gg(...) [](const auto&...x){ char c='='; cerr<<#__VA_ARGS__; ((cerr<<exchange(c,',')<<x),...); cerr<<endl; }(__VA_ARGS__);
#else
#define gg(...) 777771449
#endif

constexpr ll INFF = 1e18;
constexpr ll P = 1e9+7;
// constexpr ll P = 998244353;

int main() {
    cin.tie(0) -> ios::sync_with_stdio(0);
    
    ll n; cin >> n;
    vector<string> a(n); for(auto&x:a) cin >> x;
    map<string, set<string>> eq;
    map<string, ll> mp;
    bool ok = true;
    f0(i, n) {
        string x; cin >> x;
        auto get = [&](string s) -> ll {
            return isdigit(s[0]) ? stoi(s) : mp[s];
        };
        auto assign = y_combinator([&](auto rec, string k, ll v) -> void {
            mp[k] = v;
            string e;
            while (!eq[k].empty()) {
                e = *prev(eq[k].end());
                eq[k].erase(prev(eq[k].end()));
                rec(e, v);
            }
        });

        if (x == a[i]);
        else if (get(a[i]) && get(x)) {
            if (get(x) != get(a[i])) {
                cout << "NE" << endl;
                ok = false;
                break;
            }
        } else if (get(x)) {
            assign(a[i], get(x));
        } else if (get(a[i])) {
            assign(x, get(a[i]));
        } else {
            eq[a[i]].insert(x); eq[x].insert(a[i]);
        }
    }

    if (ok) {
        cout << "DA" << endl;
    }
    
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 6 ms 1108 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 3 ms 712 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2260 KB Output is correct
2 Correct 41 ms 4208 KB Output is correct
3 Correct 63 ms 7668 KB Output is correct
4 Correct 40 ms 7116 KB Output is correct
5 Correct 165 ms 14540 KB Output is correct
6 Correct 79 ms 7236 KB Output is correct