Submission #1238725

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238725		matsakyannn	Longest Trip (IOI23_longesttrip)	C++20	25 / 100	4 ms	416 KiB

longesttrip

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

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x << ' '; print(x); cerr << endl;
#else
#define dbg(x)
#endif 

void print(int x) {cerr << x;}
void print(long long x) {cerr << x;}
void print(char x) {cerr << x;}
void print(string x) {cerr << x;}
void print(double x) {cerr << x;}
template <class T> void print(vector <T> x);
template <class T> void print(set <T> x);
template <class T> void print(multiset <T> x);
template <class T, class V> void print(pair <T, V> x);
template <class T, class V> void print(map <T, V> x);
template <class T> void print(vector <T> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";}
template <class T> void print(set <T> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";}
template <class T> void print(multiset <T> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";}
template <class T, class V> void print(pair <T, V> x) {cerr << "{"; print(x.first); cerr << ' '; print(x.second); cerr << "}";}
template <class T, class V> void print(map <T, V> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";}

#define ll long long
#define pb push_back
#define ppb pop_back
#define PII pair <int, int>
#define PLL pair <ll, ll>
#define all(v) (v).begin(), (v).end()
#define OK cerr << "OK\n";
#define MP make_pair

vector <int> longest_trip(int N, int D){
    vector <int> a, b;
    a.pb(0);
    b.pb(1);
    for(int i = 2; i < N; i++){
        if(are_connected({a.back()}, {i})){
            a.pb(i);
            continue;
        }
        if(are_connected({b.back()}, {i})){
            b.pb(i);
            continue;
        }
        reverse(all(b));
        for(int j : b){
            a.pb(j);
        }
        b.clear();
        b.pb(i);
    }

    if(a.size() > b.size()) return a;
    return b;
}

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