Submission #1079626

# Submission time Handle Problem Language Result Execution time Memory
1079626 2024-08-28T19:09:19 Z c2zi6 Longest Trip (IOI23_longesttrip) C++17
45 / 100
981 ms 1724 KB
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "longesttrip.h"

int n;
VVI gp;
VVI edges;

VI rev(VI a) {
    reverse(all(a));
    return a;
}

VI longest_trip(int N, int D) {
    assert(D == 1);
    n = N;
    gp = VVI(n);
    edges = VVI(n, VI(n));
    replr(i, 0, n-1) {
        replr(j, i+1, n-1) {
            if (are_connected({i}, {j})) {
                gp[i].pb(j);
                gp[j].pb(i);
                edges[i][j] = edges[j][i] = true;
            }
        }
    }
    VI path1;
    VI path2;
    path1.pb(0);
    path2.pb(1);
    replr(u, 2, n-1) {
        if (edges[path1.back()][u]) path1.pb(u);
        else if (edges[path2.back()][u]) path2.pb(u);
        else {
            for (int u : rev(path2)) path1.pb(u);
            path2 = VI{u};
        }
    }

    if (edges[path2[0]][path1[0]]) {
        VI ans;
        for (int x : rev(path2)) ans.pb(x);
        for (int x : path1) ans.pb(x);
        return ans;
    }
    if (edges[path2.back()][path1[0]]) {
        VI ans;
        for (int x : path2) ans.pb(x);
        for (int x : path1) ans.pb(x);
        return ans;
    }
    if (edges[path1.back()][path2[0]]) {
        VI ans;
        for (int x : path1) ans.pb(x);
        for (int x : path2) ans.pb(x);
        return ans;
    }
    int ind1 = -1;
    int ind2 = -1;
    rep(i, path1.size()) {
        rep(j, path2.size()) {
            if (edges[path1[i]][path2[j]]) {
                ind1 = i;
                ind2 = j;
                break;
            }
        }
    }
    if (ind1 == -1) {
        if (path1.size() > path2.size()) return path1;
        return path2;
    }
    VI ans;
    replr(i, ind2+1, ind2+1 + path2.size()-1) {
        ans.pb(path2[i%(int)path2.size()]);
    }
    replr(i, ind1, ind1 + path1.size()-1) {
        ans.pb(path1[i%(int)path1.size()]);
    }
    /*cout << "ind1: " << ind1 << endl;*/
    /*cout << "ind2: " << ind2 << endl;*/
    /*for (int x : path1) cout << x << " "; cout << endl;*/
    /*for (int x : path2) cout << x << " "; cout << endl;*/
    return ans;
    if (path1.size() > path2.size()) return path1;
    return path2;
}


# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 210 ms 984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 27 ms 344 KB Output is correct
3 Correct 150 ms 592 KB Output is correct
4 Correct 420 ms 848 KB Output is correct
5 Correct 872 ms 1048 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 122 ms 344 KB Output is correct
9 Correct 321 ms 752 KB Output is correct
10 Correct 862 ms 1236 KB Output is correct
11 Correct 858 ms 1240 KB Output is correct
12 Correct 851 ms 1104 KB Output is correct
13 Correct 853 ms 1500 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 41 ms 344 KB Output is correct
17 Correct 93 ms 344 KB Output is correct
18 Correct 164 ms 596 KB Output is correct
19 Correct 324 ms 796 KB Output is correct
20 Correct 272 ms 1028 KB Output is correct
21 Correct 833 ms 1056 KB Output is correct
22 Correct 880 ms 1096 KB Output is correct
23 Correct 883 ms 1724 KB Output is correct
24 Correct 802 ms 1520 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 22 ms 344 KB Output is correct
28 Correct 35 ms 344 KB Output is correct
29 Correct 15 ms 344 KB Output is correct
30 Correct 162 ms 592 KB Output is correct
31 Correct 188 ms 460 KB Output is correct
32 Correct 188 ms 344 KB Output is correct
33 Correct 339 ms 748 KB Output is correct
34 Correct 313 ms 796 KB Output is correct
35 Correct 306 ms 532 KB Output is correct
36 Correct 871 ms 1476 KB Output is correct
37 Correct 829 ms 1288 KB Output is correct
38 Correct 870 ms 1364 KB Output is correct
39 Correct 825 ms 1108 KB Output is correct
40 Correct 907 ms 980 KB Output is correct
41 Correct 866 ms 1452 KB Output is correct
42 Correct 853 ms 1228 KB Output is correct
43 Correct 919 ms 1080 KB Output is correct
44 Correct 812 ms 1180 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 11 ms 344 KB Output is correct
47 Correct 21 ms 344 KB Output is correct
48 Correct 21 ms 344 KB Output is correct
49 Correct 20 ms 344 KB Output is correct
50 Correct 194 ms 592 KB Output is correct
51 Correct 196 ms 600 KB Output is correct
52 Correct 191 ms 592 KB Output is correct
53 Correct 299 ms 540 KB Output is correct
54 Correct 324 ms 792 KB Output is correct
55 Correct 295 ms 784 KB Output is correct
56 Correct 877 ms 1016 KB Output is correct
57 Correct 879 ms 1064 KB Output is correct
58 Correct 875 ms 976 KB Output is correct
59 Correct 862 ms 1384 KB Output is correct
60 Correct 877 ms 1104 KB Output is correct
61 Correct 819 ms 1176 KB Output is correct
62 Correct 841 ms 1104 KB Output is correct
63 Correct 844 ms 1240 KB Output is correct
64 Correct 853 ms 1468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 20 ms 344 KB Output is correct
3 Partially correct 150 ms 456 KB Output is partially correct
4 Partially correct 426 ms 832 KB Output is partially correct
5 Partially correct 842 ms 1348 KB Output is partially correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 24 ms 344 KB Output is correct
8 Partially correct 139 ms 344 KB Output is partially correct
9 Partially correct 311 ms 540 KB Output is partially correct
10 Partially correct 840 ms 1232 KB Output is partially correct
11 Partially correct 839 ms 1396 KB Output is partially correct
12 Partially correct 790 ms 1364 KB Output is partially correct
13 Partially correct 819 ms 1236 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 34 ms 344 KB Output is correct
17 Partially correct 96 ms 344 KB Output is partially correct
18 Partially correct 175 ms 684 KB Output is partially correct
19 Partially correct 314 ms 596 KB Output is partially correct
20 Partially correct 274 ms 548 KB Output is partially correct
21 Correct 12 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 20 ms 340 KB Output is correct
24 Correct 34 ms 344 KB Output is correct
25 Correct 21 ms 344 KB Output is correct
26 Partially correct 169 ms 600 KB Output is partially correct
27 Partially correct 192 ms 468 KB Output is partially correct
28 Partially correct 215 ms 716 KB Output is partially correct
29 Partially correct 310 ms 540 KB Output is partially correct
30 Partially correct 289 ms 1036 KB Output is partially correct
31 Partially correct 310 ms 540 KB Output is partially correct
32 Correct 12 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 22 ms 344 KB Output is correct
35 Correct 24 ms 340 KB Output is correct
36 Correct 18 ms 344 KB Output is correct
37 Partially correct 210 ms 460 KB Output is partially correct
38 Partially correct 207 ms 600 KB Output is partially correct
39 Partially correct 200 ms 468 KB Output is partially correct
40 Partially correct 280 ms 592 KB Output is partially correct
41 Partially correct 292 ms 540 KB Output is partially correct
42 Partially correct 309 ms 784 KB Output is partially correct
43 Partially correct 895 ms 1428 KB Output is partially correct
44 Partially correct 859 ms 1480 KB Output is partially correct
45 Partially correct 846 ms 1268 KB Output is partially correct
46 Partially correct 848 ms 1264 KB Output is partially correct
47 Partially correct 849 ms 980 KB Output is partially correct
48 Partially correct 789 ms 1192 KB Output is partially correct
49 Partially correct 858 ms 1228 KB Output is partially correct
50 Partially correct 823 ms 1576 KB Output is partially correct
51 Partially correct 842 ms 1504 KB Output is partially correct
52 Partially correct 829 ms 1128 KB Output is partially correct
53 Partially correct 787 ms 992 KB Output is partially correct
54 Partially correct 869 ms 980 KB Output is partially correct
55 Partially correct 858 ms 1236 KB Output is partially correct
56 Partially correct 872 ms 1308 KB Output is partially correct
57 Partially correct 860 ms 1104 KB Output is partially correct
58 Partially correct 812 ms 1308 KB Output is partially correct
59 Partially correct 811 ms 1148 KB Output is partially correct
60 Partially correct 855 ms 984 KB Output is partially correct
61 Partially correct 818 ms 1000 KB Output is partially correct
62 Partially correct 822 ms 1228 KB Output is partially correct
63 Partially correct 825 ms 1140 KB Output is partially correct
64 Partially correct 825 ms 1240 KB Output is partially correct
65 Partially correct 843 ms 1364 KB Output is partially correct
66 Partially correct 865 ms 1120 KB Output is partially correct
67 Partially correct 847 ms 1004 KB Output is partially correct
68 Partially correct 873 ms 980 KB Output is partially correct
69 Partially correct 896 ms 1576 KB Output is partially correct
70 Partially correct 940 ms 1076 KB Output is partially correct
71 Partially correct 869 ms 1224 KB Output is partially correct
72 Partially correct 845 ms 1128 KB Output is partially correct
73 Partially correct 981 ms 1564 KB Output is partially correct
74 Partially correct 917 ms 1356 KB Output is partially correct
75 Partially correct 884 ms 1548 KB Output is partially correct
76 Partially correct 833 ms 988 KB Output is partially correct
77 Partially correct 915 ms 1388 KB Output is partially correct
78 Partially correct 852 ms 992 KB Output is partially correct
79 Partially correct 889 ms 1584 KB Output is partially correct
80 Partially correct 901 ms 1316 KB Output is partially correct
81 Partially correct 836 ms 1288 KB Output is partially correct
82 Partially correct 846 ms 1232 KB Output is partially correct