Submission #1311558

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311558		the_commando_x	Dijamant (COI16_dijament)	C++17	100 / 100	315 ms	732 KiB

dijament

// #pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;

using pii = pair<int, int>;
using vii = vector<pii>;
using vvii = vector<vii>;

using l = long long;
using vl = vector<l>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;

using pll = pair<l, l>;
using vll = vector<pll>;
using vvll = vector<vll>;

using d = double;
using vd = vector<d>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;

using ld = long double;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;

using vb = vector<bool>;
using vvb = vector<vb>;
using pbb = pair<bool, bool>;
using vbb = vector<pbb>;

#define ff first
#define ss second

#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()

void setIO(string name = "")
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if (!name.empty())
    {
        (void)freopen((name + ".in").c_str(), "r", stdin);
        (void)freopen((name + ".out").c_str(), "w", stdout);
    }
}

const ld pi = 3.14159265358979323846;

const l LINF = 1e18;
const l INF = 1e9;

const l MOD = 1e9 + 7;
// const l MOD = 998244353;

const l MAXN = 1e3 + 5;

map<string, int> id;
vector<string> nameOf(1, "");

vector<bitset<MAXN>> anc(MAXN);
vb vis(MAXN);

int nxtId = 0;

int hasher(string &s)
{
    if (id.count(s))
        return id[s];

    nameOf.push_back(s);

    return id[s] = ++nxtId;
}

void solve()
{
    nameOf.reserve(MAXN);

    int n;
    cin >> n;

    for (int i = 0; i < n; ++i)
    {
        string K, _;
        cin >> K >> _;

        vector<string> parents;
        parents.reserve(128);
        
        while (true)
        {
            string x;
            cin >> x;

            if (x == ";")
                break;

            parents.push_back(x);
        }

        bool ok = true;
        if (id.count(K) && vis[id[K]])
            ok = false;

        vi P;
        for (auto &s : parents)
            if (!id.count(s) || !vis[id[s]])
                ok = false;
            else
                P.push_back(id[s]);

        if (ok)
        {
            for (int i = 0; i < P.size() && ok; ++i)
            {
                for (int j = i + 1; j < P.size() && ok; ++j)
                {
                    int x = P[i], y = P[j];
                    if (!anc[y][x] && !anc[x][y])
                        if ((anc[x] & anc[y]).any()) // * Intersection
                            ok = false;
                }
            }
        }

        if (!ok)
        {
            cout << "greska\n";
            continue;
        }

        int u = hasher(K);

        vis[u] = true;

        anc[u].reset();

        anc[u][u] = 1;
        for (auto p : P)
            anc[u] |= anc[p];

        cout << "ok\n";
    }
}

int main()
{
    setIO("");

#ifndef ONLINE_JUDGE
    // setIO("filename");
#endif

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

    return 0;
}

Compilation message (stderr)

dijament.cpp: In function 'void setIO(std::string)':
dijament.cpp:53:22: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         (void)freopen((name + ".in").c_str(), "r", stdin);
      |               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dijament.cpp:54:22: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |         (void)freopen((name + ".out").c_str(), "w", stdout);
      |               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 29 / 29
• Subtask 4: 44 / 44