Submission #996350

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
996350	2024-06-10 13:37:38	MilosMilutinovic	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	12 ms	612 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 <bits/stdc++.h>
using namespace std;
mt19937 rng(time(0));
vector<int> longest_trip(int n, int d) {
  auto Ask = [&](vector<int> a, vector<int> b) {
    return are_connected(a, b);
  }; 
  vector<int> idx(n);
  iota(idx.begin(), idx.end(), 0);
  shuffle(idx.begin(), idx.end(), rng);
  vector<int> pa, pb;
  pa.push_back(idx[0]);
  pb.push_back(idx[1]);
  bool know = false;
  for (int ver = 2; ver < n; ver++) {
    int i = idx[ver];
    if (know) {
      if (Ask({i}, {pa.back()})) {
        pa.push_back(i);
        know = false;
        continue;
      } else {
        pb.push_back(i);
        know = true;
        continue;
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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