oj.uz

Submission #845780

# Submission time Handle Problem Language Result Execution time Memory
845780 2023-09-06T15:30:08 Z leinad2 Longest Trip (IOI23_longesttrip) C++17
15 / 100
 12 ms 600 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);
        }
    }
    for(i=0;i+1<v1.size();i++)assert(are_connected({v1[i]}, {v1[i+1]}));
    for(i=0;i+1<v2.size();i++)assert(are_connected({v2[i]}, {v2[i+1]}));
    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;
    return v2;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:33:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(i=0;i+1<v1.size();i++)assert(are_connected({v1[i]}, {v1[i+1]}));
      |             ~~~^~~~~~~~~~
longesttrip.cpp:34:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(i=0;i+1<v2.size();i++)assert(are_connected({v2[i]}, {v2[i+1]}));
      |             ~~~^~~~~~~~~~
longesttrip.cpp:62:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |             int m=s+e>>1;
      |                   ~^~
longesttrip.cpp:68:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(i=s;i<v2.size();i++)v1.push_back(v2[i]);
      |                 ~^~~~~~~~~~
longesttrip.cpp:78:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |             int m=s+e>>1;
      |                   ~^~
longesttrip.cpp:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(i=s;i<v2.size();i++)v1.push_back(v2[i]);
      |                 ~^~~~~~~~~~
longesttrip.cpp:92:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |         int m=s+e>>1;
      |               ~^~
longesttrip.cpp:103:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  103 |         int m=s+e>>1;
      |               ~^~
longesttrip.cpp:112:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for(i=s;i<v2.size();i++)ans.push_back(v2[i]);
      |             ~^~~~~~~~~~

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 596 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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