oj.uz

Submission #802984

# Submission time Handle Problem Language Result Execution time Memory
802984 2023-08-02T17:17:39 Z SamAnd Keys (IOI21_keys) C++17
100 / 100
 2021 ms 395340 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
const int N = 300005;

int n;
vector<pair<int, int> > g[N];

int c[N];
bool cc[N];
vector<int> v[N];
vector<vector<int> > vvv;
int stup(int x, const vector<int>& r)
{
    int ans = 0;
    queue<int> q;
    q.push(x);
    queue<int> qq;
    vector<int> vv;
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        if (c[x])
            continue;
        ++ans;
        vv.push_back(x);
        qq.push(x);
        qq.push(r[x]);
        c[x] = true;
        cc[r[x]] = true;
        while (!v[r[x]].empty())
        {
            q.push(v[r[x]].back());
            v[r[x]].pop_back();
        }
        for (int i = 0; i < sz(g[x]); ++i)
        {
            int h = g[x][i].fi;
            if (cc[g[x][i].se])
                q.push(h);
            else
            {
                qq.push(g[x][i].se);
                v[g[x][i].se].push_back(h);
            }
        }
    }
    while (!qq.empty())
    {
        int x = qq.front();
        qq.pop();
        c[x] = false;
        cc[x] = false;
        v[x].clear();
    }
    vvv.push_back(vv);
    return ans;
}

int u[N];
vector<vector<int> > vv;
bool dfs(int x)
{
    c[x] = 1;
    if (!c[u[x]])
    {
        if (dfs(u[x]))
        {
            c[x] = 2;
            return true;
        }
    }
    if (c[u[x]] == 1)
    {
        vector<int> v;
        int y = u[x];
        while (y != x)
        {
            v.push_back(y);
            y = u[y];
        }
        v.push_back(x);
        vv.push_back(v);
        c[x] = 2;
        return true;
    }
    c[x] = 2;
    return false;
}

std::vector<int> find_reachable(std::vector<int> R, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
    n = sz(R);
    int m = sz(U);

	std::vector<int> ans(n, 0);
    for (int i = 0; i < m; ++i)
    {
        int x = U[i];
        int y = V[i];
        if (x == y)
            continue;
        g[x].push_back(m_p(y, C[i]));
        g[y].push_back(m_p(x, C[i]));
    }

    bool ff = false;
    for (int x = 0; x < n; ++x)
    {
        bool f = false;
        for (int i = 0; i < g[x].size(); ++i)
        {
            if (g[x][i].se == R[x])
            {
                u[x] = g[x][i].fi;
                f = true;
                break;
            }
        }
        if (!f)
        {
            ff = true;
            break;
        }
    }

    if (ff)
    {
        for (int x = 0; x < n; ++x)
        {
            bool f = false;
            for (int i = 0; i < g[x].size(); ++i)
            {
                if (g[x][i].se == R[x])
                {
                    f = true;
                    break;
                }
            }
            if (!f)
                ans[x] = 1;
        }
        return ans;
    }

    for (int x = 0; x < n; ++x)
    {
        if (!c[x])
        {
            dfs(x);
        }
    }

    for (int x = 0; x < n; ++x)
        c[x] = false;

    vector<int> s;
    for (int i = 0; i < sz(vv); ++i)
    {
        s.push_back(stup(vv[i][0], R));
    }

    int minu = s[0];
    for (int i = 0; i < sz(vv); ++i)
        minu = min(minu, s[i]);

    for (int i = 0; i < sz(vv); ++i)
    {
        if (s[i] == minu)
        {
            for (int j = 0; j < sz(vvv[i]); ++j)
                ans[vvv[i][j]] = 1;
        }
    }

    return ans;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:115:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |         for (int i = 0; i < g[x].size(); ++i)
      |                         ~~^~~~~~~~~~~~~
keys.cpp:136:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |             for (int i = 0; i < g[x].size(); ++i)
      |                             ~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 6 ms 14300 KB Output is correct
5 Correct 8 ms 14324 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 6 ms 14292 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 6 ms 14300 KB Output is correct
5 Correct 8 ms 14324 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 6 ms 14292 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 6 ms 14356 KB Output is correct
11 Correct 6 ms 14420 KB Output is correct
12 Correct 6 ms 14376 KB Output is correct
13 Correct 6 ms 14404 KB Output is correct
14 Correct 6 ms 14408 KB Output is correct
15 Correct 6 ms 14420 KB Output is correct
16 Correct 7 ms 14292 KB Output is correct
17 Correct 7 ms 14412 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14292 KB Output is correct
20 Correct 6 ms 14292 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 6 ms 14292 KB Output is correct
23 Correct 6 ms 14292 KB Output is correct
24 Correct 6 ms 14292 KB Output is correct
25 Correct 6 ms 14292 KB Output is correct
26 Correct 7 ms 14292 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 6 ms 14300 KB Output is correct
5 Correct 8 ms 14324 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 6 ms 14292 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 6 ms 14356 KB Output is correct
11 Correct 6 ms 14420 KB Output is correct
12 Correct 6 ms 14376 KB Output is correct
13 Correct 6 ms 14404 KB Output is correct
14 Correct 6 ms 14408 KB Output is correct
15 Correct 6 ms 14420 KB Output is correct
16 Correct 7 ms 14292 KB Output is correct
17 Correct 7 ms 14412 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14292 KB Output is correct
20 Correct 6 ms 14292 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 6 ms 14292 KB Output is correct
23 Correct 6 ms 14292 KB Output is correct
24 Correct 6 ms 14292 KB Output is correct
25 Correct 6 ms 14292 KB Output is correct
26 Correct 7 ms 14292 KB Output is correct
27 Correct 7 ms 14548 KB Output is correct
28 Correct 7 ms 14548 KB Output is correct
29 Correct 8 ms 14548 KB Output is correct
30 Correct 7 ms 14548 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 7 ms 14452 KB Output is correct
34 Correct 20 ms 16496 KB Output is correct
35 Correct 7 ms 14392 KB Output is correct
36 Correct 9 ms 14536 KB Output is correct
37 Correct 7 ms 14420 KB Output is correct
38 Correct 7 ms 14540 KB Output is correct
39 Correct 7 ms 14420 KB Output is correct
40 Correct 8 ms 14548 KB Output is correct
41 Correct 15 ms 15188 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 6 ms 14300 KB Output is correct
5 Correct 8 ms 14324 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 6 ms 14292 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 106 ms 31312 KB Output is correct
11 Correct 153 ms 46032 KB Output is correct
12 Correct 216 ms 36044 KB Output is correct
13 Correct 215 ms 47304 KB Output is correct
14 Correct 288 ms 76520 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 6 ms 14300 KB Output is correct
5 Correct 8 ms 14324 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 6 ms 14292 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 6 ms 14356 KB Output is correct
11 Correct 6 ms 14420 KB Output is correct
12 Correct 6 ms 14376 KB Output is correct
13 Correct 6 ms 14404 KB Output is correct
14 Correct 6 ms 14408 KB Output is correct
15 Correct 6 ms 14420 KB Output is correct
16 Correct 7 ms 14292 KB Output is correct
17 Correct 7 ms 14412 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14292 KB Output is correct
20 Correct 6 ms 14292 KB Output is correct
21 Correct 7 ms 14420 KB Output is correct
22 Correct 6 ms 14292 KB Output is correct
23 Correct 6 ms 14292 KB Output is correct
24 Correct 6 ms 14292 KB Output is correct
25 Correct 6 ms 14292 KB Output is correct
26 Correct 7 ms 14292 KB Output is correct
27 Correct 7 ms 14548 KB Output is correct
28 Correct 7 ms 14548 KB Output is correct
29 Correct 8 ms 14548 KB Output is correct
30 Correct 7 ms 14548 KB Output is correct
31 Correct 7 ms 14420 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 7 ms 14452 KB Output is correct
34 Correct 20 ms 16496 KB Output is correct
35 Correct 7 ms 14392 KB Output is correct
36 Correct 9 ms 14536 KB Output is correct
37 Correct 7 ms 14420 KB Output is correct
38 Correct 7 ms 14540 KB Output is correct
39 Correct 7 ms 14420 KB Output is correct
40 Correct 8 ms 14548 KB Output is correct
41 Correct 15 ms 15188 KB Output is correct
42 Correct 106 ms 31312 KB Output is correct
43 Correct 153 ms 46032 KB Output is correct
44 Correct 216 ms 36044 KB Output is correct
45 Correct 215 ms 47304 KB Output is correct
46 Correct 288 ms 76520 KB Output is correct
47 Correct 7 ms 14408 KB Output is correct
48 Correct 8 ms 14408 KB Output is correct
49 Correct 6 ms 14292 KB Output is correct
50 Correct 111 ms 44860 KB Output is correct
51 Correct 116 ms 37256 KB Output is correct
52 Correct 102 ms 31116 KB Output is correct
53 Correct 114 ms 31128 KB Output is correct
54 Correct 104 ms 31108 KB Output is correct
55 Correct 128 ms 32460 KB Output is correct
56 Correct 150 ms 37844 KB Output is correct
57 Correct 133 ms 38424 KB Output is correct
58 Correct 151 ms 39040 KB Output is correct
59 Correct 231 ms 54916 KB Output is correct
60 Correct 141 ms 35148 KB Output is correct
61 Correct 144 ms 34556 KB Output is correct
62 Correct 121 ms 33152 KB Output is correct
63 Correct 157 ms 49532 KB Output is correct
64 Correct 33 ms 18764 KB Output is correct
65 Correct 37 ms 20816 KB Output is correct
66 Correct 136 ms 33636 KB Output is correct
67 Correct 185 ms 52916 KB Output is correct
68 Correct 315 ms 78200 KB Output is correct
69 Correct 225 ms 51928 KB Output is correct
70 Correct 624 ms 141072 KB Output is correct
71 Correct 2021 ms 395340 KB Output is correct
72 Correct 221 ms 55136 KB Output is correct
73 Correct 128 ms 33996 KB Output is correct