oj.uz

Submission #957225

# Submission time Handle Problem Language Result Execution time Memory
957225 2024-04-03T08:38:02 Z Nelt Longest Trip (IOI23_longesttrip) C++17
40 / 100
 799 ms 2568 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> 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 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 0 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Correct 115 ms 856 KB Output is correct
4 Correct 338 ms 1136 KB Output is correct
5 Correct 716 ms 1608 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 24 ms 344 KB Output is correct
8 Correct 124 ms 1112 KB Output is correct
9 Correct 253 ms 1156 KB Output is correct
10 Correct 671 ms 1868 KB Output is correct
11 Correct 718 ms 1664 KB Output is correct
12 Correct 715 ms 1848 KB Output is correct
13 Correct 766 ms 1996 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 20 ms 344 KB Output is correct
3 Correct 114 ms 472 KB Output is correct
4 Correct 353 ms 1400 KB Output is correct
5 Correct 722 ms 1744 KB Output is correct
6 Correct 8 ms 596 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 112 ms 600 KB Output is correct
9 Correct 299 ms 1524 KB Output is correct
10 Correct 751 ms 1904 KB Output is correct
11 Correct 724 ms 2148 KB Output is correct
12 Correct 704 ms 1592 KB Output is correct
13 Correct 799 ms 2232 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 46 ms 612 KB Output is correct
17 Correct 118 ms 600 KB Output is correct
18 Correct 116 ms 1232 KB Output is correct
19 Correct 264 ms 1152 KB Output is correct
20 Correct 259 ms 1228 KB Output is correct
21 Correct 722 ms 2312 KB Output is correct
22 Correct 759 ms 2440 KB Output is correct
23 Correct 735 ms 1432 KB Output is correct
24 Correct 698 ms 2084 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 23 ms 344 KB Output is correct
28 Correct 20 ms 344 KB Output is correct
29 Correct 19 ms 344 KB Output is correct
30 Correct 175 ms 984 KB Output is correct
31 Correct 147 ms 1240 KB Output is correct
32 Correct 167 ms 996 KB Output is correct
33 Correct 269 ms 1880 KB Output is correct
34 Correct 257 ms 1168 KB Output is correct
35 Correct 270 ms 1420 KB Output is correct
36 Correct 725 ms 1788 KB Output is correct
37 Correct 717 ms 1744 KB Output is correct
38 Correct 750 ms 2072 KB Output is correct
39 Correct 728 ms 1592 KB Output is correct
40 Correct 735 ms 1992 KB Output is correct
41 Correct 731 ms 1188 KB Output is correct
42 Correct 758 ms 1584 KB Output is correct
43 Correct 713 ms 2068 KB Output is correct
44 Correct 739 ms 2012 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 23 ms 600 KB Output is correct
48 Correct 26 ms 600 KB Output is correct
49 Correct 21 ms 600 KB Output is correct
50 Correct 167 ms 736 KB Output is correct
51 Correct 176 ms 724 KB Output is correct
52 Correct 165 ms 728 KB Output is correct
53 Correct 268 ms 1880 KB Output is correct
54 Correct 259 ms 872 KB Output is correct
55 Correct 265 ms 1236 KB Output is correct
56 Correct 779 ms 1656 KB Output is correct
57 Correct 717 ms 1372 KB Output is correct
58 Correct 727 ms 1924 KB Output is correct
59 Correct 715 ms 2028 KB Output is correct
60 Correct 738 ms 2568 KB Output is correct
61 Correct 780 ms 1440 KB Output is correct
62 Correct 720 ms 1440 KB Output is correct
63 Correct 767 ms 1712 KB Output is correct
64 Correct 732 ms 2000 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 25 ms 344 KB Output is correct
3 Partially correct 126 ms 856 KB Output is partially correct
4 Partially correct 386 ms 600 KB Output is partially correct
5 Partially correct 734 ms 1736 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -