oj.uz

Submission #956989

# Submission time Handle Problem Language Result Execution time Memory
956989 2024-04-02T19:07:39 Z Nelt Longest Trip (IOI23_longesttrip) C++17
30 / 100
 799 ms 2676 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++)
        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> p(n);
        iota(p.begin(), p.end(), 0);
        do
        {
            bool ok = true;
            for (ll i = 0; i < n - 1; i++)
                if (!mat[p[i]][p[i + 1]])
                {
                    ok = false;
                    break;
                }
            if (ok)
                return p;
            shuffle(p.begin(), p.end(), rng);
        } while (true);
    }
    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 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

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

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Correct 124 ms 856 KB Output is correct
4 Correct 369 ms 1336 KB Output is correct
5 Correct 660 ms 2352 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 118 ms 988 KB Output is correct
4 Correct 352 ms 856 KB Output is correct
5 Correct 723 ms 1804 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 25 ms 344 KB Output is correct
8 Correct 107 ms 728 KB Output is correct
9 Correct 261 ms 740 KB Output is correct
10 Correct 680 ms 1980 KB Output is correct
11 Correct 710 ms 2272 KB Output is correct
12 Correct 668 ms 1876 KB Output is correct
13 Correct 726 ms 1996 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 12 ms 344 KB Output is correct
16 Correct 38 ms 600 KB Output is correct
17 Correct 81 ms 344 KB Output is correct
18 Correct 120 ms 1496 KB Output is correct
19 Correct 255 ms 1028 KB Output is correct
20 Correct 256 ms 1068 KB Output is correct
21 Correct 676 ms 2652 KB Output is correct
22 Correct 685 ms 1932 KB Output is correct
23 Correct 656 ms 2156 KB Output is correct
24 Correct 697 ms 1952 KB Output is correct
25 Correct 11 ms 340 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 22 ms 344 KB Output is correct
28 Correct 25 ms 344 KB Output is correct
29 Correct 25 ms 344 KB Output is correct
30 Correct 159 ms 1220 KB Output is correct
31 Correct 189 ms 1220 KB Output is correct
32 Correct 163 ms 708 KB Output is correct
33 Correct 270 ms 600 KB Output is correct
34 Correct 271 ms 1252 KB Output is correct
35 Correct 256 ms 1428 KB Output is correct
36 Correct 788 ms 2456 KB Output is correct
37 Correct 798 ms 1808 KB Output is correct
38 Correct 693 ms 2180 KB Output is correct
39 Correct 736 ms 2024 KB Output is correct
40 Correct 684 ms 2676 KB Output is correct
41 Correct 677 ms 1408 KB Output is correct
42 Correct 799 ms 1352 KB Output is correct
43 Correct 711 ms 2048 KB Output is correct
44 Correct 706 ms 2036 KB Output is correct
45 Correct 12 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 21 ms 452 KB Output is correct
48 Correct 21 ms 344 KB Output is correct
49 Correct 19 ms 344 KB Output is correct
50 Correct 159 ms 1248 KB Output is correct
51 Correct 162 ms 500 KB Output is correct
52 Correct 155 ms 960 KB Output is correct
53 Correct 277 ms 600 KB Output is correct
54 Correct 250 ms 1368 KB Output is correct
55 Correct 256 ms 1764 KB Output is correct
56 Correct 669 ms 2028 KB Output is correct
57 Correct 715 ms 1848 KB Output is correct
58 Correct 780 ms 1872 KB Output is correct
59 Correct 739 ms 2144 KB Output is correct
60 Correct 752 ms 2456 KB Output is correct
61 Correct 707 ms 1840 KB Output is correct
62 Correct 776 ms 1360 KB Output is correct
63 Correct 774 ms 1976 KB Output is correct
64 Correct 720 ms 2024 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 600 KB Output is correct
3 Partially correct 110 ms 600 KB Output is partially correct
4 Partially correct 339 ms 1400 KB Output is partially correct
5 Partially correct 742 ms 2480 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -