oj.uz

Submission #1063974

# Submission time Handle Problem Language Result Execution time Memory
1063974 2024-08-18T07:16:04 Z amirhoseinfar1385 Longest Trip (IOI23_longesttrip) C++17
40 / 100
 14 ms 600 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;

std::vector<int> longest_trip(int N, int D)
{
    if(D==3){
        vector<int>ret;
        for(int i=0;i<N;i++){
           ret.push_back(i);
        }
        return ret;
    }else if(D==2){
        deque<int>dq;
        int now=0;
        if(are_connected({0},{1})){
            dq.push_back(0);
            dq.push_back(1);
            now=2;
        }else{
            dq.push_back(0);
            dq.push_back(2);
            dq.push_back(1);
            now=3;
        }
        for(;now<N;now++){
            if(are_connected({dq.front()},{now})){
                dq.push_front(now);
            }else{
                dq.push_back(now);
            }
        }
        vector<int>ret;
        for(auto x:dq){
            ret.push_back(x);
        }
        return ret;
    }
    int n=N;
    vector<int>all;
    for(int i=0;i<n;i++){
        all.push_back(i);
    }
    vector<vector<int>>ans(2);
    ans[0].push_back(all[0]);
    for(int i=1;i<n;i++){
        int cn0=are_connected({ans[0].back()},{all[i]});
        int cn1=0;
        if((int)ans[1].size()>0){
            if(are_connected({ans[1].back()},{all[i]})){
                cn1=1;
            }
        }
        if(cn1==1&&cn0==1){
            ans[0].push_back(all[i]);
            while((int)ans[1].size()>0){
                ans[0].push_back(ans[1].back());
                ans[1].pop_back();
            }
        }else if(cn0==1){
            ans[0].push_back(all[i]);
        }else{
            ans[1].push_back(all[i]);
        }
    }
    if((int)ans[0].size()<(int)ans[1].size()){
        swap(ans[0],ans[1]);
    }
    return ans[0];
}

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 5 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 3 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 7 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 6 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 6 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 3 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 8 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 11 ms 344 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 6 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 9 ms 344 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 11 ms 344 KB Output is correct
40 Correct 9 ms 344 KB Output is correct
41 Correct 14 ms 344 KB Output is correct
42 Correct 9 ms 344 KB Output is correct
43 Correct 8 ms 344 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 7 ms 344 KB Output is correct
51 Correct 9 ms 344 KB Output is correct
52 Correct 10 ms 344 KB Output is correct
53 Correct 7 ms 344 KB Output is correct
54 Correct 7 ms 340 KB Output is correct
55 Correct 9 ms 344 KB Output is correct
56 Correct 9 ms 344 KB Output is correct
57 Correct 9 ms 344 KB Output is correct
58 Correct 10 ms 344 KB Output is correct
59 Correct 9 ms 344 KB Output is correct
60 Correct 13 ms 344 KB Output is correct
61 Correct 10 ms 344 KB Output is correct
62 Correct 6 ms 344 KB Output is correct
63 Correct 8 ms 344 KB Output is correct
64 Correct 9 ms 344 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 6 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 348 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -