oj.uz

Submission #1079633

# Submission time Handle Problem Language Result Execution time Memory
1079633 2024-08-28T19:28:25 Z c2zi6 Longest Trip (IOI23_longesttrip) C++17
70 / 100
 70 ms 600 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;

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

// int are_connected(VI a, VI b);

VI longest_trip(int N, int D) {
    n = N;
    VI path1;
    VI path2;
    path1.pb(0);
    path2.pb(1);
    replr(u, 2, n-1) {
        if (are_connected({path1.back()}, {u})) path1.pb(u);
        else if (are_connected({path2.back()}, {u})) path2.pb(u);
        else {
            for (int u : rev(path2)) path1.pb(u);
            path2 = VI{u};
        }
    }

    if (are_connected({path2[0]}, {path1[0]})) {
        VI ans;
        for (int x : rev(path2)) ans.pb(x);
        for (int x : path1) ans.pb(x);
        return ans;
    }
    if (are_connected({path2.back()}, {path1[0]})) {
        VI ans;
        for (int x : path2) ans.pb(x);
        for (int x : path1) ans.pb(x);
        return ans;
    }
    if (are_connected({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()) {
        auto ardyoq = [&](int x) {
            VI tmp;
            rep(i, x+1) tmp.pb(path2[i]);
            return are_connected({path1[i]}, tmp);
        };
        int l = -1, r = path2.size();
        while (l + 1 < r) {
            int m = (l + r) / 2;
            if (ardyoq(m)) r = m;
            else l = m;
        }
        if (r == path2.size()) continue;
        ind1 = i;
        ind2 = r;
        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()]);
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'VI longest_trip(int, int)':
longesttrip.cpp:91:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         if (r == path2.size()) continue;
      |             ~~^~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 436 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 7 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 12 ms 344 KB Output is correct
15 Correct 19 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 9 ms 344 KB Output is correct
21 Correct 6 ms 436 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 12 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 10 ms 344 KB Output is correct
29 Correct 11 ms 340 KB Output is correct
30 Correct 10 ms 596 KB Output is correct
31 Correct 20 ms 340 KB Output is correct
32 Correct 39 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 11 ms 344 KB Output is correct
35 Correct 17 ms 344 KB Output is correct
36 Correct 11 ms 344 KB Output is correct
37 Correct 39 ms 344 KB Output is correct
38 Correct 44 ms 344 KB Output is correct
39 Correct 58 ms 344 KB Output is correct
40 Correct 51 ms 416 KB Output is correct
41 Correct 59 ms 344 KB Output is correct
42 Correct 50 ms 344 KB Output is correct
43 Correct 49 ms 600 KB Output is correct
44 Correct 70 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 9 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Correct 11 ms 344 KB Output is correct
51 Correct 14 ms 344 KB Output is correct
52 Correct 17 ms 344 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 12 ms 344 KB Output is correct
55 Correct 9 ms 344 KB Output is correct
56 Correct 7 ms 344 KB Output is correct
57 Correct 14 ms 412 KB Output is correct
58 Correct 25 ms 344 KB Output is correct
59 Correct 46 ms 592 KB Output is correct
60 Correct 47 ms 600 KB Output is correct
61 Correct 14 ms 344 KB Output is correct
62 Correct 38 ms 344 KB Output is correct
63 Correct 26 ms 344 KB Output is correct
64 Correct 29 ms 344 KB Output is correct

Subtask #4
30.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 12 ms 344 KB Output is correct
22 Correct 21 ms 344 KB Output is correct
23 Correct 11 ms 344 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 14 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 21 ms 344 KB Output is correct
28 Correct 25 ms 344 KB Output is correct
29 Correct 14 ms 600 KB Output is correct
30 Correct 11 ms 344 KB Output is correct
31 Correct 15 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 19 ms 436 KB Output is correct
39 Correct 16 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 10 ms 344 KB Output is correct
42 Correct 10 ms 436 KB Output is correct
43 Correct 5 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Partially correct 10 ms 344 KB Output is partially correct
48 Partially correct 27 ms 344 KB Output is partially correct
49 Partially correct 47 ms 344 KB Output is partially correct
50 Partially correct 65 ms 344 KB Output is partially correct
51 Partially correct 50 ms 412 KB Output is partially correct
52 Partially correct 51 ms 344 KB Output is partially correct
53 Partially correct 56 ms 344 KB Output is partially correct
54 Partially correct 55 ms 344 KB Output is partially correct
55 Partially correct 55 ms 344 KB Output is partially correct
56 Partially correct 30 ms 344 KB Output is partially correct
57 Partially correct 40 ms 344 KB Output is partially correct
58 Partially correct 50 ms 344 KB Output is partially correct
59 Partially correct 57 ms 344 KB Output is partially correct
60 Partially correct 61 ms 344 KB Output is partially correct
61 Partially correct 56 ms 344 KB Output is partially correct
62 Partially correct 7 ms 344 KB Output is partially correct
63 Partially correct 15 ms 600 KB Output is partially correct
64 Partially correct 25 ms 344 KB Output is partially correct
65 Partially correct 42 ms 592 KB Output is partially correct
66 Partially correct 42 ms 440 KB Output is partially correct
67 Partially correct 14 ms 600 KB Output is partially correct
68 Partially correct 39 ms 344 KB Output is partially correct
69 Partially correct 25 ms 344 KB Output is partially correct
70 Partially correct 39 ms 600 KB Output is partially correct
71 Partially correct 14 ms 344 KB Output is partially correct
72 Partially correct 22 ms 344 KB Output is partially correct
73 Partially correct 21 ms 592 KB Output is partially correct
74 Partially correct 28 ms 596 KB Output is partially correct
75 Partially correct 36 ms 348 KB Output is partially correct
76 Partially correct 30 ms 344 KB Output is partially correct
77 Partially correct 26 ms 344 KB Output is partially correct
78 Partially correct 21 ms 344 KB Output is partially correct
79 Partially correct 26 ms 436 KB Output is partially correct
80 Partially correct 23 ms 592 KB Output is partially correct
81 Partially correct 31 ms 344 KB Output is partially correct
82 Partially correct 22 ms 344 KB Output is partially correct