oj.uz

Submission #1081834

# Submission time Handle Problem Language Result Execution time Memory
1081834 2024-08-30T11:49:38 Z ArthuroWich Longest Trip (IOI23_longesttrip) C++17
15 / 100
 17 ms 600 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());
    bool f = 0;
    for (int i : st) {
        if (f || are_connected({a.back(), b.back()}, {i})) {
            if (are_connected({a.back()}, {i})) {
                a.push_back(i);
            } else {
                b.push_back(i);
            }
            f = 0;
        } else {
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b = {i};
            f = 1;
        }
    }
    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) {
                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) {
                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:70:72: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for (int i = find(a.begin(), a.end(), e1) - a.begin()+1; i < a.size(); i++) {
      |                                                                      ~~^~~~~~~~~~
longesttrip.cpp:76:70: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |             for (int i = find(b.begin(), b.end(), e2) - b.begin(); i < b.size(); i++) {
      |                                                                    ~~^~~~~~~~~~
longesttrip.cpp:86:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
longesttrip.cpp:92:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             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 344 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 13 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 9 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 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 14 ms 344 KB Output is correct
5 Correct 11 ms 344 KB Output is correct
6 Correct 13 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 14 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 17 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 13 ms 344 KB Output is correct
5 Partially correct 9 ms 344 KB Output is partially correct
6 Correct 13 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 11 ms 600 KB Output is correct
10 Partially correct 10 ms 344 KB Output is partially correct
11 Partially correct 10 ms 344 KB Output is partially correct
12 Partially correct 9 ms 344 KB Output is partially correct
13 Partially correct 12 ms 344 KB Output is partially correct
14 Correct 10 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Incorrect 6 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -