oj.uz

Submission #845827

# Submission time Handle Problem Language Result Execution time Memory
845827 2023-09-06T16:06:36 Z Marco_Escandon Thousands Islands (IOI22_islands) C++17
24 / 100
 61 ms 14264 KB 
#include<bits/stdc++.h>
using namespace std;
#include <vector>
typedef int ll;

#include <variant>
#include <vector>
vector<ll> cad[100001];
ll v[100001]={ };
ll v2[100001]={};
ll pi=0;
ll pl=0;
ll ap=0;
void sol(ll node, ll p)
{
    if(pl==1)
        return ;
    if(v[node]!=0)
    {
        ap=v[node];
        pi=node;
        v[node]=p;
        pl=1;
        return ;
    }
    if(v2[node]!=0)
        return;
    v2[node]=1;
    v[node]=p;
    for(auto i:cad[node])
    {
        sol(i,node);
    }
    if(pi==0)
    {
        v[node]=0;
    }
}
std::variant<bool, std::vector<int>> find_journey(int n, int m, std::vector<int> U, std::vector<int> V)
{
    map<pair<ll,ll>,ll> mapa;
    for(int i=0; i<m; i++)
        if(i%2==0)
        {
            cad[U[i]+1].push_back(V[i]+1);
            mapa[{U[i]+1,V[i]+1}]=i;
        }
    sol(1,-1);
    if(pi==0)
    {
        return false;
    }
    vector<ll>asdf;
    asdf.push_back(pi);
    while(ap!=1&&ap!=0)
    {
        asdf.push_back(ap);
        ap=v[ap];
    }
    asdf.push_back(ap);
    reverse(asdf.begin(),asdf.end());
    vector<ll> sol,s2,sol2,sade;
    if(ap!=0)
    for(int i=0; i<asdf.size()-1; i++)
    {
        s2.push_back(mapa[{asdf[i],asdf[i+1]}]);
        sade.push_back(mapa[{asdf[i],asdf[i+1]}]);
    }
    ll p=pi;
    vector<ll> st;
    st.push_back(p);
    p=v[p];
    while(p!=pi)
    {
        st.push_back(p);
        p=v[p];
    }
    st.push_back(p);
    //cout<<st.size()<<"\n";
    reverse(st.begin(),st.end());
    for(int i=0; i<st.size()-1; i++)
    {
        sol.push_back(mapa[{st[i],st[i+1]}]);
        s2.push_back(mapa[{st[i],st[i+1]}]);
    }
    reverse(sol.begin(),sol.end());
    for(int i=0; i<st.size()-1; i++)
    {
        sol2.push_back(mapa[{st[i],st[i+1]}]+1);
        s2.push_back(mapa[{st[i],st[i+1]}]+1);
    }
    reverse(sol2.begin(),sol2.end());
    reverse(sade.begin(),sade.end());
    for(auto i:sol)
        s2.push_back(i);
    for(auto i:sol2)
        s2.push_back(i);
    for(auto i:sade)
        s2.push_back(i);
    return s2;
}

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:64:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0; i<asdf.size()-1; i++)
      |                  ~^~~~~~~~~~~~~~
islands.cpp:81:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=0; i<st.size()-1; i++)
      |                  ~^~~~~~~~~~~~
islands.cpp:87:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for(int i=0; i<st.size()-1; i++)
      |                  ~^~~~~~~~~~~~

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 5.0

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

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 3416 KB Output is partially correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 2 ms 3420 KB Output is correct
4 Partially correct 1 ms 3160 KB Output is partially correct
5 Correct 2 ms 3416 KB Output is correct
6 Partially correct 1 ms 3160 KB Output is partially correct
7 Correct 1 ms 3416 KB Output is correct
8 Incorrect 1 ms 3420 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 2 ms 3416 KB Output is correct
3 Correct 33 ms 7740 KB Output is correct
4 Correct 49 ms 12368 KB Output is correct
5 Correct 2 ms 3672 KB Output is correct
6 Correct 2 ms 3416 KB Output is correct
7 Correct 1 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 2 ms 3416 KB Output is correct
11 Correct 2 ms 3672 KB Output is correct
12 Correct 2 ms 3672 KB Output is correct
13 Correct 3 ms 3672 KB Output is correct
14 Correct 2 ms 3416 KB Output is correct
15 Correct 3 ms 3672 KB Output is correct
16 Correct 1 ms 3416 KB Output is correct
17 Correct 1 ms 3160 KB Output is correct
18 Correct 2 ms 3420 KB Output is correct
19 Correct 2 ms 3416 KB Output is correct
20 Correct 37 ms 8284 KB Output is correct
21 Correct 52 ms 13316 KB Output is correct
22 Correct 1 ms 3416 KB Output is correct
23 Correct 1 ms 3416 KB Output is correct
24 Correct 1 ms 3164 KB Output is correct
25 Correct 2 ms 3416 KB Output is correct
26 Correct 3 ms 3416 KB Output is correct
27 Correct 52 ms 11600 KB Output is correct
28 Correct 56 ms 12112 KB Output is correct
29 Correct 1 ms 3160 KB Output is correct
30 Correct 61 ms 14264 KB Output is correct
31 Correct 1 ms 3160 KB Output is correct
32 Correct 52 ms 12316 KB Output is correct
33 Correct 36 ms 8268 KB Output is correct
34 Correct 29 ms 9052 KB Output is correct
35 Correct 2 ms 3416 KB Output is correct
36 Correct 45 ms 11344 KB Output is correct
37 Correct 55 ms 13648 KB Output is correct
38 Correct 2 ms 3416 KB Output is correct
39 Correct 43 ms 11004 KB Output is correct
40 Correct 2 ms 3416 KB Output is correct
41 Correct 60 ms 14176 KB Output is correct
42 Correct 52 ms 12372 KB Output is correct
43 Correct 1 ms 3164 KB Output is correct
44 Correct 2 ms 3420 KB Output is correct
45 Correct 2 ms 3416 KB Output is correct
46 Correct 26 ms 8020 KB Output is correct

Subtask #5
0.0 / 45.0

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