oj.uz

Submission #1070518

# Submission time Handle Problem Language Result Execution time Memory
1070518 2024-08-22T14:55:59 Z zsombor Longest Trip (IOI23_longesttrip) C++17
15 / 100
 10 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a;
vector<int> b;

void pf(vector<int> &v, int x) {
    v.push_back(0);
    for (int i = v.size() - 1; i > 0; i--) v[i] = v[i - 1];
    v[0] = x;
}

void pb(vector<int> &v, int x) {
    v.push_back(x);
}

bool query(int x, int l, int r, vector<int> &v) {
    vector<int> u;
    for (int i = l; i < r; i++) u.push_back(v[i]);
    return are_connected({x}, u);
}

int bin(int x, vector<int> &v) {
    int l = 0, r = v.size(), m;
    if (!query(x, l, r, v)) return -1;
    while (r - l > 1) {
        m = (l + r) / 2;
        (query(x, l, m, v) ? r = m : l = m);
    }
    return l;
}

bool try_add(int x, vector<int> &v) {
    if (!v.size()) {
        pb(v, x);
        return true;
    }
    if (v.size() == 1) {
        if (are_connected({v.back()}, {x})) {
            pb(v, x);
            return true;
        }
        return false;
    }
    int a = v[0], b = v.back();
    if (are_connected({a}, {x})) {
        pf(v, x);
        return true;
    }
    if (are_connected({b}, {x})) {
        pb(v, x);
        return true;
    }
    int k = bin(x, v);
    if (k == -1) return false;
    vector<int> v2;
    for (int i = k + 1; i < v.size(); i++) pb(v2, v[i]);
    for (int i = 0; i <= k; i++) pb(v2, v[i]);
    v = v2;
    v.push_back(x);
    return true;
}

vector<int> longest_trip(int N, int D) {
    n = N;
    a.clear();
    b.clear();
    for (int i = 0; i < n; i++) {
        bool A = try_add(i, a);
        bool B = try_add(i, b);
        if (A && B) {
            b.pop_back();
            while (b.size()) {
                a.push_back(b.back());
                b.pop_back();
            }
        }
    }
    return (a.size() > b.size() ? a : b);
}

Compilation message

longesttrip.cpp: In function 'bool try_add(int, std::vector<int>&)':
longesttrip.cpp:59:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for (int i = k + 1; i < v.size(); i++) pb(v2, v[i]);
      |                         ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 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 8 ms 356 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 6 ms 600 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 8 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 9 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 10 ms 344 KB Output is correct
14 Correct 10 ms 344 KB Output is correct
15 Incorrect 2 ms 340 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 8 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 7 ms 436 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 8 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Incorrect 2 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -