제출 #847522

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
847522	2023-09-09 19:04:29	rainboy	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	11 ms	936 KiB

longesttrip

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/* upsolved using some ideas from EmeraldBlock */
#include "longesttrip.h"
#include <vector>
using namespace std;
typedef vector<int> vi;
const int N = 256;
int qu1[N], qu2[N], cnt1, cnt2;
vi longest_trip(int n, int d) {
  cnt1 = cnt2 = 0;
  for (int i = 0; i < n; i++)
    if (cnt1 == 0)
      qu1[cnt1++] = i;
    else if (cnt2 == 0)
      qu2[cnt2++] = i;
    else if (are_connected({ qu1[cnt1 - 1] }, { i }))
      qu1[cnt1++] = i;
    else if (i + 1 == n) {
      if (!are_connected({ qu2[cnt2 - 1] }, { i }))
        while (cnt2)
          qu1[cnt1++] = qu2[--cnt2];
      qu2[cnt2++] = i;
    } else {
      if (are_connected({ i }, { i + 1 })) {
        if (!are_connected({ qu2[cnt2 - 1] }, { i }))
          while (cnt2)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 60 / 60