oj.uz

Submission #848226

# Submission time Handle Problem Language Result Execution time Memory
848226 2023-09-11T17:27:19 Z bachhoangxuan Longest Trip (IOI23_longesttrip) C++17
30 / 100
 13 ms 1120 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=305;
vector<int> cc[maxn];

vector<int> longest_trip(int N, int D)
{
    for(int i=0;i<N;i++) cc[i].clear();
    vector<int> res={0};
    set<int> s;
    for(int i=1;i<N;i++){
        cc[i].push_back(i);
        s.insert(i);
    }
    while(!s.empty()){
        int st=-1;
        bool check=false;
        vector<int> del;
        for(int x:s){
            del.push_back(x);
            if(!are_connected({res.back()},cc[x])){
                if(st==-1) st=x;
                else for(int u:cc[x]) cc[st].push_back(u);
            }
            else{
                check=true;
                int l=1,r=(int)cc[x].size();
                while(l<r){
                    int mid=(l+r)>>1;
                    vector<int> v(cc[x].begin(),cc[x].begin()+mid);
                    if(are_connected({res.back()},v)) r=mid;
                    else l=mid+1;
                }
                r--;
                res.push_back(cc[x][r]);
                for(int u:cc[x]) if(u!=cc[x][r]) res.push_back(u);
                break;
            }
        }
        for(int x:del) s.erase(x);
        if(!check){
            int l=1,r=(int)cc[st].size(),p=-1;
            while(l<r){
                int mid=(l+r)>>1;
                vector<int> v(cc[st].begin(),cc[st].begin()+mid);
                if(are_connected(res,v)) p=cc[st][mid-1],r=mid;
                else l=mid+1;
            }
            if(p==-1){
                if((int)cc[st].size()>(int)res.size()) swap(res,cc[st]);
            }
            else{
                reverse(res.begin(),res.end());
                if(!are_connected({res.back()},{p})){
                    l=1,r=(int)res.size();
                    while(l<r){
                        int mid=(l+r)>>1;
                        vector<int> v(res.begin(),res.begin()+mid);
                        if(are_connected({p},v)) r=mid;
                        else l=mid+1;
                    }
                    res.insert(res.end(),res.begin(),res.begin()+r);
                    res.erase(res.begin(),res.begin()+r);

                }
                res.push_back(p);
                for(int u:cc[st]) if(u!=p) res.push_back(u);
            }
        }
        else if(st!=-1) s.insert(st);
    }
    return res;
}

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 344 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 5 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct

Subtask #2
0.0 / 10.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 4 ms 600 KB Output is correct
6 Incorrect 0 ms 556 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 7 ms 596 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 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 5 ms 340 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 7 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 6 ms 600 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 7 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 8 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 7 ms 448 KB Output is correct
32 Correct 7 ms 444 KB Output is correct
33 Correct 8 ms 452 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 6 ms 344 KB Output is correct
37 Correct 9 ms 344 KB Output is correct
38 Correct 11 ms 600 KB Output is correct
39 Correct 12 ms 596 KB Output is correct
40 Correct 10 ms 984 KB Output is correct
41 Correct 9 ms 464 KB Output is correct
42 Correct 9 ms 728 KB Output is correct
43 Correct 10 ms 472 KB Output is correct
44 Correct 10 ms 720 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 7 ms 344 KB Output is correct
47 Correct 6 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 6 ms 448 KB Output is correct
51 Correct 8 ms 452 KB Output is correct
52 Correct 8 ms 448 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 9 ms 600 KB Output is correct
55 Correct 10 ms 460 KB Output is correct
56 Correct 6 ms 344 KB Output is correct
57 Correct 8 ms 1120 KB Output is correct
58 Correct 9 ms 476 KB Output is correct
59 Correct 10 ms 716 KB Output is correct
60 Correct 9 ms 720 KB Output is correct
61 Correct 13 ms 864 KB Output is correct
62 Correct 9 ms 716 KB Output is correct
63 Correct 10 ms 976 KB Output is correct
64 Correct 9 ms 732 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -