oj.uz

답안 #861637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861637 2023-10-16T15:27:30 Z faustaadp 가장 긴 여행 (IOI23_longesttrip) C++17
0 / 100
 754 ms 5340 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 >= 1000000)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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3416 KB Output is correct
2 Correct 22 ms 3416 KB Output is correct
3 Correct 116 ms 4184 KB Output is correct
4 Correct 328 ms 3836 KB Output is correct
5 Correct 700 ms 4540 KB Output is correct
6 Correct 12 ms 3416 KB Output is correct
7 Correct 23 ms 3416 KB Output is correct
8 Correct 115 ms 3672 KB Output is correct
9 Correct 252 ms 4080 KB Output is correct
10 Correct 704 ms 4656 KB Output is correct
11 Correct 691 ms 4844 KB Output is correct
12 Correct 700 ms 4380 KB Output is correct
13 Correct 710 ms 4756 KB Output is correct
14 Correct 12 ms 3416 KB Output is correct
15 Correct 14 ms 3416 KB Output is correct
16 Correct 39 ms 3416 KB Output is correct
17 Correct 71 ms 3928 KB Output is correct
18 Correct 119 ms 4180 KB Output is correct
19 Correct 256 ms 3872 KB Output is correct
20 Correct 244 ms 3968 KB Output is correct
21 Correct 685 ms 5148 KB Output is correct
22 Correct 705 ms 4704 KB Output is correct
23 Correct 723 ms 4780 KB Output is correct
24 Correct 729 ms 4336 KB Output is correct
25 Correct 13 ms 3416 KB Output is correct
26 Correct 13 ms 3416 KB Output is correct
27 Correct 23 ms 3416 KB Output is correct
28 Correct 24 ms 3416 KB Output is correct
29 Correct 23 ms 3416 KB Output is correct
30 Correct 155 ms 3576 KB Output is correct
31 Correct 146 ms 4328 KB Output is correct
32 Correct 163 ms 3824 KB Output is correct
33 Correct 252 ms 3924 KB Output is correct
34 Correct 248 ms 4096 KB Output is correct
35 Correct 258 ms 4188 KB Output is correct
36 Correct 701 ms 4084 KB Output is correct
37 Correct 709 ms 4916 KB Output is correct
38 Correct 690 ms 5340 KB Output is correct
39 Correct 702 ms 4640 KB Output is correct
40 Correct 660 ms 4876 KB Output is correct
41 Correct 739 ms 4564 KB Output is correct
42 Correct 724 ms 4620 KB Output is correct
43 Correct 736 ms 4804 KB Output is correct
44 Correct 754 ms 5284 KB Output is correct
45 Correct 13 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 26 ms 3416 KB Output is correct
49 Correct 23 ms 3416 KB Output is correct
50 Correct 151 ms 4328 KB Output is correct
51 Incorrect 154 ms 4328 KB Incorrect
52 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3416 KB Incorrect
2 Halted 0 ms 0 KB -