oj.uz

Submission #1060264

# Submission time Handle Problem Language Result Execution time Memory
1060264 2024-08-15T12:25:41 Z Huseyn123 Longest Trip (IOI23_longesttrip) C++17
40 / 100
 452 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h> 
using namespace std; 
vector<int> a,b,c; 
bool f(int x,int l,int r){
    vector<int> d;
    for(int i=l;i<=r;i++){
        d.push_back(b[i]);
    }
    if((int)d.size()==0){
        return false;
    }
    return are_connected({a[x]},d);
}
vector<int> longest_trip(int N, int D){ 
    a.clear(); 
    b.clear(); 
    c.clear();
    vector<int> res;
    if(D==3){ 
        for(int i=0;i<N;i++){
            res.push_back(i);
        }
    }
    else if(D==2){
        set<int> c;
        for(int i=1;i<N;i++){
            c.insert(i);
        }
        res.push_back(0);
        for(int i=0;i<N-1;i++){
            auto it=c.begin();
            if(are_connected({res.back()},{*it})){
                res.push_back(*it);
            }
            else{
                ++it; 
                if(it==c.end()){
                    reverse(res.begin(),res.end());
                    --it; 
                    res.push_back(*it);
                }
                else{
                    res.push_back(*it);
                }
            }
            c.erase(*it);
        }
    }
    else{ 
        a.push_back(0); 
        b.push_back(1);
        for(int i=2;i<N;i++){
            if(are_connected({a.back()},{i})){
                a.push_back(i);
            }
            else if(are_connected({b.back()},{i})){
                b.push_back(i);
            }
            else{
                reverse(b.begin(),b.end()); 
                for(auto x:b){
                    a.push_back(x);
                }
                b.clear();
                b.push_back(i);
            }
        }
        int sz,sz1; 
        sz=(int)a.size(); 
        sz1=(int)b.size();
        for(int i=0;i<sz;i++){
            for(int j=0;j<sz1;j++){
                if(are_connected({a[i]},{b[j]})){
                    if(max(i+1,sz-i)+max(j+1,sz1-j)>(int)c.size()){
                        c.clear();
                        if(i+1>sz-i){
                            for(int z=0;z<=i;z++){
                                c.push_back(a[z]);
                            }
                        }
                        else{
                            for(int z=sz-1;z>=i;z--){
                                c.push_back(a[z]);
                            }
                        }
                        if(j+1>sz1-j){
                            for(int z=j;z>=0;z--){
                                c.push_back(b[z]);
                            }
                        }
                        else{
                            for(int z=j;z<sz1;z++){
                                c.push_back(b[z]);
                            }
                        }
                    }
                }
            }
        }
        if((int)a.size()>(int)b.size()){
            res=a;
        }
        else{
            res=b;
        }
        if((int)c.size()>(int)res.size()){
            res=c;
        }
    }
    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 10 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 9 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 16 ms 344 KB Output is correct
8 Correct 12 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 10 ms 600 KB Output is correct
11 Correct 15 ms 344 KB Output is correct
12 Correct 13 ms 344 KB Output is correct
13 Correct 13 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 12 ms 340 KB Output is correct
16 Correct 21 ms 344 KB Output is correct
17 Correct 15 ms 344 KB Output is correct
18 Correct 35 ms 344 KB Output is correct
19 Correct 22 ms 600 KB Output is correct
20 Correct 48 ms 600 KB Output is correct
21 Correct 45 ms 412 KB Output is correct
22 Correct 48 ms 344 KB Output is correct
23 Correct 60 ms 424 KB Output is correct
24 Correct 53 ms 592 KB Output is correct
25 Correct 9 ms 596 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 14 ms 344 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 77 ms 344 KB Output is correct
32 Correct 107 ms 344 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 16 ms 344 KB Output is correct
35 Correct 37 ms 344 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 65 ms 344 KB Output is correct
38 Correct 217 ms 344 KB Output is correct
39 Correct 345 ms 344 KB Output is correct
40 Correct 404 ms 344 KB Output is correct
41 Correct 404 ms 344 KB Output is correct
42 Correct 429 ms 344 KB Output is correct
43 Correct 452 ms 344 KB Output is correct
44 Correct 415 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 10 ms 344 KB Output is correct
49 Correct 11 ms 344 KB Output is correct
50 Correct 12 ms 344 KB Output is correct
51 Correct 74 ms 344 KB Output is correct
52 Correct 98 ms 408 KB Output is correct
53 Correct 28 ms 344 KB Output is correct
54 Correct 18 ms 596 KB Output is correct
55 Correct 47 ms 344 KB Output is correct
56 Correct 7 ms 340 KB Output is correct
57 Correct 69 ms 344 KB Output is correct
58 Correct 224 ms 344 KB Output is correct
59 Correct 386 ms 416 KB Output is correct
60 Correct 393 ms 412 KB Output is correct
61 Correct 435 ms 420 KB Output is correct
62 Correct 433 ms 412 KB Output is correct
63 Correct 451 ms 412 KB Output is correct
64 Correct 402 ms 412 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 8 ms 344 KB Output is correct
5 Partially correct 9 ms 344 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Partially correct 13 ms 344 KB Output is partially correct
10 Partially correct 12 ms 344 KB Output is partially correct
11 Partially correct 13 ms 428 KB Output is partially correct
12 Partially correct 14 ms 344 KB Output is partially correct
13 Partially correct 24 ms 416 KB Output is partially correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 2 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -