oj.uz

Submission #914161

# Submission time Handle Problem Language Result Execution time Memory
914161 2024-01-21T10:07:00 Z Nelt Longest Trip (IOI23_longesttrip) C++17
30 / 100
 829 ms 2496 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);
    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;
        }
    }
    else
    {
        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() == n - 2)
                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;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:89:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   89 |             if (g[i].size() == n - 2)
      |                 ~~~~~~~~~~~~^~~~~~~~

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 3 ms 344 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 596 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 24 ms 596 KB Output is correct
3 Correct 153 ms 1112 KB Output is correct
4 Correct 440 ms 1508 KB Output is correct
5 Correct 790 ms 1764 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Incorrect 4 ms 344 KB Incorrect
8 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 26 ms 344 KB Output is correct
3 Correct 118 ms 616 KB Output is correct
4 Correct 347 ms 1004 KB Output is correct
5 Correct 806 ms 1860 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 29 ms 344 KB Output is correct
8 Correct 134 ms 756 KB Output is correct
9 Correct 288 ms 868 KB Output is correct
10 Correct 684 ms 1544 KB Output is correct
11 Correct 647 ms 2028 KB Output is correct
12 Correct 737 ms 2140 KB Output is correct
13 Correct 741 ms 1664 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 10 ms 596 KB Output is correct
16 Correct 49 ms 344 KB Output is correct
17 Correct 81 ms 596 KB Output is correct
18 Correct 125 ms 344 KB Output is correct
19 Correct 242 ms 1308 KB Output is correct
20 Correct 243 ms 1484 KB Output is correct
21 Correct 657 ms 1876 KB Output is correct
22 Correct 685 ms 2476 KB Output is correct
23 Correct 697 ms 1872 KB Output is correct
24 Correct 625 ms 2240 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 20 ms 344 KB Output is correct
28 Correct 25 ms 344 KB Output is correct
29 Correct 20 ms 344 KB Output is correct
30 Correct 156 ms 980 KB Output is correct
31 Correct 156 ms 1216 KB Output is correct
32 Correct 146 ms 1216 KB Output is correct
33 Correct 245 ms 1120 KB Output is correct
34 Correct 217 ms 1376 KB Output is correct
35 Correct 276 ms 1400 KB Output is correct
36 Correct 731 ms 1868 KB Output is correct
37 Correct 734 ms 1992 KB Output is correct
38 Correct 737 ms 2496 KB Output is correct
39 Correct 713 ms 1944 KB Output is correct
40 Correct 650 ms 2196 KB Output is correct
41 Correct 790 ms 1344 KB Output is correct
42 Correct 675 ms 1472 KB Output is correct
43 Correct 707 ms 2160 KB Output is correct
44 Correct 718 ms 2444 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 19 ms 600 KB Output is correct
48 Correct 23 ms 600 KB Output is correct
49 Correct 20 ms 344 KB Output is correct
50 Correct 152 ms 956 KB Output is correct
51 Correct 151 ms 956 KB Output is correct
52 Correct 158 ms 968 KB Output is correct
53 Correct 278 ms 1220 KB Output is correct
54 Correct 234 ms 1376 KB Output is correct
55 Correct 230 ms 976 KB Output is correct
56 Correct 673 ms 1544 KB Output is correct
57 Correct 707 ms 2052 KB Output is correct
58 Correct 829 ms 1576 KB Output is correct
59 Correct 674 ms 2188 KB Output is correct
60 Correct 823 ms 2344 KB Output is correct
61 Correct 690 ms 1280 KB Output is correct
62 Correct 696 ms 1468 KB Output is correct
63 Correct 731 ms 2144 KB Output is correct
64 Correct 689 ms 1936 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 20 ms 344 KB Output is correct
3 Partially correct 130 ms 600 KB Output is partially correct
4 Partially correct 316 ms 1112 KB Output is partially correct
5 Partially correct 706 ms 2084 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -