oj.uz

답안 #1076342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076342 2024-08-26T13:09:14 Z c2zi6 가장 긴 여행 (IOI23_longesttrip) C++17
0 / 100
 1 ms 344 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "longesttrip.h"

bool commonedge(VI a, VI b) {
    return !are_connected(a, b);
}
bool commonedge(int u, int v) {
    return !are_connected({u}, {v});
}

int n;
VVI gp;
VVI gpmatrix;

VI vis;
VI path;
void dfs(int u) {
    vis[u] = true;
    path.pb(u);
    for (int v : gp[u]) if (!vis[v]) {
        dfs(v);
        break;
    }
}

VI longest_trip(int N, int D) {
    /*if (D >= 2) {*/
    /*    int n = N;*/
    /*    VI group(n, -1);*/
    /*    int last = 0;*/
    /*    rep(u, n) if (group[u] == -1) {*/
    /*        group[u] = last;*/
    /*        rep(v, n) if (group[v] == -1) {*/
    /*            if (commonedge({u}, {v})) group[v] = last;*/
    /*        }*/
    /*        last++;*/
    /*    }*/
    /*    VVI comp(last);*/
    /*    rep(u, n) comp[group[u]].pb(u);*/
    /*    sort(all(comp), [&](const VI& a, const VI& b){return a.size() > b.size();});*/
    /*    int prev = -1;*/
    /*    VI ans;*/
    /*    rep(_, 3) {*/
    /*        rep(i, last) {*/
    /*            assert(comp[i].size() <= 2);*/
    /*            if (comp[i].size() && i != prev) {*/
    /*                ans.pb(comp[i].back());*/
    /*                comp[i].pop_back();*/
    /*                prev = i;*/
    /*            }*/
    /*        }*/
    /*    }*/
    /*    rep(i, last) assert(comp[i].size() == 0);*/
    /*    return ans;*/
    /*}*/
    n = N;
    gp = VVI(n);
    gpmatrix = VVI(n, VI(n, true));
    replr(u, 0, n-1) {
        replr(v, u+1, n-1) {
            if (commonedge(u, v)) {
                /*gp[u].pb(v);*/
                /*gp[v].pb(u);*/
                gpmatrix[u][v] = gpmatrix[v][u] = false;
                /*cout << "found edge " << u << " " << v << endl;*/
            }
        }
    }
    rep(u, n) rep(v, n) if (gpmatrix[u][v]) {
        gp[u].pb(v);
    }
    mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
    vis = VI(n);
    dfs(rng()%n);
    return path;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -