Submission #897333

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
897333	2024-01-02 23:33:31	ksujay2	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	17 ms	604 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 <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
int bsmin(vector<int> A, vector<int> B) {
    int l = 0, r = A.size();
    while(l < r) {
        int m = l + (r - l) / 2;
        vector<int> C;
        for(int i = l; i <= m; i++) C.push_back(A[i]);
        if(are_connected(C, B)) {
            r = m;
        } else {
            l = m + 1;
        }
    }
    return l;
}
vector<int> longest_trip(int N, int D) {
    vector<int> o(N);
    for(int i = 0; i < N; i++) o[i] = i;
    int rng = N - 1;
    while(rng % 2 == 0) rng /= 2;
    for(int i = 0; i < N; i++) swap(o[i], o[(i * i * rng) % N]);
    vector<int> A, B;
    A.push_back(o[0]);
    bool not_con = false;
    for(int i = 1; i < N; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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