oj.uz

답안 #1076206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076206 2024-08-26T11:46:07 Z c2zi6 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 912 ms 664 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 samecomp(VI a, VI b) {
    return !are_connected(a, b);
}

VI longest_trip(int N, int D) {
    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 (samecomp({u}, {v})) group[v] = last;
        }
        last++;
    }
    VVI comp(last);
    rep(u, n) comp[group[u]].pb(u);
    /*cout << "components" << endl;*/
    /*rep(i, last) {*/
    /*    for (int x : comp[i]) cout << x << " ";*/
    /*    cout << endl;*/
    /*}*/
    /*cout << "components" << endl;*/
    sort(all(comp), [&](const VI& a, const VI& b){return b.size() > a.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;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Correct 145 ms 344 KB Output is correct
4 Correct 444 ms 664 KB Output is correct
5 Correct 912 ms 412 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 162 ms 436 KB Output is correct
4 Correct 411 ms 412 KB Output is correct
5 Correct 881 ms 412 KB Output is correct
6 Runtime error 1 ms 600 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 18 ms 344 KB Output is correct
3 Correct 164 ms 432 KB Output is correct
4 Correct 441 ms 592 KB Output is correct
5 Correct 855 ms 412 KB Output is correct
6 Runtime error 1 ms 600 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 17 ms 344 KB Output is correct
3 Partially correct 155 ms 344 KB Output is partially correct
4 Partially correct 410 ms 416 KB Output is partially correct
5 Partially correct 868 ms 412 KB Output is partially correct
6 Runtime error 1 ms 600 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -