oj.uz

Submission #861646

# Submission time Handle Problem Language Result Execution time Memory
861646 2023-10-16T15:33:46 Z faustaadp Longest Trip (IOI23_longesttrip) C++17
40 / 100
 812 ms 5624 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 >= 1000)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;
    }
    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 170 ms 4644 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 30 ms 3672 KB Output is correct
3 Correct 130 ms 3828 KB Output is correct
4 Correct 331 ms 3740 KB Output is correct
5 Correct 736 ms 4540 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3416 KB Output is correct
2 Correct 24 ms 3416 KB Output is correct
3 Correct 134 ms 4184 KB Output is correct
4 Correct 380 ms 4188 KB Output is correct
5 Correct 772 ms 4444 KB Output is correct
6 Correct 13 ms 3416 KB Output is correct
7 Correct 27 ms 3416 KB Output is correct
8 Correct 140 ms 3928 KB Output is correct
9 Correct 286 ms 3636 KB Output is correct
10 Correct 750 ms 4708 KB Output is correct
11 Correct 702 ms 5016 KB Output is correct
12 Correct 738 ms 4264 KB Output is correct
13 Correct 763 ms 4608 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3416 KB Output is correct
2 Correct 25 ms 3416 KB Output is correct
3 Correct 135 ms 4092 KB Output is correct
4 Correct 364 ms 3904 KB Output is correct
5 Correct 720 ms 4572 KB Output is correct
6 Correct 13 ms 3416 KB Output is correct
7 Correct 26 ms 3416 KB Output is correct
8 Correct 129 ms 3928 KB Output is correct
9 Correct 274 ms 3672 KB Output is correct
10 Correct 739 ms 4416 KB Output is correct
11 Correct 727 ms 4496 KB Output is correct
12 Correct 743 ms 4504 KB Output is correct
13 Correct 713 ms 4736 KB Output is correct
14 Correct 13 ms 3416 KB Output is correct
15 Correct 12 ms 3416 KB Output is correct
16 Correct 38 ms 3416 KB Output is correct
17 Correct 81 ms 3580 KB Output is correct
18 Correct 129 ms 3668 KB Output is correct
19 Correct 270 ms 4004 KB Output is correct
20 Correct 284 ms 4092 KB Output is correct
21 Correct 747 ms 4932 KB Output is correct
22 Correct 754 ms 4180 KB Output is correct
23 Correct 765 ms 4944 KB Output is correct
24 Correct 756 ms 4520 KB Output is correct
25 Correct 15 ms 3416 KB Output is correct
26 Correct 13 ms 3416 KB Output is correct
27 Correct 25 ms 3416 KB Output is correct
28 Correct 24 ms 3416 KB Output is correct
29 Correct 26 ms 3416 KB Output is correct
30 Correct 174 ms 3832 KB Output is correct
31 Correct 164 ms 3848 KB Output is correct
32 Correct 176 ms 4080 KB Output is correct
33 Correct 315 ms 3940 KB Output is correct
34 Correct 278 ms 4264 KB Output is correct
35 Correct 299 ms 4644 KB Output is correct
36 Correct 752 ms 4824 KB Output is correct
37 Correct 765 ms 4152 KB Output is correct
38 Correct 802 ms 5148 KB Output is correct
39 Correct 780 ms 5116 KB Output is correct
40 Correct 762 ms 5068 KB Output is correct
41 Correct 812 ms 4084 KB Output is correct
42 Correct 725 ms 4092 KB Output is correct
43 Correct 729 ms 5080 KB Output is correct
44 Correct 767 ms 4996 KB Output is correct
45 Correct 13 ms 3416 KB Output is correct
46 Correct 13 ms 3416 KB Output is correct
47 Correct 26 ms 3416 KB Output is correct
48 Correct 26 ms 3416 KB Output is correct
49 Correct 28 ms 3672 KB Output is correct
50 Correct 182 ms 4336 KB Output is correct
51 Correct 182 ms 4092 KB Output is correct
52 Correct 176 ms 4080 KB Output is correct
53 Correct 292 ms 4184 KB Output is correct
54 Correct 293 ms 3812 KB Output is correct
55 Correct 267 ms 3956 KB Output is correct
56 Correct 747 ms 4760 KB Output is correct
57 Correct 775 ms 4760 KB Output is correct
58 Correct 793 ms 4692 KB Output is correct
59 Correct 766 ms 5176 KB Output is correct
60 Correct 789 ms 5624 KB Output is correct
61 Correct 739 ms 4084 KB Output is correct
62 Correct 772 ms 4372 KB Output is correct
63 Correct 760 ms 4652 KB Output is correct
64 Correct 736 ms 5352 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3568 KB Output is correct
2 Correct 25 ms 3416 KB Output is correct
3 Partially correct 134 ms 4184 KB Output is partially correct
4 Partially correct 367 ms 4228 KB Output is partially correct
5 Partially correct 707 ms 4096 KB Output is partially correct
6 Correct 15 ms 3416 KB Output is correct
7 Correct 30 ms 3416 KB Output is correct
8 Partially correct 150 ms 4092 KB Output is partially correct
9 Partially correct 273 ms 3664 KB Output is partially correct
10 Partially correct 692 ms 4108 KB Output is partially correct
11 Partially correct 708 ms 4108 KB Output is partially correct
12 Partially correct 726 ms 4212 KB Output is partially correct
13 Partially correct 715 ms 4108 KB Output is partially correct
14 Correct 15 ms 3416 KB Output is correct
15 Correct 16 ms 3416 KB Output is correct
16 Incorrect 7 ms 3416 KB Incorrect
17 Halted 0 ms 0 KB -