oj.uz

답안 #1052345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052345 2024-08-10T13:37:55 Z Zicrus 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 733 ms 1580 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
 
typedef long long ll;
 
vector<vector<ll>> adj, noAdj;
vector<bool> vst;
vector<vector<ll>> k;

void dfs(ll cur, ll comp) {
    vst[cur] = true;
    k[comp].push_back(cur);
    for (auto &e : noAdj[cur]) {
        if (vst[e]) continue;
        dfs(e, !comp);
    }
}
 
vector<int> longest_trip(int n, int d) {
    adj = vector<vector<ll>>(n);
    noAdj = vector<vector<ll>>(n);
    k = vector<vector<ll>>(2);
    vector<vector<bool>> mat(n, vector<bool>(n));
    for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if (are_connected({i}, {j})) {
                adj[i].push_back(j);
                adj[j].push_back(i);
                mat[i][j] = true;
                mat[j][i] = true;
            }
            else {
                noAdj[i].push_back(j);
                noAdj[j].push_back(i);
            }
        }
    }

    mt19937 mt(63274);
    vector<int> G(n);
    for (int i = 0; i < n; i++) G[i] = i;
    shuffle(G.begin(), G.end(), mt);

    vst = vector<bool>(n);
    ll comp = 0;
    for (int i1 = 0; i1 < n; i1++) {
        int i = G[i1];
        if (vst[i]) continue;
        dfs(i, comp);
        comp = !comp;
    }
    if (k[0].size() < k[1].size()) swap(k[0], k[1]);

    ll mxDeg = 0, bridge = 0;
    for (int i = 0; i < k[0].size(); i++) {
        if (adj[k[0][i]].size() > mxDeg) {
            mxDeg = adj[k[0][i]].size();
            bridge = i;
        }
    }

    vst = vector<bool>(n);
    vector<int> res;
    for (int i = bridge+1; i < k[0].size(); i++) {
        vst[k[0][i]] = true;
        res.push_back(k[0][i]);
    }
    for (int i = 0; i <= bridge; i++) {
        vst[k[0][i]] = true;
        res.push_back(k[0][i]);
    }
    ll used = -1;
    for (auto &e : adj[k[0][bridge]]) {
        if (vst[e]) continue;
        used = e;
        break;
    }
    if (used == -1) return res;
    for (int i = 0; i < k[1].size(); i++) {
        if (k[1][i] == used) {
            used = i;
            break;
        }
    }
    for (int i = used; i < k[1].size(); i++) {
        res.push_back(k[1][i]);
    }
    for (int i = 0; i < used; i++) {
        res.push_back(k[1][i]);
    }

    return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < k[0].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
longesttrip.cpp:57:33: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   57 |         if (adj[k[0][i]].size() > mxDeg) {
      |             ~~~~~~~~~~~~~~~~~~~~^~~~~~~
longesttrip.cpp:65:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int i = bridge+1; i < k[0].size(); i++) {
      |                            ~~^~~~~~~~~~~~~
longesttrip.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for (int i = 0; i < k[1].size(); i++) {
      |                     ~~^~~~~~~~~~~~~
longesttrip.cpp:86:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for (int i = used; i < k[1].size(); i++) {
      |                        ~~^~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 184 ms 1240 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Correct 110 ms 484 KB Output is correct
4 Correct 284 ms 996 KB Output is correct
5 Correct 627 ms 1200 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 25 ms 344 KB Output is correct
3 Correct 121 ms 484 KB Output is correct
4 Correct 288 ms 756 KB Output is correct
5 Correct 573 ms 1120 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 21 ms 600 KB Output is correct
8 Correct 123 ms 480 KB Output is correct
9 Correct 251 ms 920 KB Output is correct
10 Correct 661 ms 1172 KB Output is correct
11 Correct 692 ms 1432 KB Output is correct
12 Correct 719 ms 1228 KB Output is correct
13 Correct 712 ms 1136 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Correct 132 ms 340 KB Output is correct
4 Correct 346 ms 600 KB Output is correct
5 Correct 722 ms 1264 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 15 ms 344 KB Output is correct
8 Correct 129 ms 464 KB Output is correct
9 Correct 243 ms 600 KB Output is correct
10 Correct 689 ms 1228 KB Output is correct
11 Correct 656 ms 1244 KB Output is correct
12 Correct 730 ms 1548 KB Output is correct
13 Correct 700 ms 1104 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Incorrect 2 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Partially correct 139 ms 712 KB Output is partially correct
4 Partially correct 319 ms 344 KB Output is partially correct
5 Partially correct 677 ms 1236 KB Output is partially correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 16 ms 344 KB Output is correct
8 Partially correct 98 ms 724 KB Output is partially correct
9 Partially correct 255 ms 712 KB Output is partially correct
10 Partially correct 673 ms 1168 KB Output is partially correct
11 Partially correct 733 ms 1220 KB Output is partially correct
12 Partially correct 680 ms 1580 KB Output is partially correct
13 Partially correct 670 ms 1268 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -