oj.uz

Submission #948147

# Submission time Handle Problem Language Result Execution time Memory
948147 2024-03-17T16:43:45 Z Nhoksocqt1 Thousands Islands (IOI22_islands) C++17
6.75 / 100
 82 ms 18960 KB 
#ifndef Nhoksocqt1
    #include "islands.h"
#endif // Nhoksocqt1
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 100005;

vector<ii> adj[MAXN];
map<ii, int> cntEdge;
ii edge[2 * MAXN];
int tr[MAXN], numNode, numEdge;
bool dx[MAXN], dxt[2 * MAXN];

int getCntEdge(ii p) {
    return (cntEdge.find(p) != cntEdge.end()) ? cntEdge[p] : 0;
}

void dfs(int u, int lastID = -1) {
    dx[u] = 1;
    tr[u] = lastID;
    for (int it = 0; it < sz(adj[u]); ++it) {
        int v(adj[u][it].fi), id(adj[u][it].se);
        if(!dx[v])
            dfs(v, id);
    }
}

#ifdef Nhoksocqt1
    vector<int>
#else
    variant<bool, vector<int>>
#endif // Nhoksocqt1
    find_journey(int _N, int _M, vector<int> _U, vector<int> _V) {
    numNode = _N, numEdge = _M;
    for (int i = 0; i < numEdge; ++i) {
        int u(_U[i]), v(_V[i]);
        edge[i] = {u, v};
        adj[u].push_back(ii(v, i));
        ++cntEdge[ii(u, v)];
    }

    int x(-1), y(-1), z(-1);

    dfs(0);
    x = y = z = -1;
    for (int i = 0; i < numNode; ++i) {
        if(dx[i]) {
            int t1(-1);
            for (int it = 0; it < sz(adj[i]); ++it) {
                int j(adj[i][it].fi);

                if(edge[tr[i]].fi != j && getCntEdge(ii(j, i)) > 0) {
                    if(t1 < 0) {
                        t1 = j;
                    } else
                        if(t1 != j) {
                            x = i, y = t1, z = j;
                            break;
                        }
                }
            }

            if(y >= 0)
                break;
        }
    }

    if(z >= 0) {
        int idx_y(-1), idy_x(-1), idx_z(-1), idz_x(-1);
        for (int i = 0; i < numEdge; ++i) {
            int u(edge[i].fi), v(edge[i].se);
            if(u == x && v == y)
                idx_y = i;

            if(u == y && v == x)
                idy_x = i;

            if(u == x && v == z)
                idx_z = i;

            if(u == z && v == x)
                idz_x = i;
        }

        vector<int> ans, pf;
        int u(x);
        while(u != 0) {
            ans.push_back(tr[u]);
            u = edge[tr[u]].fi;
        }

        pf = ans;
        reverse(ans.begin(), ans.end());

        vector<int> p({idx_y, idy_x, idx_z, idz_x, idy_x, idx_y, idz_x, idx_z});
        for (int it = 0; it < sz(p); ++it)
            ans.push_back(p[it]);

        for (int it = 0; it < sz(pf); ++it)
            ans.push_back(pf[it]);

        return ans;
    }

    for (int i = 0; i < numNode; ++i) {
        if(!dx[i])
            continue;

        for (int it = 0; it < sz(adj[i]); ++it) {
            int j(adj[i][it].fi);
            if((i == 0 || it > 0 && !dxt[j]) && getCntEdge(ii(i, j)) > 1 && getCntEdge(ii(j, i)) > 0) {
                x = i, y = j;
                break;
            }

            dxt[j] = 1;
        }

        for (int it = 0; it < sz(adj[i]); ++it) {
            int j(adj[i][it].fi);
            dxt[j] = 0;
        }

        for (int it = sz(adj[i]) - 1; it >= 0; --it) {
            int j(adj[i][it].fi);
            if((i == 0 || it < sz(adj[i]) - 1 && !dxt[j]) && getCntEdge(ii(i, j)) > 1 && getCntEdge(ii(j, i)) > 0) {
                x = i, y = j;
                break;
            }

            dxt[j] = 1;
        }

        for (int it = 0; it < sz(adj[i]); ++it) {
            int j(adj[i][it].fi);
            dxt[j] = 0;
        }

        if(y >= 0)
            break;
    }

    if(y >= 0) {
        return true;
        int idx_y_1(-1), idy_x(-1), idx_y_2(-1);
        for (int i = 0; i < numEdge; ++i) {
            int u(edge[i].fi), v(edge[i].se);
            if(u == x && v == y) {
                if(idx_y_1 < 0) {
                    idx_y_1 = i;
                } else {
                    idx_y_2 = i;
                }
            }

            if(u == y && v == x)
                idy_x = i;
        }

        vector<int> ans, pf;
        int u(x);
        while(u != 0) {
            ans.push_back(tr[u]);
            u = edge[tr[u]].fi;
        }

        pf = ans;
        reverse(ans.begin(), ans.end());

        vector<int> p({idx_y_1, idy_x, idx_y_2, idx_y_1, idy_x, idx_y_2});
        for (int it = 0; it < sz(p); ++it)
            ans.push_back(p[it]);

        for (int it = 0; it < sz(pf); ++it)
            ans.push_back(pf[it]);

        return ans;
    }

    #ifdef Nhoksocqt1
        return {-1};
    #else
        return false;
    #endif // Nhoksocqt1
}

#ifdef Nhoksocqt1

int main(void) {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    #define TASK "islands"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    vector<int> _U, _V;
    int _N, _M;
    cin >> _N >> _M;

    _U.resize(_M), _V.resize(_M);
    for (int i = 0; i < _M; ++i)
        cin >> _U[i] >> _V[i];

    vector<int> p = find_journey(_N, _M, _U, _V);
    cout << "ANSWER: ";
    if(sz(p) == 1 && p[0] == -1) {
        cout << "NO\n";
    } else {
        for (int it = 0; it < sz(p); ++it)
            cout << p[it] << ' ';

        cout << '\n';
    }

    return 0;
}

#endif // Nhoksocqt1

Compilation message

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:129:34: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  129 |             if((i == 0 || it > 0 && !dxt[j]) && getCntEdge(ii(i, j)) > 1 && getCntEdge(ii(j, i)) > 0) {
      |                           ~~~~~~~^~~~~~~~~~
islands.cpp:144:47: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  144 |             if((i == 0 || it < sz(adj[i]) - 1 && !dxt[j]) && getCntEdge(ii(i, j)) > 1 && getCntEdge(ii(j, i)) > 0) {
      |                           ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Partially correct 1 ms 4700 KB Output is partially correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Partially correct 1 ms 4700 KB Output is partially correct
7 Partially correct 29 ms 9680 KB Output is partially correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 82 ms 18960 KB Output is correct

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Partially correct 1 ms 4700 KB Output is partially correct
5 Correct 2 ms 4956 KB Output is correct
6 Incorrect 1 ms 4700 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

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

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Partially correct 1 ms 4700 KB Output is partially correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Partially correct 1 ms 4700 KB Output is partially correct
7 Partially correct 29 ms 9680 KB Output is partially correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 82 ms 18960 KB Output is correct
14 Correct 2 ms 5212 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Partially correct 1 ms 4700 KB Output is partially correct
18 Correct 2 ms 4956 KB Output is correct
19 Incorrect 1 ms 4700 KB Output isn't correct
20 Halted 0 ms 0 KB -