oj.uz

Submission #845784

# Submission time Handle Problem Language Result Execution time Memory
845784 2023-09-06T15:32:28 Z leinad2 Longest Trip (IOI23_longesttrip) C++17
15 / 100
 9 ms 852 KB 
#include "longesttrip.h"

#include<bits/stdc++.h>
using namespace std;
int i, j, k, a, b, A[260][260], B[260];
vector<int> longest_trip(int N, int D)
{
    vector<int>v1, v2;
    v1.push_back(0);
    v2.push_back(1);
    bool flag=false;
    for(i=2;i<N;i++)
    {
        vector<int>X, Y, Z;
        X.push_back(v1.back());Y.push_back(i);Z.push_back(v2.back());
        if(are_connected(X, Y))v1.push_back(i),flag=false;
        else if(flag)v2.push_back(i);
        else if(are_connected(Z, Y))
        {
            flag=true;
            v2.push_back(i);
        }
        else
        {
            while(v2.size())
            {
                v1.push_back(v2.back());
                v2.pop_back();
            }
            v2.push_back(i);
        }
    }
    if(are_connected(v1, v2)==0)
    {
        if(v1.size()<v2.size())swap(v1, v2);
        return v1;
    }
    vector<int>X, Y, Z, W;
    X.push_back(v1.back());
    Z.push_back(v2[0]);W.push_back(v2.back());
    if(are_connected(X, Z))
    {
        for(auto p:v2)v1.push_back(p);
        return v1;
    }
    if(are_connected(X, W))
    {
        while(v2.size())
        {
            v1.push_back(v2.back());
            v2.pop_back();
        }
        return v1;
    }
    if(are_connected(X, v2))
    {
        int s=0, e=v2.size()-1;
        while(s<e)
        {
            int m=s+e>>1;
            vector<int>V;
            for(i=0;i<=m;i++)V.push_back(v2[i]);
            if(are_connected(X, V))e=m;
            else s=m+1;
        }
        for(i=s;i<v2.size();i++)v1.push_back(v2[i]);
        for(i=0;i<s;i++)v1.push_back(v2[i]);
        return v1;
    }
    Y.push_back(v1[0]);
    if(are_connected(Y, v2))
    {
        int s=0, e=v2.size()-1;
        while(s<e)
        {
            int m=s+e>>1;
            vector<int>V;
            for(i=0;i<=m;i++)V.push_back(v2[i]);
            if(are_connected(Y, V))e=m;
            else s=m+1;
        }
        reverse(v1.begin(), v1.end());
        for(i=s;i<v2.size();i++)v1.push_back(v2[i]);
        for(i=0;i<s;i++)v1.push_back(v2[i]);
        return v1;
    }
    int s=0, e=v1.size()-1;
    while(s<e)
    {
        int m=s+e>>1;
        vector<int>V;
        for(i=0;i<=m;i++)V.push_back(v1[i]);
        if(are_connected(V, v2))e=m;
        else s=m+1;
    }
    int ss=s;
    s=0, e=v2.size()-1;
    X[0]=v1[s];
    while(s<e)
    {
        int m=s+e>>1;
        vector<int>V;
        for(i=0;i<=m;i++)V.push_back(v2[i]);
        if(are_connected(X, V))e=m;
        else s=m+1;
    }
    vector<int>ans;
    for(i=ss-1;i>=0;i--)ans.push_back(v1[i]);
    for(i=v1.size()-1;i>=ss;i--)ans.push_back(v1[i]);
    for(i=s;i<v2.size();i++)ans.push_back(v2[i]);
    for(i=0;i<s;i++)ans.push_back(v2[i]);
    v1=v2;
        for(i=0;i+1<v1.size();i++)assert(are_connected({v1[i]}, {v1[i+1]}));
    return v2;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:60:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |             int m=s+e>>1;
      |                   ~^~
longesttrip.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for(i=s;i<v2.size();i++)v1.push_back(v2[i]);
      |                 ~^~~~~~~~~~
longesttrip.cpp:76:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |             int m=s+e>>1;
      |                   ~^~
longesttrip.cpp:83:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(i=s;i<v2.size();i++)v1.push_back(v2[i]);
      |                 ~^~~~~~~~~~
longesttrip.cpp:90:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |         int m=s+e>>1;
      |               ~^~
longesttrip.cpp:101:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |         int m=s+e>>1;
      |               ~^~
longesttrip.cpp:110:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for(i=s;i<v2.size();i++)ans.push_back(v2[i]);
      |             ~^~~~~~~~~~
longesttrip.cpp:113:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |         for(i=0;i+1<v1.size();i++)assert(are_connected({v1[i]}, {v1[i+1]}));
      |                 ~~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 440 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 7 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 4 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 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 608 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
0.0 / 25.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 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 8 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 5 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.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 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Incorrect 1 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -