oj.uz

Submission #986962

# Submission time Handle Problem Language Result Execution time Memory
986962 2024-05-21T16:05:57 Z activedeltorre Longest Trip (IOI23_longesttrip) C++17
25 / 100
 8 ms 608 KB 
#include "longesttrip.h"
#include <deque>
#include <vector>
using namespace std;
int fre[100005];
deque<int>dq1;
deque<int>dq2;
vector<int>ans1,ans2;
int are_connecte(int a,int b)
{
    vector<int>pl1,pl2;
    pl1.push_back(a);
    pl2.push_back(b);
    return are_connected(pl1,pl2);
}
vector<int> longest_trip(int N, int D)
{
    int i,n=N,capst1,capdr1,capst2,capdr2;
    ans1.clear();
    ans2.clear();
    if(are_connecte(0,1)==1)
    {
        capst1=0;
        capdr1=1;
        dq1.push_front(1);
        dq1.push_front(0);
    }
    else
    {
        capst1=0;
        capdr1=0;
        capst2=1;
        capdr2=1;
        dq2.push_front(1);
        dq1.push_front(0);
    }
    for(i=2;i<n;i++)
    {
        if(dq2.size()==0)
        {
            capst2=i;
            capdr2=i;
            dq2.push_front(i);
        }
        else
        {
            if(are_connecte(i,capst1)==1)
            {
                capst1=i;
                dq1.push_front(i);
            }
            else if(are_connecte(i,capst2)==1)
            {
                capst2=i;
                dq2.push_front(i);
            }
            else
            {
                capst1=capdr2;
                while(dq2.size())
                {
                    dq1.push_front(dq2.front());
                    dq2.pop_front();
                }
                capst2=i;
                capdr2=i;
                dq2.push_front(i);
            }
        }
    }
    while(dq1.size())
    {
        ans1.push_back(dq1.front());
        dq1.pop_front();
    }
    while(dq2.size())
    {
        ans2.push_back(dq2.front());
        dq2.pop_front();
    }
    if(ans1.size()>=ans2.size())
    {
        return ans1;
    }
    return ans2;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:18:22: warning: variable 'capdr1' set but not used [-Wunused-but-set-variable]
   18 |     int i,n=N,capst1,capdr1,capst2,capdr2;
      |                      ^~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 4 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 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 4 ms 436 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 444 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 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 5 ms 608 KB Output is correct
22 Correct 6 ms 440 KB Output is correct
23 Correct 5 ms 600 KB Output is correct
24 Correct 5 ms 432 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 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 6 ms 344 KB Output is correct
30 Correct 5 ms 436 KB Output is correct
31 Correct 6 ms 600 KB Output is correct
32 Correct 6 ms 436 KB Output is correct
33 Correct 5 ms 344 KB Output is correct
34 Correct 4 ms 592 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 4 ms 608 KB Output is correct
37 Correct 4 ms 540 KB Output is correct
38 Correct 5 ms 344 KB Output is correct
39 Correct 5 ms 344 KB Output is correct
40 Correct 7 ms 440 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 8 ms 600 KB Output is correct
44 Correct 8 ms 432 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 4 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 4 ms 344 KB Output is correct
50 Correct 4 ms 432 KB Output is correct
51 Correct 7 ms 440 KB Output is correct
52 Correct 6 ms 432 KB Output is correct
53 Correct 4 ms 344 KB Output is correct
54 Correct 5 ms 344 KB Output is correct
55 Correct 6 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 5 ms 440 KB Output is correct
58 Correct 8 ms 600 KB Output is correct
59 Correct 7 ms 596 KB Output is correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 7 ms 444 KB Output is correct
62 Correct 6 ms 608 KB Output is correct
63 Correct 6 ms 600 KB Output is correct
64 Correct 6 ms 600 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -