oj.uz

Submission #1073364

# Submission time Handle Problem Language Result Execution time Memory
1073364 2024-08-24T13:33:56 Z Unforgettablepl Longest Trip (IOI23_longesttrip) C++17
15 / 100
 923 ms 1272 KB 
#pragma GCC optimize("Ofast","unroll-all-loops")
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> longest_trip(int N,int D){
    vector<vector<int>> adj(N);
    vector areConnected(N,vector<bool>(N));
    for(int i=0;i<N;i++) {
        for(int j=i+1;j<N;j++) {
            if(are_connected({i},{j})) {
                adj[i].emplace_back(j);
                adj[j].emplace_back(i);
                areConnected[i][j]=areConnected[j][i]=true;
            }
        }
    }
    {
        // Case 1 if two components
        int isTwo = -1;
        {
            vector<bool> visited(N);
            int curr = 0;
            function<void(int)> dfs = [&](int x) {
                if(visited[x])return;
                visited[x]=true;
                curr++;
                for(int&i:adj[x])dfs(i);
            };
            dfs(0);
            if(curr!=N) {
                if(curr>=N-curr)isTwo=curr;
                else {
                    for(int i=0;i<N;i++) {
                        if(!visited[i]){
                            isTwo=i;break;
                        }
                    }
                }
            }
        }
        if(isTwo!=-1) {
            vector<bool> visited(N);
            vector<int> ans;
            function<void(int)> dfs = [&](int x) {
                visited[x]=true;
                ans.emplace_back(x);
                for(int&i:adj[x])if(!visited[i]) {
                    dfs(i);
                    return;
                }
            };
            dfs(isTwo);
            return ans;
        }
    }
    vector<vector<int>> path(3);
    vector<bool> visited(N);
    function<int(int,int)> dfs = [&](int x,int def) {
        visited[x]=true;
        int state = def;
        int children = 0;
        for(int&i:adj[x])if(!visited[i]) {
            children++;
            if(children==2) {
                assert(dfs(i,2)==2);
                state=0;
                break;
            }
            auto ans = dfs(i,def);
            if(ans==0) {
                state = 0;
                break;
            }
        }
        path[state].emplace_back(x);
        return state;
    };
    auto curr = dfs(0,1);
    if(curr==1) {
        return path[1];
    }
    assert(curr==0);
    if(path[0].size()==1) {
        vector<int> ans = path[1];
        ans.emplace_back(path[0][0]);
        reverse(path[2].begin(),path[2].end());
        for(int&i:path[2])ans.emplace_back(i);
        return ans;
    }
    if(!areConnected[path[0][1]][path[1][0]])swap(path[1],path[2]);
    assert(areConnected[path[0][1]][path[1][0]]);
    path[1].emplace_back(path[0][0]);
    path[0].erase(path[0].begin());
    reverse(path[0].begin(),path[0].end());
    reverse(path[2].begin(),path[2].end());
    auto ans = path[0];
    for(int&i:path[1])ans.emplace_back(i);
    for(int&i:path[2])ans.emplace_back(i);
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 213 ms 860 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 19 ms 344 KB Output is correct
3 Correct 173 ms 440 KB Output is correct
4 Correct 403 ms 752 KB Output is correct
5 Correct 899 ms 1108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 145 ms 440 KB Output is correct
4 Correct 412 ms 848 KB Output is correct
5 Correct 820 ms 744 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Correct 163 ms 344 KB Output is correct
9 Correct 341 ms 752 KB Output is correct
10 Correct 829 ms 792 KB Output is correct
11 Correct 854 ms 1272 KB Output is correct
12 Correct 842 ms 1112 KB Output is correct
13 Correct 879 ms 1112 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 162 ms 436 KB Output is correct
4 Correct 429 ms 692 KB Output is correct
5 Correct 876 ms 1232 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 28 ms 436 KB Output is correct
8 Correct 138 ms 436 KB Output is correct
9 Correct 306 ms 728 KB Output is correct
10 Correct 765 ms 912 KB Output is correct
11 Correct 873 ms 892 KB Output is correct
12 Correct 842 ms 1260 KB Output is correct
13 Correct 885 ms 812 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Incorrect 10 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Partially correct 150 ms 700 KB Output is partially correct
4 Partially correct 408 ms 512 KB Output is partially correct
5 Partially correct 923 ms 968 KB Output is partially correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 32 ms 344 KB Output is correct
8 Partially correct 185 ms 344 KB Output is partially correct
9 Partially correct 348 ms 736 KB Output is partially correct
10 Partially correct 865 ms 988 KB Output is partially correct
11 Partially correct 835 ms 1084 KB Output is partially correct
12 Partially correct 895 ms 756 KB Output is partially correct
13 Partially correct 910 ms 848 KB Output is partially correct
14 Incorrect 1 ms 344 KB Incorrect
15 Halted 0 ms 0 KB -