oj.uz

Submission #855501

# Submission time Handle Problem Language Result Execution time Memory
855501 2023-10-01T11:14:28 Z Nonoze Longest Trip (IOI23_longesttrip) C++17
85 / 100
 14 ms 1108 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> longest_trip(int N, int D)
{
    list <int> l1,l2;
    l1.push_back(0);
    bool flag=true;
    for (int i(1); i < N; i++) {

        if (l2.empty()) l2.push_back(i), flag=true;
        else if (flag && are_connected({l1.back()},{l2.front()})){
            l1.insert(l1.end(), l2.begin(), l2.end());
            l2.clear();
            l2.push_back(i);
        }
        else if (are_connected({i},{l1.back()})) {
            l1.push_back(i);
            flag=true;
        }
        else  {
            l2.push_front(i);
            flag=false;
        }
    }
    vector< int > v1, v2;

    while (!l1.empty()) {
        v1.push_back(l1.front());
        l1.pop_front();
    }
    while (!l2.empty()) {
        v2.push_back(l2.front());
        l2.pop_front();
    }
    if (v2.size()==0) return v1;
    if (!are_connected(v1, v2)) {
        if (v1.size() > v2.size()) return v1;
        return v2;
    }

    if (v1.size()>1 && !are_connected({v1[0]}, {v1.back()})) {
        if (are_connected({v2[0]}, {v1.back()})) {
            v1.insert(v1.end(), v2.begin(), v2.end());
        }

        else {
            v1.insert(v1.begin(), v2.rbegin(), v2.rend());
        }
        return v1;
    }

    if (v2.size()>1 && !are_connected({v2[0]}, {v2.back()})) {
        if (are_connected({v1.back()}, {v2[0]})) {
            v1.insert(v1.end(), v2.begin(), v2.end());
        }

        else {
            v1.insert(v1.end(), v2.rbegin(), v2.rend());
        }
        return v1;
    }
    

    int l=0, r=v1.size();
    while (l<r) {
        int mid=(l+r)/2;
        if (are_connected(vector<int>(v1.begin(), v1.begin()+mid + 1), v2)) r=mid;
        else l=mid+1;
    }

    int empl1=l;
    l=0, r=v2.size();
    while (l<r) {
        int mid=(l+r)/2;
        if (are_connected(vector<int>(v2.begin(), v2.begin()+mid + 1), {v1[empl1]})) r=mid;
        else l=mid+1;
    }
    
    int empl2=l;

    vector<int> ans;
    ans=vector<int>(v1.begin()+empl1+1, v1.end());
    ans.insert(ans.end(), v1.begin(), v1.begin()+empl1+1);
    ans.insert(ans.end(), v2.begin()+empl2, v2.end());
    ans.insert(ans.end(), v2.begin(), v2.begin()+empl2);
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 9 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 6 ms 440 KB Output is correct
6 Correct 13 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 432 KB Output is correct
10 Correct 5 ms 452 KB Output is correct
11 Correct 5 ms 448 KB Output is correct
12 Correct 4 ms 444 KB Output is correct
13 Correct 5 ms 600 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 5 ms 600 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 444 KB Output is correct
6 Correct 14 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 5 ms 596 KB Output is correct
10 Correct 5 ms 440 KB Output is correct
11 Correct 5 ms 608 KB Output is correct
12 Correct 5 ms 440 KB Output is correct
13 Correct 5 ms 608 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 436 KB Output is correct
21 Correct 6 ms 444 KB Output is correct
22 Correct 5 ms 436 KB Output is correct
23 Correct 5 ms 444 KB Output is correct
24 Correct 5 ms 868 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 6 ms 436 KB Output is correct
31 Correct 7 ms 440 KB Output is correct
32 Correct 7 ms 432 KB Output is correct
33 Correct 7 ms 600 KB Output is correct
34 Correct 7 ms 600 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 6 ms 600 KB Output is correct
37 Correct 10 ms 692 KB Output is correct
38 Correct 8 ms 852 KB Output is correct
39 Correct 7 ms 440 KB Output is correct
40 Correct 8 ms 856 KB Output is correct
41 Correct 7 ms 600 KB Output is correct
42 Correct 8 ms 600 KB Output is correct
43 Correct 7 ms 596 KB Output is correct
44 Correct 7 ms 444 KB Output is correct
45 Correct 12 ms 344 KB Output is correct
46 Correct 10 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 10 ms 344 KB Output is correct
50 Correct 6 ms 600 KB Output is correct
51 Correct 7 ms 688 KB Output is correct
52 Correct 7 ms 436 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 7 ms 696 KB Output is correct
55 Correct 7 ms 600 KB Output is correct
56 Correct 5 ms 856 KB Output is correct
57 Correct 7 ms 704 KB Output is correct
58 Correct 9 ms 612 KB Output is correct
59 Correct 8 ms 860 KB Output is correct
60 Correct 9 ms 856 KB Output is correct
61 Correct 7 ms 704 KB Output is correct
62 Correct 7 ms 604 KB Output is correct
63 Correct 8 ms 600 KB Output is correct
64 Correct 7 ms 452 KB Output is correct

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 13 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 6 ms 448 KB Output is correct
6 Correct 12 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 5 ms 344 KB Output is correct
10 Correct 4 ms 440 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 4 ms 444 KB Output is correct
13 Correct 5 ms 444 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 10 ms 344 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 7 ms 436 KB Output is correct
27 Correct 7 ms 432 KB Output is correct
28 Correct 7 ms 440 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 6 ms 344 KB Output is correct
31 Correct 7 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 11 ms 344 KB Output is correct
34 Correct 9 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 6 ms 440 KB Output is correct
38 Correct 7 ms 692 KB Output is correct
39 Correct 8 ms 432 KB Output is correct
40 Correct 5 ms 600 KB Output is correct
41 Correct 8 ms 604 KB Output is correct
42 Correct 7 ms 600 KB Output is correct
43 Correct 5 ms 864 KB Output is correct
44 Correct 5 ms 444 KB Output is correct
45 Correct 5 ms 440 KB Output is correct
46 Correct 6 ms 448 KB Output is correct
47 Partially correct 7 ms 868 KB Output is partially correct
48 Partially correct 9 ms 448 KB Output is partially correct
49 Partially correct 7 ms 700 KB Output is partially correct
50 Partially correct 8 ms 600 KB Output is partially correct
51 Partially correct 9 ms 600 KB Output is partially correct
52 Correct 8 ms 600 KB Output is correct
53 Correct 8 ms 856 KB Output is correct
54 Correct 7 ms 1108 KB Output is correct
55 Correct 7 ms 600 KB Output is correct
56 Partially correct 8 ms 444 KB Output is partially correct
57 Partially correct 7 ms 600 KB Output is partially correct
58 Partially correct 7 ms 608 KB Output is partially correct
59 Partially correct 6 ms 600 KB Output is partially correct
60 Correct 6 ms 600 KB Output is correct
61 Correct 7 ms 600 KB Output is correct
62 Correct 6 ms 704 KB Output is correct
63 Partially correct 8 ms 860 KB Output is partially correct
64 Partially correct 8 ms 692 KB Output is partially correct
65 Partially correct 9 ms 864 KB Output is partially correct
66 Partially correct 7 ms 440 KB Output is partially correct
67 Correct 8 ms 608 KB Output is correct
68 Correct 7 ms 604 KB Output is correct
69 Partially correct 9 ms 608 KB Output is partially correct
70 Partially correct 8 ms 856 KB Output is partially correct
71 Partially correct 10 ms 704 KB Output is partially correct
72 Partially correct 8 ms 864 KB Output is partially correct
73 Partially correct 8 ms 692 KB Output is partially correct
74 Partially correct 7 ms 708 KB Output is partially correct
75 Correct 7 ms 448 KB Output is correct
76 Correct 7 ms 600 KB Output is correct
77 Partially correct 8 ms 612 KB Output is partially correct
78 Partially correct 8 ms 696 KB Output is partially correct
79 Partially correct 8 ms 708 KB Output is partially correct
80 Partially correct 9 ms 696 KB Output is partially correct
81 Correct 7 ms 604 KB Output is correct
82 Correct 10 ms 1096 KB Output is correct