oj.uz

Submission #957226

# Submission time Handle Problem Language Result Execution time Memory
957226 2024-04-03T08:40:00 Z Nelt Longest Trip (IOI23_longesttrip) C++17
40 / 100
 810 ms 2260 KB 
#include "longesttrip.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma,popcnt")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define ss(a) set<a>
#define pp(a, b) pair<a, b>
#define mm(a, b) map<a, b>
#define qq(a) queue<a>
#define pq(a) priority_queue<a>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define elif else if
#define endl "\n"
#define pb push_back
#define ins insert
#define logi __lg
#define sqrt sqrtl
#define mpr make_pair
using namespace std;
using namespace __cxx11;
using namespace __gnu_pbds;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 256;
vv(ll) g[N];
bool mat[N][N];
std::vector<int> longest_trip(int n, int d)
{
    for (ll i = 0; i < n; i++)
        for (ll j = 0; j < n; j++)
            mat[i][j] = 0;
    for (ll i = 0; i < n; i++)
        g[i].clear();
    vv(int) ans;
    if (d == 3)
    {
        for (ll i = 0; i < n; i++)
            ans.pb(i);
        return ans;
    }
    for (int i = 0; i < n; i++)
        for (int j = i + 1; j < n; j++)
            if (are_connected({i}, {j}))
                g[i].pb(j), g[j].pb(i), mat[i][j] = mat[j][i] = true;
    if (d == 2)
    {
        vector<int> ans;
        ll found = 0;
        for (ll i = 0; i + 1 < n; i++)
            if (mat[i][i + 1])
            {
                ans.push_back(i), ans.push_back(i + 1), found = i;
                break;
            }
        for (ll i = 0; i < n; i++)
            if (i != found and i != found + 1)
            {
                if (mat[ans.front()][i])
                    ans.insert(ans.begin(), i);
                else
                    ans.push_back(i);
            }
        return ans;
    }
    if (d == 1)
    {
        ll v = 0;
        bool used[n];
        for (ll i = 0; i < n; i++)
            used[i] = 0;
        for (ll i = 0; i < n; i++)
            if (g[i].size() > g[v].size())
                v = i;
        while (v != -1)
        {
            used[v] = 1;
            ans.pb(v);
            ll to = -1;
            for (ll i : g[v])
                if (!used[i] and (to == -1 or g[i].size() > g[to].size()))
                    to = i;
            v = to;
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 596 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Correct 128 ms 856 KB Output is correct
4 Correct 373 ms 820 KB Output is correct
5 Correct 684 ms 1984 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 112 ms 1112 KB Output is correct
9 Correct 295 ms 1372 KB Output is correct
10 Correct 682 ms 2080 KB Output is correct
11 Correct 755 ms 1668 KB Output is correct
12 Correct 715 ms 1816 KB Output is correct
13 Correct 678 ms 1656 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Correct 123 ms 856 KB Output is correct
4 Correct 386 ms 1788 KB Output is correct
5 Correct 738 ms 2260 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 18 ms 344 KB Output is correct
8 Correct 120 ms 856 KB Output is correct
9 Correct 262 ms 1376 KB Output is correct
10 Correct 725 ms 1940 KB Output is correct
11 Correct 709 ms 2148 KB Output is correct
12 Correct 722 ms 1436 KB Output is correct
13 Correct 734 ms 1668 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 41 ms 344 KB Output is correct
17 Correct 77 ms 344 KB Output is correct
18 Correct 110 ms 744 KB Output is correct
19 Correct 286 ms 1244 KB Output is correct
20 Correct 247 ms 1368 KB Output is correct
21 Correct 679 ms 2112 KB Output is correct
22 Correct 764 ms 2060 KB Output is correct
23 Correct 810 ms 1944 KB Output is correct
24 Correct 739 ms 2144 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 25 ms 344 KB Output is correct
28 Correct 21 ms 344 KB Output is correct
29 Correct 21 ms 344 KB Output is correct
30 Correct 176 ms 728 KB Output is correct
31 Correct 200 ms 976 KB Output is correct
32 Correct 159 ms 1492 KB Output is correct
33 Correct 252 ms 1116 KB Output is correct
34 Correct 269 ms 1648 KB Output is correct
35 Correct 252 ms 1564 KB Output is correct
36 Correct 711 ms 1440 KB Output is correct
37 Correct 774 ms 1884 KB Output is correct
38 Correct 774 ms 2068 KB Output is correct
39 Correct 719 ms 2212 KB Output is correct
40 Correct 778 ms 1800 KB Output is correct
41 Correct 723 ms 1440 KB Output is correct
42 Correct 765 ms 1388 KB Output is correct
43 Correct 706 ms 2184 KB Output is correct
44 Correct 736 ms 2060 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 20 ms 600 KB Output is correct
48 Correct 21 ms 600 KB Output is correct
49 Correct 21 ms 344 KB Output is correct
50 Correct 148 ms 720 KB Output is correct
51 Correct 170 ms 980 KB Output is correct
52 Correct 170 ms 1484 KB Output is correct
53 Correct 250 ms 1540 KB Output is correct
54 Correct 248 ms 1048 KB Output is correct
55 Correct 271 ms 1392 KB Output is correct
56 Correct 699 ms 2164 KB Output is correct
57 Correct 704 ms 1884 KB Output is correct
58 Correct 747 ms 1688 KB Output is correct
59 Correct 742 ms 1920 KB Output is correct
60 Correct 766 ms 2252 KB Output is correct
61 Correct 722 ms 1480 KB Output is correct
62 Correct 709 ms 1936 KB Output is correct
63 Correct 759 ms 1976 KB Output is correct
64 Correct 702 ms 1900 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Partially correct 136 ms 728 KB Output is partially correct
4 Partially correct 334 ms 1620 KB Output is partially correct
5 Partially correct 701 ms 2048 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -