oj.uz

Submission #1007255

# Submission time Handle Problem Language Result Execution time Memory
1007255 2024-06-24T13:54:55 Z Amr Longest Trip (IOI23_longesttrip) C++17
15 / 100
 13 ms 596 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define sz size()
#define all(x) (x).begin(), (x).end()
vector<int> v1,v2;
vector<int> go(ll x, ll y)
{
    if(x) reverse(all(v1));
    if(y) reverse(all(v2));
    for(int i = 0; i < v2.sz; i++) v1.push_back(v2[i]);
    return v1;
}
std::vector<int> longest_trip(int N, int D)
{
    v1.clear(); v2.clear();
    v1.push_back(0);
    for(int i = 1; i < N; i++)
    {
        bool bo = are_connected({v1.back()},{i});
        if(bo==1) v1.push_back(i);
        else
        {
            if(v2.sz==0) v2.push_back(i);
            else
            {
                bo = are_connected({v2.back()},{i});
                if(bo==1) v2.push_back(i);
                else
                {
                    reverse(all(v2));
                    for(int j = 0; j < v2.sz; j++) v1.push_back(v2[j]); v2.clear();
                    v2.push_back(i);
                }
            }
        }
    }
    if(v2.sz==0) return v1;
    //if(v1.sz>v2.sz) return v1; else return v2;
    bool b1 = are_connected({v1[0]},{v2[0]});
    bool b2 = are_connected({v1[0]},{v2.back()});
    bool b3 = are_connected({v1.back()},{v2[0]});
    bool b4 = are_connected({v1.back()},{v2.back()});

    if(b1)
    {
        return go(1,0);
    }
    else if(b2)
    {
        return go(1,1);
    }
    else if(b3)
    {
        return go(0,0);
    }
    else if(b4)
    {
        return go(0,1);
    }
    // not connecteed
    bool both = are_connected(v1,v2);
    if(both==0)
    {
        if(v1.sz>v2.sz) return v1; else return v2;
    }
    // connected
    ll l = 0, r = v1.sz-1;
    while(l<r)
    {
        ll mid = (l+r)/2;
        vector<int> vv;
        for(int i = l; i <= mid; i++) vv.push_back(v1[i]);
        bool m = are_connected(vv,v2);
        if(m) r = mid; else l = mid+1;
    }
    ll node1 = l;
    l = 0, r = v2.sz-1;
    while(l<r)
    {
        ll mid = (l+r)/2;
        vector<int> vv;
        for(int i = l; i <= mid; i++) vv.push_back(v2[i]);
        bool m = are_connected(vv,{node1});
        if(m) r = mid; else l = mid+1;
    }
    ll node2 = l;
    vector<int> ans;
    for(int i = node1+1; i < v1.sz; i++) ans.push_back(v1[i]);
    for(int i = 0; i <= node1; i++) ans.push_back(v1[i]);
    for(int i = node2; i < v2.sz; i++) ans.push_back(v2[i]);
    for(int i = 0; i < node2; i++) ans.push_back(v2[i]);
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> go(ll, ll)':
longesttrip.cpp:15:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i = 0; i < v2.sz; i++) v1.push_back(v2[i]);
      |                      ^
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:36:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |                     for(int j = 0; j < v2.sz; j++) v1.push_back(v2[j]); v2.clear();
      |                                      ^
longesttrip.cpp:36:21: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   36 |                     for(int j = 0; j < v2.sz; j++) v1.push_back(v2[j]); v2.clear();
      |                     ^~~
longesttrip.cpp:36:73: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   36 |                     for(int j = 0; j < v2.sz; j++) v1.push_back(v2[j]); v2.clear();
      |                                                                         ^~
longesttrip.cpp:88:36: warning: narrowing conversion of 'node1' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   88 |         bool m = are_connected(vv,{node1});
      |                                    ^~~~~
longesttrip.cpp:88:36: warning: narrowing conversion of 'node1' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
longesttrip.cpp:93:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(int i = node1+1; i < v1.sz; i++) ans.push_back(v1[i]);
      |                            ^
longesttrip.cpp:95:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for(int i = node2; i < v2.sz; 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 3 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 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 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 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 5 ms 344 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 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 9 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 7 ms 412 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 13 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Incorrect 8 ms 596 KB non-disjoint arrays
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 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 13 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 4 ms 344 KB non-disjoint arrays
17 Halted 0 ms 0 KB -