oj.uz

Submission #1081889

# Submission time Handle Problem Language Result Execution time Memory
1081889 2024-08-30T12:34:24 Z ArthuroWich Longest Trip (IOI23_longesttrip) C++17
85 / 100
 17 ms 856 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int n, int d) {
    vector<int> a, b, ans, st;
    for (int i = 0; i < n; i++) {
        st.push_back(i);
    }
    random_device rd;
    mt19937 g(rd());
    shuffle(st.begin(), st.end(), g);
    a = {st[0]};
    b = {st[1]};
    st.erase(st.begin());
    st.erase(st.begin());
    set<pair<int, int>> ch;
    for (int i : st) {
        if (ch.count({min(a.back(), b.back()), max(a.back(), b.back())})) {
            if (are_connected({a.back()}, {i})) {
                a.push_back(i);
            } else {
                b.push_back(i);
                ch.insert({min(a.back(), b.back()), max(a.back(), b.back())});
            }
            continue;
        }
        if (are_connected({a.back(), b.back()}, {i})) {
            if (are_connected({a.back()}, {i})) {
                a.push_back(i);
            } else {
                b.push_back(i);
                ch.insert({min(a.back(), b.back()), max(a.back(), b.back())});
            }
        } else {
            if (b.size() == 1) {
                ch.insert({min(i, b.back()), max(i, b.back())});
            }
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b = {i};
        }
    }
    int co = 2;
    if (are_connected(a, b)) {
        vector<int> ch1 = {a.front(), a.back()}, ch2 = {b.front(), b.back()};
        sort(ch1.begin(), ch1.end());
        ch1.erase(unique(ch1.begin(), ch1.end()), ch1.end());
        sort(ch2.begin(), ch2.end());
        ch2.erase(unique(ch2.begin(), ch2.end()), ch2.end());
        if (!are_connected(ch1, ch2)) {
            // both become cycles that are connected via some edge?
            int l = 0, r = a.size()-1, e1, e2;
            while(l < r) {
                co++;
                int m = (l+r)/2;
                vector<int> in;
                for (int i = 0; i <= m; i++) {
                    in.push_back(a[i]);
                }
                if (are_connected(in, b)) {
                    r = m;
                } else {
                    l = m+1;
                }
            }
            e1 = a[l];
            l = 0, r = b.size()-1;
            while(l < r) {
                co++;
                int m = (l+r)/2;
                vector<int> in;
                for (int i = 0; i <= m; i++) {
                    in.push_back(b[i]);
                }
                if (are_connected({e1}, in)) {
                    r = m;
                } else {
                    l = m+1;
                }
            }
            e2 = b[l];
            vector<int> ans;
            for (int i = find(a.begin(), a.end(), e1) - a.begin()+1; i < a.size(); i++) {
                ans.push_back(a[i]);
            }
            for (int i = 0; i <= find(a.begin(), a.end(), e1) - a.begin(); i++) {
                ans.push_back(a[i]);
            }
            for (int i = find(b.begin(), b.end(), e2) - b.begin(); i < b.size(); i++) {
                ans.push_back(b[i]);
            }
            for (int i = 0; i < find(b.begin(), b.end(), e2) - b.begin(); i++) {
                ans.push_back(b[i]);
            }
            a = ans;
            b.clear();
        } else if (are_connected({a.front()}, {b.front()})) {
            reverse(a.begin(), a.end());
            for (int j = 0; j < b.size(); j++) {
                a.push_back(b[j]);
            }
            reverse(a.begin(), a.end());
            b.clear();
        } else if (are_connected({a.back()}, {b.front()})) {
            for (int j = 0; j < b.size(); j++) {
                a.push_back(b[j]);
            }
            b.clear();
        } else if (are_connected({a.front()}, {b.back()})) {
            reverse(a.begin(), a.end());
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            reverse(a.begin(), a.end());
            b.clear();
        } else {
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b.clear();
        }
    }
    if (a.size() >= b.size()) {
        ans = a;
    } else {
        ans = b;
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:84:72: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             for (int i = find(a.begin(), a.end(), e1) - a.begin()+1; i < a.size(); i++) {
      |                                                                      ~~^~~~~~~~~~
longesttrip.cpp:90:70: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             for (int i = find(b.begin(), b.end(), e2) - b.begin(); i < b.size(); i++) {
      |                                                                    ~~^~~~~~~~~~
longesttrip.cpp:100:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
longesttrip.cpp:106:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 448 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 344 KB Output is correct
2 Correct 14 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 12 ms 344 KB Output is correct
5 Correct 9 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 16 ms 440 KB Output is correct
5 Correct 11 ms 344 KB Output is correct
6 Correct 15 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 13 ms 344 KB Output is correct
11 Correct 11 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 14 ms 344 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 7 ms 448 KB Output is correct
19 Correct 9 ms 344 KB Output is correct
20 Correct 13 ms 344 KB Output is correct
21 Correct 10 ms 344 KB Output is correct
22 Correct 10 ms 448 KB Output is correct
23 Correct 15 ms 344 KB Output is correct
24 Correct 8 ms 340 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 12 ms 344 KB Output is correct
31 Correct 9 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 10 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 14 ms 340 KB Output is correct
37 Correct 8 ms 448 KB Output is correct
38 Correct 8 ms 448 KB Output is correct
39 Correct 9 ms 452 KB Output is correct
40 Correct 10 ms 344 KB Output is correct
41 Correct 9 ms 344 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 7 ms 344 KB Output is correct
45 Correct 12 ms 344 KB Output is correct
46 Correct 11 ms 340 KB Output is correct
47 Correct 11 ms 344 KB Output is correct
48 Correct 11 ms 344 KB Output is correct
49 Correct 12 ms 344 KB Output is correct
50 Correct 10 ms 344 KB Output is correct
51 Correct 9 ms 444 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 10 ms 600 KB Output is correct
54 Correct 14 ms 344 KB Output is correct
55 Correct 10 ms 344 KB Output is correct
56 Correct 10 ms 444 KB Output is correct
57 Correct 10 ms 344 KB Output is correct
58 Correct 11 ms 444 KB Output is correct
59 Correct 11 ms 344 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 8 ms 600 KB Output is correct
62 Correct 8 ms 344 KB Output is correct
63 Correct 10 ms 452 KB Output is correct
64 Correct 8 ms 344 KB Output is correct

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 15 ms 856 KB Output is correct
5 Partially correct 10 ms 344 KB Output is partially correct
6 Correct 15 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Partially correct 9 ms 344 KB Output is partially correct
11 Partially correct 10 ms 340 KB Output is partially correct
12 Partially correct 10 ms 344 KB Output is partially correct
13 Partially correct 17 ms 340 KB Output is partially correct
14 Correct 8 ms 340 KB Output is correct
15 Correct 12 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 9 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 9 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 12 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 10 ms 344 KB Output is correct
31 Correct 10 ms 344 KB Output is correct
32 Correct 16 ms 344 KB Output is correct
33 Correct 16 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 12 ms 344 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 9 ms 344 KB Output is correct
38 Correct 12 ms 344 KB Output is correct
39 Correct 9 ms 344 KB Output is correct
40 Correct 10 ms 344 KB Output is correct
41 Correct 11 ms 452 KB Output is correct
42 Correct 11 ms 600 KB Output is correct
43 Partially correct 9 ms 344 KB Output is partially correct
44 Partially correct 10 ms 448 KB Output is partially correct
45 Partially correct 9 ms 344 KB Output is partially correct
46 Partially correct 10 ms 344 KB Output is partially correct
47 Partially correct 10 ms 344 KB Output is partially correct
48 Partially correct 8 ms 344 KB Output is partially correct
49 Partially correct 8 ms 344 KB Output is partially correct
50 Partially correct 11 ms 596 KB Output is partially correct
51 Correct 6 ms 344 KB Output is correct
52 Correct 9 ms 344 KB Output is correct
53 Correct 11 ms 344 KB Output is correct
54 Correct 8 ms 344 KB Output is correct
55 Correct 11 ms 344 KB Output is correct
56 Partially correct 13 ms 456 KB Output is partially correct
57 Partially correct 9 ms 344 KB Output is partially correct
58 Partially correct 7 ms 344 KB Output is partially correct
59 Partially correct 7 ms 344 KB Output is partially correct
60 Correct 8 ms 344 KB Output is correct
61 Correct 8 ms 344 KB Output is correct
62 Partially correct 10 ms 344 KB Output is partially correct
63 Partially correct 8 ms 344 KB Output is partially correct
64 Partially correct 8 ms 344 KB Output is partially correct
65 Partially correct 9 ms 344 KB Output is partially correct
66 Partially correct 10 ms 600 KB Output is partially correct
67 Correct 9 ms 452 KB Output is correct
68 Correct 11 ms 344 KB Output is correct
69 Correct 12 ms 600 KB Output is correct
70 Partially correct 8 ms 600 KB Output is partially correct
71 Partially correct 9 ms 344 KB Output is partially correct
72 Partially correct 10 ms 452 KB Output is partially correct
73 Partially correct 8 ms 456 KB Output is partially correct
74 Partially correct 6 ms 600 KB Output is partially correct
75 Correct 7 ms 344 KB Output is correct
76 Correct 9 ms 344 KB Output is correct
77 Partially correct 11 ms 344 KB Output is partially correct
78 Partially correct 15 ms 452 KB Output is partially correct
79 Partially correct 11 ms 708 KB Output is partially correct
80 Partially correct 10 ms 460 KB Output is partially correct
81 Correct 9 ms 344 KB Output is correct
82 Correct 7 ms 344 KB Output is correct