oj.uz

Submission #1115640

# Submission time Handle Problem Language Result Execution time Memory
1115640 2024-11-20T17:36:14 Z Gray Longest Trip (IOI23_longesttrip) C++17
15 / 100
 42 ms 604 KB 
#include "longesttrip.h"
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define ff first
#define ss second
#define ln "\n"
ll n, d;
pair<ll, vector<ll>> mx;

vector<int> longest_trip(int N, int D)
{
    n=N; d=D;
    vector<int> a = {0}, b = {1};
    bool lost=0;
    for (int i=2; i<N; i++){
        if (are_connected({a.back()}, {i})){
            a.push_back(i);
        }else if (lost or are_connected({b.back()}, {i})){
            b.push_back(i);
        }else{
            if (lost) assert(false);
            lost=1;
            assert(are_connected({a.back()}, {b.back()}));
            while (!b.empty()){
                a.push_back(b.back());
                b.pop_back();
            }
            b.push_back(i);
        }
    }
    // for (auto ch:a) cout << ch << " ";
    // cout << ln;
    // for (auto ch:b) cout << ch << " ";
    // cout << ln;
    if (a.empty() or b.empty()){
        return a.empty()?b:a;
    }else if (are_connected({a[0]}, {b[0]})){
        reverse(a.begin(), a.end());
        for (auto ch:b) a.push_back(ch);
        return a;
    }else if (are_connected({a[0]}, {b.back()})){
        for (auto ch:a) b.push_back(ch);
        return b;
    }else if (are_connected({a.back()}, {b[0]})){
        for (auto ch:b) a.push_back(ch);
        return a;
    }else if (are_connected({a.back()}, {b.back()})){
        reverse(b.begin(), b.end());
        for (auto ch:b) a.push_back(ch);
        return a;
    }else if (are_connected(a, b)){
        // cout << "Happening" << endl;
        ll l=0, r=a.size();
        while (l<r){
            vector<int> test;
            ll mid = (l+r)/2;
            for (ll i=l; i<=mid; i++){
                test.push_back(a[i]);
            }
            if (are_connected(test, b)){
                r=mid;
            }else l=mid+1;
        }
        int conA = r;
        l=0; r=b.size();
        while (l<r){
            vector<int> test;
            ll mid = (l+r)/2;
            for (ll i=l; i<=mid; i++){
                test.push_back(b[i]);
            }
            if (are_connected(test, {conA})){
                r=mid;
            }else l=mid+1;
        }
        int conB = r;

        vector<int> res;
        for (int i=conA+1; i<(int)a.size(); i++){
            res.push_back(a[i]);
        }
        for (int i=0; i<=conA; i++){
            res.push_back(a[i]);
        }
        // cout << a[conA] << " " << b[conB] << endl;
        for (int i=conB; i<(int)b.size(); i++) res.push_back(b[i]);
        for (int i=0; i<conB; i++) res.push_back(b[i]);
        return res;
    }else{
        if (a.size()>b.size()) return a;
        else return b;
    }
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 336 KB Output is correct
2 Correct 16 ms 336 KB Output is correct
3 Correct 23 ms 336 KB Output is correct
4 Correct 12 ms 336 KB Output is correct
5 Correct 16 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 336 KB Output is correct
2 Correct 21 ms 336 KB Output is correct
3 Correct 13 ms 336 KB Output is correct
4 Correct 16 ms 336 KB Output is correct
5 Correct 14 ms 592 KB Output is correct
6 Correct 20 ms 336 KB Output is correct
7 Correct 19 ms 336 KB Output is correct
8 Correct 19 ms 336 KB Output is correct
9 Correct 18 ms 336 KB Output is correct
10 Correct 19 ms 336 KB Output is correct
11 Correct 17 ms 336 KB Output is correct
12 Correct 14 ms 336 KB Output is correct
13 Correct 15 ms 336 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 512 KB Output is correct
2 Correct 16 ms 336 KB Output is correct
3 Correct 16 ms 336 KB Output is correct
4 Correct 20 ms 336 KB Output is correct
5 Correct 19 ms 512 KB Output is correct
6 Correct 17 ms 336 KB Output is correct
7 Correct 20 ms 336 KB Output is correct
8 Correct 21 ms 504 KB Output is correct
9 Correct 15 ms 336 KB Output is correct
10 Correct 17 ms 336 KB Output is correct
11 Correct 14 ms 336 KB Output is correct
12 Correct 17 ms 504 KB Output is correct
13 Correct 16 ms 336 KB Output is correct
14 Correct 41 ms 336 KB Output is correct
15 Correct 36 ms 336 KB Output is correct
16 Incorrect 2 ms 336 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

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