답안 #841783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
841783	2023-09-02T05:28:46 Z	flashmt	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	11 ms	856 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

void mergePath(vector<int> &c0, vector<int> &c1)
{
  while (!empty(c1))
  {
    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]);
        c[1] = {i};
        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:114:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |   if (id0 < size(c[0]) - 1)
      |       ~~~~^~~~~~~~~~~~~~~~

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	436 KB	Output is correct

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	344 KB	Output is correct
2	Correct	6 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	340 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	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	4 ms	344 KB	Output is correct
6	Correct	7 ms	344 KB	Output is correct
7	Correct	5 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	5 ms	600 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	4 ms	344 KB	Output is correct

Subtask #3

25.0 / 25.0

#	결과	실행 시간	메모리	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	4 ms	344 KB	Output is correct
5	Correct	4 ms	600 KB	Output is correct
6	Correct	7 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	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	4 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	6 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	6 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	5 ms	436 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	6 ms	600 KB	Output is correct
22	Correct	5 ms	344 KB	Output is correct
23	Correct	5 ms	436 KB	Output is correct
24	Correct	5 ms	604 KB	Output is correct
25	Correct	6 ms	344 KB	Output is correct
26	Correct	8 ms	344 KB	Output is correct
27	Correct	5 ms	344 KB	Output is correct
28	Correct	6 ms	344 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	4 ms	344 KB	Output is correct
31	Correct	5 ms	344 KB	Output is correct
32	Correct	6 ms	344 KB	Output is correct
33	Correct	5 ms	344 KB	Output is correct
34	Correct	6 ms	344 KB	Output is correct
35	Correct	5 ms	344 KB	Output is correct
36	Correct	5 ms	600 KB	Output is correct
37	Correct	5 ms	600 KB	Output is correct
38	Correct	5 ms	344 KB	Output is correct
39	Correct	6 ms	600 KB	Output is correct
40	Correct	5 ms	344 KB	Output is correct
41	Correct	5 ms	344 KB	Output is correct
42	Correct	5 ms	344 KB	Output is correct
43	Correct	6 ms	608 KB	Output is correct
44	Correct	5 ms	596 KB	Output is correct
45	Correct	9 ms	596 KB	Output is correct
46	Correct	8 ms	344 KB	Output is correct
47	Correct	7 ms	344 KB	Output is correct
48	Correct	8 ms	344 KB	Output is correct
49	Correct	8 ms	344 KB	Output is correct
50	Correct	5 ms	344 KB	Output is correct
51	Correct	6 ms	344 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	5 ms	600 KB	Output is correct
54	Correct	5 ms	344 KB	Output is correct
55	Correct	5 ms	344 KB	Output is correct
56	Correct	5 ms	344 KB	Output is correct
57	Correct	5 ms	344 KB	Output is correct
58	Correct	5 ms	600 KB	Output is correct
59	Correct	7 ms	440 KB	Output is correct
60	Correct	6 ms	856 KB	Output is correct
61	Correct	6 ms	344 KB	Output is correct
62	Correct	6 ms	344 KB	Output is correct
63	Correct	6 ms	436 KB	Output is correct
64	Correct	6 ms	344 KB	Output is correct

Subtask #4

60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 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	4 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	5 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	5 ms	344 KB	Output is correct
14	Correct	7 ms	344 KB	Output is correct
15	Correct	8 ms	344 KB	Output is correct
16	Correct	8 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	5 ms	440 KB	Output is correct
20	Correct	5 ms	600 KB	Output is correct
21	Correct	7 ms	344 KB	Output is correct
22	Correct	6 ms	344 KB	Output is correct
23	Correct	6 ms	344 KB	Output is correct
24	Correct	5 ms	344 KB	Output is correct
25	Correct	8 ms	344 KB	Output is correct
26	Correct	5 ms	344 KB	Output is correct
27	Correct	6 ms	344 KB	Output is correct
28	Correct	6 ms	344 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	4 ms	344 KB	Output is correct
31	Correct	4 ms	344 KB	Output is correct
32	Correct	11 ms	344 KB	Output is correct
33	Correct	9 ms	344 KB	Output is correct
34	Correct	8 ms	344 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	8 ms	344 KB	Output is correct
37	Correct	6 ms	344 KB	Output is correct
38	Correct	6 ms	344 KB	Output is correct
39	Correct	7 ms	344 KB	Output is correct
40	Correct	6 ms	600 KB	Output is correct
41	Correct	5 ms	344 KB	Output is correct
42	Correct	5 ms	344 KB	Output is correct
43	Correct	5 ms	436 KB	Output is correct
44	Correct	6 ms	344 KB	Output is correct
45	Correct	5 ms	440 KB	Output is correct
46	Correct	5 ms	444 KB	Output is correct
47	Correct	5 ms	344 KB	Output is correct
48	Correct	5 ms	344 KB	Output is correct
49	Correct	5 ms	344 KB	Output is correct
50	Correct	5 ms	344 KB	Output is correct
51	Correct	5 ms	344 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	5 ms	600 KB	Output is correct
54	Correct	5 ms	600 KB	Output is correct
55	Correct	6 ms	432 KB	Output is correct
56	Correct	5 ms	344 KB	Output is correct
57	Correct	5 ms	344 KB	Output is correct
58	Correct	8 ms	600 KB	Output is correct
59	Correct	5 ms	344 KB	Output is correct
60	Correct	6 ms	600 KB	Output is correct
61	Correct	5 ms	344 KB	Output is correct
62	Correct	4 ms	344 KB	Output is correct
63	Correct	4 ms	344 KB	Output is correct
64	Correct	5 ms	600 KB	Output is correct
65	Correct	6 ms	596 KB	Output is correct
66	Correct	6 ms	440 KB	Output is correct
67	Correct	6 ms	436 KB	Output is correct
68	Correct	6 ms	344 KB	Output is correct
69	Correct	6 ms	604 KB	Output is correct
70	Correct	7 ms	344 KB	Output is correct
71	Correct	5 ms	344 KB	Output is correct
72	Correct	5 ms	600 KB	Output is correct
73	Correct	6 ms	440 KB	Output is correct
74	Correct	6 ms	604 KB	Output is correct
75	Correct	7 ms	344 KB	Output is correct
76	Correct	7 ms	344 KB	Output is correct
77	Correct	6 ms	344 KB	Output is correct
78	Correct	6 ms	344 KB	Output is correct
79	Correct	7 ms	748 KB	Output is correct
80	Correct	6 ms	612 KB	Output is correct
81	Correct	6 ms	344 KB	Output is correct
82	Correct	7 ms	344 KB	Output is correct