Submission #1238171

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238171		VahanAbraham	Longest Trip (IOI23_longesttrip)	C++20	5 / 100	334 ms	408 KiB

longesttrip

#define _CRT_SECURE_NO_WARNINGS
#include "longesttrip.h"
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <cmath>
#include <vector>
#include <iomanip>
#include <random>
#include <chrono>
#include <bitset>
#include <cassert>
using namespace std;

#define ll long long
#define fr first
#define sc second
#define pb push_back
#define US freopen(".in", "r", stdin); freopen(".out", "w", stdout);

ll gcd(ll a, ll b)
{
    if (a == 0 || b == 0) {
        return  max(a, b);
    }
    if (a <= b) {
        return gcd(a, b % a);
    }
    else {
        return gcd(a % b, b);
    }
}
ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

const int N = 500005;
const ll oo = 1000000000000000000, MOD = 1000000007;


std::vector<int> longest_trip(int N, int D)
{
    int n = N, d = D;
    vector<int> vec;
    if (d == 3) {
        for (int i = 0; i < n; ++i) {
            vec.pb(i);
        }
        return vec;
    }
    if (d == 2) {
        int sk1 = 0, sk2 = -1;
        for (int i = 0; i < n; ++i) {
            for (int j = i + 1; j < n; ++j) {
                if (are_connected({ i }, { j })==0){
                    sk1 = i;
                    sk2 = j;
                    break;
                }
            }
        }
        vec.pb(sk1);
        for (int i = 0; i < n; ++i) {
            if (i != sk1 && i != sk2){
                vec.pb(i);
            }
        }
        if (sk2 != -1) {
            vec.pb(sk2);
        }
        return vec;
    }
    return {};
}

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