oj.uz

Submission #861631

# Submission time Handle Problem Language Result Execution time Memory
861631 2023-10-16T15:21:41 Z faustaadp Longest Trip (IOI23_longesttrip) C++17
0 / 100
 767 ms 5320 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 >= 10000)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;
    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)
    {
        dfs(aa);
        if(ada == 2)
            ada = 0;
    }
    return ret;
    // 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:21: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]
   21 |     if(ret.size() * 2 >= mxx)ada = 1;
      |        ~~~~~~~~~~~~~~~^~~~~~
longesttrip.cpp:24: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]
   24 |     for(ll i = 0; i < v[pos].size(); i++)
      |                   ~~^~~~~~~~~~~~~~~
longesttrip.cpp: In function 'void dfs2(ll)':
longesttrip.cpp:38: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]
   38 |     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 2 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3564 KB Output is correct
2 Correct 26 ms 3416 KB Output is correct
3 Correct 128 ms 3852 KB Output is correct
4 Correct 330 ms 4344 KB Output is correct
5 Correct 710 ms 4228 KB Output is correct
6 Correct 12 ms 3416 KB Output is correct
7 Correct 24 ms 3416 KB Output is correct
8 Correct 115 ms 3684 KB Output is correct
9 Correct 255 ms 4612 KB Output is correct
10 Correct 736 ms 4480 KB Output is correct
11 Correct 693 ms 4356 KB Output is correct
12 Correct 699 ms 4592 KB Output is correct
13 Correct 704 ms 4208 KB Output is correct
14 Correct 12 ms 3416 KB Output is correct
15 Correct 14 ms 3416 KB Output is correct
16 Correct 36 ms 3416 KB Output is correct
17 Correct 67 ms 3672 KB Output is correct
18 Correct 118 ms 3928 KB Output is correct
19 Correct 246 ms 3956 KB Output is correct
20 Correct 250 ms 3980 KB Output is correct
21 Correct 680 ms 5224 KB Output is correct
22 Correct 711 ms 4368 KB Output is correct
23 Correct 705 ms 4276 KB Output is correct
24 Correct 695 ms 4540 KB Output is correct
25 Correct 14 ms 3416 KB Output is correct
26 Correct 13 ms 3416 KB Output is correct
27 Correct 24 ms 3416 KB Output is correct
28 Correct 26 ms 3416 KB Output is correct
29 Correct 23 ms 3416 KB Output is correct
30 Correct 174 ms 3588 KB Output is correct
31 Correct 156 ms 4088 KB Output is correct
32 Correct 149 ms 3588 KB Output is correct
33 Correct 252 ms 4072 KB Output is correct
34 Correct 255 ms 3884 KB Output is correct
35 Correct 259 ms 4132 KB Output is correct
36 Correct 767 ms 4144 KB Output is correct
37 Correct 739 ms 4904 KB Output is correct
38 Correct 708 ms 5068 KB Output is correct
39 Correct 707 ms 4780 KB Output is correct
40 Correct 701 ms 5320 KB Output is correct
41 Correct 687 ms 3824 KB Output is correct
42 Correct 687 ms 4072 KB Output is correct
43 Correct 673 ms 4840 KB Output is correct
44 Correct 673 ms 4844 KB Output is correct
45 Correct 14 ms 3416 KB Output is correct
46 Correct 14 ms 3416 KB Output is correct
47 Correct 24 ms 3568 KB Output is correct
48 Correct 26 ms 3416 KB Output is correct
49 Correct 21 ms 3416 KB Output is correct
50 Correct 159 ms 3852 KB Output is correct
51 Incorrect 10 ms 3592 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 -