oj.uz

Submission #1011608

# Submission time Handle Problem Language Result Execution time Memory
1011608 2024-06-30T20:39:38 Z mdn2002 Longest Trip (IOI23_longesttrip) C++17
15 / 100
 11 ms 692 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;


vector<int> longest_trip(int N, int D) {
    vector<int> a, b, c;
    for (int i = 0; i < N; i ++) c.push_back(i);
    random_shuffle (c.begin(), c.end());
    a.push_back(c[0]);

    int not_connected = 0;
    for (int I = 1; I < N; I ++) {
        int x = a.back(), i = c[I] , y = are_connected({x}, {i});
        if (y) {
            a.push_back(i);
            continue;
        }

        if (b.size() == 0) {
            b.push_back(i);
            not_connected = 1;
        }
        else {
            if (not_connected) {
                b.push_back(i);
                not_connected = 1;
                continue;
            }
            int z = b.back(), k = are_connected({z}, {i});
            if (k) b.push_back(i);
            else {
                for (int j = b.size() - 1; j >= 0; j --) a.push_back(b[j]);
                b.clear();
                b.push_back(i);
            }
        }
    }

    if (b.size() == 0) return a;
    if (are_connected(a, b) == 0){
        if (a.size() > b.size()) return a;
        return b;
    }

    if (are_connected({a.back()}, {b.back()})) {
        for (int j = b.size() - 1; j >= 0; j --) a.push_back(b[j]);
        return a;
    }
    else if (are_connected({a.back()}, {b[0]})) {
        for (int j = 0; j < b.size(); j ++) a.push_back(b[j]);
        return a;
    }
    else if (are_connected({a[0]}, {b.back()})) {
        for (int j = 0; j < a.size(); j ++) b.push_back(a[j]);
        return b;
    }
    else if (are_connected({a[0]}, {b[0]})) {
        reverse(a.begin(), a.end());
        for (int j = 0; j < b.size(); j ++) a.push_back(b[j]);
        return a;
    }

    int l = 0, r = a.size(), mid;
    while (l < r) {
        mid = (l + r) / 2;
        vector<int> temp;
        for (int i = 0; i <= mid; i ++) temp.push_back(a[i]);
        if (are_connected(temp, b)) r = mid;
        else l = mid + 1;
    }
    vector<int> ans;
    for (int i = l - 1; i >= 0; i --) ans.push_back(a[i]);
    for (int i = a.size() - 1; i >= l; i --) ans.push_back(a[i]);

    int x = a[l];

    l = 0, r = b.size();
    while (l < r) {
        mid = (l + r) / 2;
        vector<int> temp;
        for (int i = 0; i <= mid; i ++) temp.push_back(b[i]);
        if (are_connected({x}, temp)) r = mid;
        else l = mid + 1;
    }

    for (int i = l; i >= 0; i --) ans.push_back(b[i]);
    for (int i = b.size() - 1; i > l; i --) ans.push_back(b[i]);

    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:51:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         for (int j = 0; j < b.size(); j ++) a.push_back(b[j]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp:55:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for (int j = 0; j < a.size(); j ++) b.push_back(a[j]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp:60:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for (int j = 0; j < b.size(); j ++) a.push_back(b[j]);
      |                         ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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