oj.uz

Submission #841778

# Submission time Handle Problem Language Result Execution time Memory
841778 2023-09-02T05:18:22 Z flashmt Longest Trip (IOI23_longesttrip) C++17
15 / 100
 11 ms 852 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

void mergePath(vector<int> &c0, vector<int> c1)
{
  while (!c1.empty())
  {
    c0.push_back(c1.back());
    c1.pop_back();
  }
}

vector<int> longest_trip(int n, int d)
{
  vector<int> c[2];
  c[0] = {0};
  int checkedLast = 0;
  for (int i = 1; i < n; i++)
  {
    int x = c[0].back();
    if (are_connected({i}, {x}))
    {
      c[0].push_back(i);
      checkedLast = 0;
    }
    else if (empty(c[1]) || checkedLast)
    {
      c[1].push_back(i);
      checkedLast = 1;
    }
    else
    {
      int y = c[1].back();
      if (are_connected({i}, {y}))
      {
        c[1].push_back(i);
        checkedLast = 1;
      }
      else if (i + 1 < n)
      {
        if (are_connected({i}, {i + 1}))
        {
          mergePath(c[0], c[1]);
          c[1] = {i, i + 1};
        }
        else
        {
          c[0].push_back(i + 1);
          mergePath(c[0], c[1]);
          c[1] = {i};
        }
        i++;
        checkedLast = 0;
      }
      else
      {
        mergePath(c[0], c[1]);
        checkedLast = 0;
      }
    }
  }

  if (size(c[1]) > size(c[0]))
    swap(c[0], c[1]);

  if (empty(c[1]))
    return c[0];

  if (!are_connected(c[0], c[1]))
    return c[0];

  for (int u : {0, 1})
  {
    int v = u ^ 1;
    int x = c[v][0];

    if (are_connected({x}, {c[u][0]}))
    {
      reverse(begin(c[u]), end(c[u]));
      for (int y : c[v])
        c[u].push_back(y);
      return c[u];
    }

    if (are_connected({x}, {c[u].back()}))
    {
      for (int y : c[v])
        c[u].push_back(y);
      return c[u];
    }
  }

  // both c[0] and c[1] are cycles
  int low = 0, high = size(c[0]);
  while (high - low > 1)
  {
    int mid = (low + high) / 2;
    if (are_connected(vector<int>(begin(c[0]) + low, begin(c[0]) + mid), c[1])) high = mid;
    else low = mid;
  }
  int id0 = low;

  low = 0, high = size(c[1]);
  while (high - low > 1)
  {
    int mid = (low + high) / 2;
    if (are_connected(vector<int>(begin(c[1]) + low, begin(c[1]) + mid), {c[0][id0]})) high = mid;
    else low = mid;
  }
  int id1 = low;

  if (id0 < size(c[0]) - 1)
    rotate(begin(c[0]), begin(c[0]) + (id0 + 1), end(c[0]));
  rotate(begin(c[1]), begin(c[1]) + id1, end(c[1]));
  for (int i : c[1])
    c[0].push_back(i);
  return c[0];
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:113:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   if (id0 < size(c[0]) - 1)
      |       ~~~~^~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 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 6 ms 600 KB Output is correct
6 Correct 11 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 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 7 ms 608 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 6 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 11 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 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Incorrect 3 ms 344 KB invalid array
16 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 5 ms 344 KB Output is correct
6 Correct 7 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 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 8 ms 340 KB Output is correct
15 Incorrect 4 ms 596 KB invalid array
16 Halted 0 ms 0 KB -