oj.uz

답안 #861628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861628 2023-10-16T15:16:17 Z faustaadp 가장 긴 여행 (IOI23_longesttrip) C++17
0 / 100
 801 ms 4800 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;
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 = 1;
    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] = 1;
    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])
        {
            now = 0;
            dfs2(i);
        }
    for(ll i = 0; i < N; i++)
    {
        b[i] = 0;
    }
    for(ll i = 0; i < N; i++)
        if(!b[i])
        {
            now = 0;
            dfs2(i);
            if(now == mxx)
            {
                 for(ll j = 0; j < N; j++)
                    {
                        b[j] = 0;
                    }
                dfs(i);
                return ret;
            }
        }
    // 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++)
      |                   ~~^~~~~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:115:1: warning: control reaches end of non-void function [-Wreturn-type]
  115 | }
      | ^

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 2648 KB Output is correct
2 Correct 25 ms 2648 KB Output is correct
3 Correct 124 ms 2648 KB Output is correct
4 Correct 334 ms 3440 KB Output is correct
5 Correct 711 ms 4116 KB Output is correct
6 Correct 6 ms 2648 KB Output is correct
7 Correct 21 ms 2648 KB Output is correct
8 Correct 124 ms 3416 KB Output is correct
9 Correct 241 ms 3380 KB Output is correct
10 Correct 801 ms 4416 KB Output is correct
11 Correct 735 ms 3920 KB Output is correct
12 Correct 730 ms 3980 KB Output is correct
13 Correct 688 ms 4092 KB Output is correct
14 Correct 7 ms 2648 KB Output is correct
15 Correct 12 ms 2648 KB Output is correct
16 Correct 52 ms 2648 KB Output is correct
17 Correct 74 ms 2904 KB Output is correct
18 Correct 124 ms 3160 KB Output is correct
19 Correct 282 ms 3204 KB Output is correct
20 Correct 233 ms 3576 KB Output is correct
21 Correct 707 ms 4800 KB Output is correct
22 Correct 754 ms 4572 KB Output is correct
23 Correct 734 ms 4456 KB Output is correct
24 Correct 752 ms 4552 KB Output is correct
25 Correct 11 ms 2648 KB Output is correct
26 Correct 9 ms 2648 KB Output is correct
27 Correct 21 ms 2648 KB Output is correct
28 Correct 22 ms 2648 KB Output is correct
29 Correct 23 ms 2648 KB Output is correct
30 Correct 173 ms 3068 KB Output is correct
31 Correct 169 ms 3304 KB Output is correct
32 Correct 157 ms 3052 KB Output is correct
33 Correct 257 ms 2904 KB Output is correct
34 Correct 243 ms 3456 KB Output is correct
35 Correct 255 ms 3592 KB Output is correct
36 Correct 724 ms 4108 KB Output is correct
37 Correct 747 ms 4100 KB Output is correct
38 Correct 733 ms 4128 KB Output is correct
39 Correct 719 ms 4328 KB Output is correct
40 Correct 716 ms 4468 KB Output is correct
41 Correct 738 ms 4380 KB Output is correct
42 Correct 699 ms 4180 KB Output is correct
43 Correct 761 ms 4200 KB Output is correct
44 Correct 684 ms 4048 KB Output is correct
45 Correct 10 ms 2648 KB Output is correct
46 Correct 8 ms 2648 KB Output is correct
47 Correct 25 ms 2904 KB Output is correct
48 Correct 20 ms 2904 KB Output is correct
49 Correct 22 ms 2904 KB Output is correct
50 Correct 154 ms 3308 KB Output is correct
51 Incorrect 10 ms 3564 KB Incorrect
52 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

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