oj.uz

Submission #861638

# Submission time Handle Problem Language Result Execution time Memory
861638 2023-10-16T15:28:38 Z faustaadp Longest Trip (IOI23_longesttrip) C++17
0 / 100
 848 ms 5500 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define pb push_back
const ll NN = 1e5 + 5;
vector<int> ret, ret2;
ll b[NN], n, ada = 0, mxx, now, coba = 0, ti;
vector<ll> v[NN];
void dfs(ll pos)
{
    if(ada)return ;
    b[pos] = 1;
    ret.pb(pos);
    // cout << pos << " mas " << ret.size() << "_\n";
    // cout << ret.size() << " dan " << mxx << "\n";
    coba++;
    if(ret2.size() < ret.size())ret2 = ret;
    if(coba >= 10000000)ada = 2;
    if(ret.size() * 2 >= mxx)ada = 1;
    if(ada)return;
    // random_shuffle(v[pos].begin(), v[pos].end());
    for(ll i = 0; i < v[pos].size(); i++)
    {
        if(b[v[pos][i]] == 0)dfs(v[pos][i]);
        if(ada)return ;
    }
    b[pos] = 0;
    // cout << pos << " kel\n";
    ret.pop_back();
}
void dfs2(ll pos)
{
    now++;
    mxx = max(mxx, now);
    b[pos] = ti;
    for(ll i = 0; i < v[pos].size(); i++)
        if(b[v[pos][i]] == 0)
            dfs2(v[pos][i]);
}
std::vector<int> longest_trip(int N, int D)
{
    ret2.clear();
    mxx = 0;
    coba = 0;
    ada = 0;
    n = N;
    ret.clear();
    for(ll i = 0; i < N; i++)
    {
        v[i].clear();
        b[i] = 0;
    }
    for(ll i = 0; i < N; i++)
        for(ll j = i + 1; j < N; j++)
        {
            vector<int> A;A.pb(i);
            vector<int> B;B.pb(j);
            bool isi = are_connected(A, B);
            if(isi)
            {
                // cout << i << "--" << j << "\n";
                v[i].pb(j);
                v[j].pb(i);
            }
        }
    for(ll i = 0; i < N; i++)
        if(!b[i])
        {
            ti++;
            now = 0;
            dfs2(i);
        }
    for(ll i = 0; i < N; i++)
    {
        b[i] = 0;
    }
    ti = 1;
    vector<ll> cal;
    for(ll i = 0; i < N; i++)
        if(!b[i])
        {
            ti++;
            now = 0;
            dfs2(i);
            if(now != mxx)
                continue;
            for(ll j = 0; j < N; j++)
            {
                if(b[j] == ti)
                    cal.pb(j);
            }
            break;
        }
    memset(b, 0, sizeof(b));
    for(auto aa : cal)
    {
        coba = 0;
        dfs(aa);
        if(ada == 2)
            ada = 0;
    }
    return ret2;
    // ll mul = 1;
    // if(N % 2 == 0)
    // {
    //     vector<int> A;A.pb(0);
    //     vector<int> B;B.pb(1);
    //     bool isi = are_connected(A, B);
    //     if(!isi)
    //         swap(cal[1], cal[2]);
    //     ret.pb(cal[0]);
    //     ret.pb(cal[1]);
    // }
    // else
    //     ret.pb(cal[0]);
    // for(ll i = mul; i + 1 < N; i += 2)
    // {
    //     ll now = ret.back();
    //     vector<int> A;A.pb(now);
    //     vector<int> B;A.pb(cal[i]);
    //     bool isi = are_connected(A, B);
    //     if()
    // }
    // return ret;
}

Compilation message

longesttrip.cpp: In function 'void dfs(ll)':
longesttrip.cpp:20:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   20 |     if(ret.size() * 2 >= mxx)ada = 1;
      |        ~~~~~~~~~~~~~~~^~~~~~
longesttrip.cpp:23:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(ll i = 0; i < v[pos].size(); i++)
      |                   ~~^~~~~~~~~~~~~~~
longesttrip.cpp: In function 'void dfs2(ll)':
longesttrip.cpp:37:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(ll i = 0; i < v[pos].size(); i++)
      |                   ~~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3416 KB Output is correct
2 Correct 25 ms 3416 KB Output is correct
3 Correct 118 ms 4328 KB Output is correct
4 Correct 397 ms 3944 KB Output is correct
5 Correct 707 ms 4380 KB Output is correct
6 Correct 12 ms 3416 KB Output is correct
7 Correct 25 ms 3416 KB Output is correct
8 Correct 115 ms 3672 KB Output is correct
9 Correct 301 ms 4324 KB Output is correct
10 Correct 768 ms 4304 KB Output is correct
11 Correct 784 ms 4940 KB Output is correct
12 Correct 764 ms 4764 KB Output is correct
13 Correct 763 ms 4684 KB Output is correct
14 Correct 13 ms 3416 KB Output is correct
15 Correct 16 ms 3416 KB Output is correct
16 Correct 33 ms 3672 KB Output is correct
17 Correct 70 ms 3672 KB Output is correct
18 Correct 135 ms 3928 KB Output is correct
19 Correct 289 ms 4608 KB Output is correct
20 Correct 234 ms 4364 KB Output is correct
21 Correct 813 ms 5048 KB Output is correct
22 Correct 755 ms 4664 KB Output is correct
23 Correct 848 ms 4672 KB Output is correct
24 Correct 758 ms 4484 KB Output is correct
25 Correct 13 ms 3416 KB Output is correct
26 Correct 13 ms 3416 KB Output is correct
27 Correct 22 ms 3416 KB Output is correct
28 Correct 23 ms 3416 KB Output is correct
29 Correct 26 ms 3416 KB Output is correct
30 Correct 170 ms 4100 KB Output is correct
31 Correct 161 ms 3592 KB Output is correct
32 Correct 152 ms 4072 KB Output is correct
33 Correct 252 ms 4100 KB Output is correct
34 Correct 247 ms 4252 KB Output is correct
35 Correct 277 ms 3964 KB Output is correct
36 Correct 705 ms 4708 KB Output is correct
37 Correct 711 ms 4936 KB Output is correct
38 Correct 705 ms 5260 KB Output is correct
39 Correct 674 ms 5376 KB Output is correct
40 Correct 686 ms 4852 KB Output is correct
41 Correct 742 ms 4264 KB Output is correct
42 Correct 737 ms 4056 KB Output is correct
43 Correct 707 ms 5500 KB Output is correct
44 Correct 751 ms 5340 KB Output is correct
45 Correct 13 ms 3416 KB Output is correct
46 Correct 14 ms 3416 KB Output is correct
47 Correct 23 ms 3672 KB Output is correct
48 Correct 28 ms 3672 KB Output is correct
49 Correct 25 ms 3416 KB Output is correct
50 Correct 187 ms 4080 KB Output is correct
51 Incorrect 342 ms 4076 KB Incorrect
52 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -