oj.uz

Submission #859074

# Submission time Handle Problem Language Result Execution time Memory
859074 2023-10-09T16:18:24 Z Ludissey Longest Trip (IOI23_longesttrip) C++17
15 / 100
 9 ms 600 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
 
std::vector<int> longest_trip(int n, int d)
{
    vector<int> A;
    vector<int> B;
    A.push_back(0);
    for (int i = 1; i < n; i++)
    {
        if(are_connected({i}, {A.back()})) A.push_back(i);
        else if(B.size()==0 || are_connected({i}, {B.back()})) B.push_back(i);
        else {
            for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
            B.clear();
            B.push_back(i);
        }
    }
    if(A.size()<B.size()) swap(A,B);
    vector<int> outp;
    if(B.size()==0 || !are_connected({A},{B})) return A;
    int aN=A.size(), bN=B.size();
    if(are_connected({A[aN-1]}, {B[bN-1]})){
        for (int i = 0; i < aN; i++) outp.push_back(A[i]);
        for (int i = bN-1; i >= 0; i--) outp.push_back(B[i]);
        // cout << "method1\n";
    }else if(are_connected({A[aN-1]}, {B[0]})){
        for (int i = 0; i < aN; i++) outp.push_back(A[i]);
        for (int i = 0; i < bN; i++) outp.push_back(B[i]);
        //cout << A.size() << " " << B.size() << " method2\n";
    }else if(are_connected({A[0]}, {B[bN-1]})){
        for (int i = aN-1; i >= 0; i--) outp.push_back(A[i]);
        for (int i = bN-1; i >= 0; i--) outp.push_back(B[i]);
        //cout << "method3\n";
    }else if(are_connected({A[0]}, {B[0]})){
        for (int i = aN-1; i >= 0; i--) outp.push_back(A[i]);
        for (int i = 0; i < bN; i++) outp.push_back(B[i]);
        //cout << "method4\n";
    }else{
        int aConnect=0;
        for (int i = 0; i < aN; i++) 
        {
            if(are_connected({i}, {B})){
                aConnect=i;
                break;
            }
        }
        int bConnect=0;
        for (int i = 0; i < aN; i++) 
        {
            if(are_connected({aConnect}, {B[i]})){
                bConnect=i;
                break;
            }
        }
        for (int r = aConnect+1; r < aN; r++) outp.push_back(A[r]);
        for (int r = 0; r <= aConnect; r++) outp.push_back(A[r]);
        for (int r = bConnect; r < bN; r++) outp.push_back(B[r]);
        for (int r = 0; r < bConnect; r++) outp.push_back(B[r]);
        //cout << "methodLast\n";
    }
    return outp;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #3
0.0 / 25.0

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