Submission #962546

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
962546	2024-04-13 19:05:26	alex_2008	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	16 ms	1116 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
#include "longesttrip.h"
#include <vector>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <chrono>
#include <random>
using namespace std;
bool find_edge(int a, int b) {
  return are_connected({ a }, { b });
}
vector <int> longest_trip(int n, int d) {
  vector <int> perm(n);
  for (int i = 0; i < n; i++) {
    perm[i] = i;
  }
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  shuffle(perm.begin(), perm.end(), rng);
  vector <int> p1, p2;
  p1.push_back(perm[0]);
  p2.push_back(perm[1]);
  for (int i = 2; i < n - 1; i += 2) {
    int a = perm[i], b = perm[i + 1];
    if (find_edge(a, b)) {
      if (find_edge(p1.back(), a)) {
        p1.push_back(a);
        p1.push_back(b);
      }
      else if (find_edge(p2.back(), a)) {
        p2.push_back(a);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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