oj.uz

Submission #858989

# Submission time Handle Problem Language Result Execution time Memory
858989 2023-10-09T14:09:42 Z Ludissey Longest Trip (IOI23_longesttrip) C++17
40 / 100
 14 ms 608 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();
        }
    }
    if(A.size()<B.size()) swap(A,B);
    vector<int> outp;
    // teste les quatres boutssize
    //back et back
    if(B.size()==0) 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]);
    }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]);
    }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]);
    }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]);
    }else{
        int l=0, r=bN;
        //check quelle de B vers A
        while(l<r){
            vector<int> conn;
            int mid=((l+r-1)/2);
            for (int i = l; i <= mid; i++) conn.push_back(B[i]);
            if(are_connected({A}, {conn})){
                r=mid;
            }else{
                l=mid+1;
            }
        }
        if(l==bN) return A;
        int connector=l;
        l=0, r=aN;
        //check quelle de B vers A
        while(l<r){
            vector<int> conn;
            int mid=(l+r-1)/2;
            for (int i = l; i <= mid; i++) conn.push_back(A[i]);
            if(are_connected({B[connector]}, {conn})){
                r=mid;
            }else{
                l=mid+1;
            }
        }

        int aCount=0;
        int i=l+1;
        while (aCount<aN)
        {
            if(i==aN) i=0;
            outp.push_back(A[i]);
            i++;
            aCount++;
        }
        int bCount=0;
        i=connector;
        while (bCount<bN)
        {
            if(i==bN) i=0;
            outp.push_back(B[i]);
            i++;
            bCount++;
        }
        cout << "\n";
    }
    return outp;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 5 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 5 ms 436 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.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 4 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 7 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 5 ms 344 KB Output is correct
10 Correct 6 ms 608 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 388 KB Output is correct
14 Correct 13 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 12 ms 344 KB Output is correct
26 Correct 14 ms 344 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 7 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 5 ms 344 KB Output is correct
34 Correct 6 ms 500 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 5 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 7 ms 600 KB Output is correct
39 Correct 7 ms 600 KB Output is correct
40 Correct 7 ms 592 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 9 ms 600 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 7 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 5 ms 344 KB Output is correct
51 Correct 8 ms 344 KB Output is correct
52 Correct 8 ms 500 KB Output is correct
53 Correct 5 ms 600 KB Output is correct
54 Correct 5 ms 344 KB Output is correct
55 Correct 5 ms 344 KB Output is correct
56 Correct 5 ms 344 KB Output is correct
57 Correct 7 ms 600 KB Output is correct
58 Correct 7 ms 356 KB Output is correct
59 Correct 7 ms 600 KB Output is correct
60 Correct 9 ms 436 KB Output is correct
61 Correct 7 ms 344 KB Output is correct
62 Correct 8 ms 344 KB Output is correct
63 Correct 8 ms 344 KB Output is correct
64 Correct 8 ms 600 KB Output is correct

Subtask #4
0.0 / 60.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 6 ms 340 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 14 ms 344 KB Output is correct
15 Incorrect 4 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -