oj.uz

답안 #861653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861653 2023-10-16T15:41:49 Z faustaadp 가장 긴 여행 (IOI23_longesttrip) C++17
25 / 100
 1000 ms 5328 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 * 12 + 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++)
      |                   ~~^~~~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:102: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]
  102 |         if(ret.size() == mxx)break;
      |            ~~~~~~~~~~~^~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3672 KB Output is correct
2 Correct 227 ms 4816 KB Output is correct

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3416 KB Output is correct
2 Correct 30 ms 3416 KB Output is correct
3 Correct 172 ms 4184 KB Output is correct
4 Correct 449 ms 4360 KB Output is correct
5 Execution timed out 1016 ms 4348 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 3416 KB Output is correct
2 Correct 28 ms 3672 KB Output is correct
3 Correct 143 ms 3964 KB Output is correct
4 Correct 417 ms 3944 KB Output is correct
5 Correct 980 ms 4956 KB Output is correct
6 Correct 13 ms 3416 KB Output is correct
7 Correct 26 ms 3416 KB Output is correct
8 Correct 139 ms 3700 KB Output is correct
9 Correct 313 ms 4428 KB Output is correct
10 Correct 961 ms 4200 KB Output is correct
11 Execution timed out 1018 ms 4476 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 3672 KB Output is correct
2 Correct 31 ms 3672 KB Output is correct
3 Correct 168 ms 4340 KB Output is correct
4 Correct 397 ms 3872 KB Output is correct
5 Correct 930 ms 4100 KB Output is correct
6 Correct 14 ms 3416 KB Output is correct
7 Correct 29 ms 3416 KB Output is correct
8 Correct 130 ms 3588 KB Output is correct
9 Correct 283 ms 3888 KB Output is correct
10 Correct 830 ms 4104 KB Output is correct
11 Correct 850 ms 4212 KB Output is correct
12 Correct 853 ms 4444 KB Output is correct
13 Correct 878 ms 4324 KB Output is correct
14 Correct 17 ms 3416 KB Output is correct
15 Correct 19 ms 3416 KB Output is correct
16 Correct 39 ms 3564 KB Output is correct
17 Correct 78 ms 3928 KB Output is correct
18 Correct 136 ms 3952 KB Output is correct
19 Correct 278 ms 4420 KB Output is correct
20 Correct 274 ms 4156 KB Output is correct
21 Correct 869 ms 4028 KB Output is correct
22 Correct 889 ms 4560 KB Output is correct
23 Correct 844 ms 4352 KB Output is correct
24 Correct 834 ms 4556 KB Output is correct
25 Correct 16 ms 3416 KB Output is correct
26 Correct 17 ms 3416 KB Output is correct
27 Correct 27 ms 3416 KB Output is correct
28 Correct 30 ms 3672 KB Output is correct
29 Correct 29 ms 3416 KB Output is correct
30 Correct 197 ms 3780 KB Output is correct
31 Correct 168 ms 3852 KB Output is correct
32 Correct 184 ms 3820 KB Output is correct
33 Correct 281 ms 3892 KB Output is correct
34 Correct 286 ms 3656 KB Output is correct
35 Correct 295 ms 4116 KB Output is correct
36 Correct 872 ms 4580 KB Output is correct
37 Correct 915 ms 4664 KB Output is correct
38 Correct 896 ms 4988 KB Output is correct
39 Correct 884 ms 5328 KB Output is correct
40 Correct 857 ms 4516 KB Output is correct
41 Correct 879 ms 3824 KB Output is correct
42 Correct 886 ms 3908 KB Output is correct
43 Correct 800 ms 4660 KB Output is correct
44 Correct 789 ms 4880 KB Output is correct
45 Correct 14 ms 3416 KB Output is correct
46 Correct 13 ms 3416 KB Output is correct
47 Correct 23 ms 3672 KB Output is correct
48 Correct 23 ms 3412 KB Output is correct
49 Correct 25 ms 3416 KB Output is correct
50 Correct 180 ms 3576 KB Output is correct
51 Correct 165 ms 4332 KB Output is correct
52 Correct 175 ms 4332 KB Output is correct
53 Correct 288 ms 4216 KB Output is correct
54 Correct 264 ms 3884 KB Output is correct
55 Correct 282 ms 4456 KB Output is correct
56 Correct 857 ms 4684 KB Output is correct
57 Correct 883 ms 4776 KB Output is correct
58 Correct 850 ms 4772 KB Output is correct
59 Correct 818 ms 4692 KB Output is correct
60 Correct 817 ms 5072 KB Output is correct
61 Correct 811 ms 4140 KB Output is correct
62 Correct 794 ms 4592 KB Output is correct
63 Correct 838 ms 4856 KB Output is correct
64 Correct 775 ms 5204 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 3416 KB Output is correct
2 Correct 24 ms 3416 KB Output is correct
3 Partially correct 129 ms 3672 KB Output is partially correct
4 Partially correct 371 ms 4272 KB Output is partially correct
5 Partially correct 886 ms 4600 KB Output is partially correct
6 Correct 13 ms 3416 KB Output is correct
7 Correct 26 ms 3416 KB Output is correct
8 Partially correct 125 ms 3588 KB Output is partially correct
9 Partially correct 291 ms 4184 KB Output is partially correct
10 Partially correct 845 ms 4244 KB Output is partially correct
11 Partially correct 831 ms 4600 KB Output is partially correct
12 Partially correct 854 ms 4580 KB Output is partially correct
13 Partially correct 866 ms 4656 KB Output is partially correct
14 Correct 14 ms 3416 KB Output is correct
15 Correct 15 ms 3416 KB Output is correct
16 Incorrect 6 ms 3416 KB Incorrect
17 Halted 0 ms 0 KB -