oj.uz

Submission #914157

# Submission time Handle Problem Language Result Execution time Memory
914157 2024-01-21T10:02:48 Z Nelt Longest Trip (IOI23_longesttrip) C++17
30 / 100
 820 ms 2420 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];
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);
    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 1 ms 344 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 344 KB Output is correct
4 Correct 1 ms 344 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 23 ms 344 KB Output is correct
3 Correct 115 ms 856 KB Output is correct
4 Correct 337 ms 1488 KB Output is correct
5 Correct 707 ms 1792 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 120 ms 1112 KB Output is correct
4 Correct 341 ms 1124 KB Output is correct
5 Correct 692 ms 1764 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 111 ms 600 KB Output is correct
9 Correct 289 ms 1396 KB Output is correct
10 Correct 665 ms 2340 KB Output is correct
11 Correct 687 ms 1888 KB Output is correct
12 Correct 743 ms 2100 KB Output is correct
13 Correct 687 ms 2392 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 43 ms 344 KB Output is correct
17 Correct 72 ms 344 KB Output is correct
18 Correct 126 ms 1112 KB Output is correct
19 Correct 261 ms 1228 KB Output is correct
20 Correct 278 ms 1104 KB Output is correct
21 Correct 780 ms 1888 KB Output is correct
22 Correct 647 ms 1912 KB Output is correct
23 Correct 667 ms 1896 KB Output is correct
24 Correct 722 ms 1896 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 21 ms 344 KB Output is correct
28 Correct 23 ms 344 KB Output is correct
29 Correct 19 ms 344 KB Output is correct
30 Correct 161 ms 1216 KB Output is correct
31 Correct 147 ms 984 KB Output is correct
32 Correct 156 ms 960 KB Output is correct
33 Correct 238 ms 856 KB Output is correct
34 Correct 241 ms 1244 KB Output is correct
35 Correct 233 ms 1012 KB Output is correct
36 Correct 731 ms 1680 KB Output is correct
37 Correct 660 ms 2016 KB Output is correct
38 Correct 717 ms 2144 KB Output is correct
39 Correct 785 ms 1872 KB Output is correct
40 Correct 820 ms 2068 KB Output is correct
41 Correct 729 ms 1728 KB Output is correct
42 Correct 686 ms 1560 KB Output is correct
43 Correct 774 ms 1884 KB Output is correct
44 Correct 751 ms 2260 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 24 ms 600 KB Output is correct
48 Correct 23 ms 600 KB Output is correct
49 Correct 23 ms 344 KB Output is correct
50 Correct 167 ms 1236 KB Output is correct
51 Correct 159 ms 1212 KB Output is correct
52 Correct 173 ms 1220 KB Output is correct
53 Correct 255 ms 1672 KB Output is correct
54 Correct 287 ms 1476 KB Output is correct
55 Correct 292 ms 1112 KB Output is correct
56 Correct 757 ms 2032 KB Output is correct
57 Correct 740 ms 1576 KB Output is correct
58 Correct 731 ms 1784 KB Output is correct
59 Correct 771 ms 1820 KB Output is correct
60 Correct 682 ms 2420 KB Output is correct
61 Correct 695 ms 1516 KB Output is correct
62 Correct 686 ms 1368 KB Output is correct
63 Correct 778 ms 1920 KB Output is correct
64 Correct 728 ms 2228 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Partially correct 121 ms 600 KB Output is partially correct
4 Partially correct 326 ms 1740 KB Output is partially correct
5 Partially correct 690 ms 1704 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -