oj.uz

Submission #861651

# Submission time Handle Problem Language Result Execution time Memory
861651 2023-10-16T15:40:34 Z faustaadp Longest Trip (IOI23_longesttrip) C++17
40 / 100
 999 ms 5728 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 >= n * 10 + 100)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(ll i = 0; i < N; i++)
    {
        coba = 0;
        dfs(i);
        ret.clear();
        if(ada == 2)ada = 0;
        // if(ret.size() == mxx)break;
    }
    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: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 Correct 1 ms 3416 KB Output is correct
2 Correct 178 ms 4440 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3416 KB Output is correct
2 Correct 22 ms 3416 KB Output is correct
3 Correct 125 ms 4180 KB Output is correct
4 Correct 385 ms 3892 KB Output is correct
5 Correct 856 ms 4448 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 3416 KB Output is correct
2 Correct 22 ms 3416 KB Output is correct
3 Correct 127 ms 3672 KB Output is correct
4 Correct 361 ms 3688 KB Output is correct
5 Correct 828 ms 4564 KB Output is correct
6 Correct 13 ms 3416 KB Output is correct
7 Correct 22 ms 3668 KB Output is correct
8 Correct 119 ms 3928 KB Output is correct
9 Correct 269 ms 3984 KB Output is correct
10 Correct 840 ms 4784 KB Output is correct
11 Correct 840 ms 4352 KB Output is correct
12 Correct 861 ms 4604 KB Output is correct
13 Correct 847 ms 4320 KB Output is correct

Subtask #3
25.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 127 ms 3672 KB Output is correct
4 Correct 347 ms 3648 KB Output is correct
5 Correct 857 ms 4096 KB Output is correct
6 Correct 15 ms 3672 KB Output is correct
7 Correct 25 ms 3416 KB Output is correct
8 Correct 125 ms 3672 KB Output is correct
9 Correct 277 ms 4456 KB Output is correct
10 Correct 864 ms 4784 KB Output is correct
11 Correct 846 ms 4904 KB Output is correct
12 Correct 849 ms 4352 KB Output is correct
13 Correct 859 ms 4200 KB Output is correct
14 Correct 13 ms 3412 KB Output is correct
15 Correct 14 ms 3672 KB Output is correct
16 Correct 34 ms 3416 KB Output is correct
17 Correct 75 ms 3672 KB Output is correct
18 Correct 129 ms 4184 KB Output is correct
19 Correct 287 ms 4484 KB Output is correct
20 Correct 283 ms 4464 KB Output is correct
21 Correct 787 ms 4680 KB Output is correct
22 Correct 793 ms 4244 KB Output is correct
23 Correct 816 ms 4156 KB Output is correct
24 Correct 931 ms 4780 KB Output is correct
25 Correct 17 ms 3672 KB Output is correct
26 Correct 14 ms 3672 KB Output is correct
27 Correct 24 ms 3672 KB Output is correct
28 Correct 26 ms 3416 KB Output is correct
29 Correct 29 ms 3416 KB Output is correct
30 Correct 193 ms 3856 KB Output is correct
31 Correct 190 ms 4092 KB Output is correct
32 Correct 178 ms 3848 KB Output is correct
33 Correct 301 ms 4112 KB Output is correct
34 Correct 331 ms 4068 KB Output is correct
35 Correct 288 ms 3740 KB Output is correct
36 Correct 908 ms 4196 KB Output is correct
37 Correct 896 ms 4408 KB Output is correct
38 Correct 863 ms 4908 KB Output is correct
39 Correct 915 ms 5228 KB Output is correct
40 Correct 858 ms 5220 KB Output is correct
41 Correct 957 ms 4300 KB Output is correct
42 Correct 811 ms 3908 KB Output is correct
43 Correct 799 ms 4832 KB Output is correct
44 Correct 801 ms 5056 KB Output is correct
45 Correct 14 ms 3416 KB Output is correct
46 Correct 13 ms 3416 KB Output is correct
47 Correct 22 ms 3672 KB Output is correct
48 Correct 24 ms 3416 KB Output is correct
49 Correct 23 ms 3416 KB Output is correct
50 Correct 176 ms 4084 KB Output is correct
51 Correct 184 ms 3824 KB Output is correct
52 Correct 154 ms 4076 KB Output is correct
53 Correct 301 ms 4124 KB Output is correct
54 Correct 277 ms 3824 KB Output is correct
55 Correct 286 ms 4216 KB Output is correct
56 Correct 880 ms 5012 KB Output is correct
57 Correct 917 ms 4656 KB Output is correct
58 Correct 824 ms 5308 KB Output is correct
59 Correct 806 ms 5728 KB Output is correct
60 Correct 920 ms 5516 KB Output is correct
61 Correct 815 ms 3848 KB Output is correct
62 Correct 812 ms 4328 KB Output is correct
63 Correct 838 ms 4636 KB Output is correct
64 Correct 942 ms 5188 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3416 KB Output is correct
2 Correct 23 ms 3416 KB Output is correct
3 Partially correct 138 ms 4340 KB Output is partially correct
4 Partially correct 390 ms 3940 KB Output is partially correct
5 Partially correct 999 ms 4092 KB Output is partially correct
6 Correct 15 ms 3672 KB Output is correct
7 Correct 25 ms 3416 KB Output is correct
8 Partially correct 127 ms 3588 KB Output is partially correct
9 Partially correct 314 ms 3676 KB Output is partially correct
10 Partially correct 961 ms 4608 KB Output is partially correct
11 Partially correct 967 ms 4112 KB Output is partially correct
12 Partially correct 892 ms 4104 KB Output is partially correct
13 Partially correct 907 ms 4108 KB Output is partially correct
14 Correct 14 ms 3416 KB Output is correct
15 Correct 18 ms 3416 KB Output is correct
16 Incorrect 8 ms 3568 KB Incorrect
17 Halted 0 ms 0 KB -