oj.uz

답안 #840596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840596 2023-08-31T14:16:00 Z danikoynov 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 1000 ms 848 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 260;
vector < int > adj[maxn];
int used[maxn], edge[maxn][maxn];

int n;
void dfs(int v, int c)
{
    used[v] = c;
    for (int u : adj[v])
    {
        if (!used[u])
            dfs(u, c);

    }
}

int deg[maxn];
vector<int> longest_trip(int N, int D)
{
    n = N;
    if (n == 0)
        return {};
    if (D == 3)
    {
        vector < int > r;
        for (int i = 0; i < N; i ++)
            r.push_back(i);
        return r;
    }

    for (int i = 0; i < N; i ++)
        adj[i].clear();

    for (int i = 0; i < N; i ++)
        used[i] = 0, deg[i] = 0;
    for (int i = 0; i < N; i ++)
        for (int j = i + 1; j < N; j ++)
        {
            vector < int > a, b;
            a.push_back(i);
            b.push_back(j);
            if (are_connected(a, b))
            {
                adj[i].push_back(j);
                adj[j].push_back(i);
                edge[i][j] = 1;
                edge[j][i] = 1;
                deg[i] ++;
                deg[j] ++;
            }
        }


    int cp = 0;
    for (int i = 0; i < N; i ++)
    {
        if (!used[i])
            dfs(i, ++ cp);
    }

    if (cp == 2)
    {

        vector < int > a, b;
        for (int i = 0; i < N; i ++)
            if (used[i] == 1)
                a.push_back(i);
            else
                b.push_back(i);
        if (a.size() > b.size())
            return a;
        return b;
    }


    vector < int > res;
    int tk = 0;
    while(tk < N && deg[tk] != 1)
        tk ++;
    if (tk == N)
        tk = 0;


    for (int step = 0; step < N; step ++)
    {

        res.push_back(tk);
        int nxt = -1;
        for (int u = 0; u < N; u ++)
        {
            if (edge[tk][u])
            {
                deg[u] --;
                if (deg[u] == 1 || nxt == -1)
                    nxt = u;
                deg[tk] --;
                edge[tk][u] = edge[u][tk] = 0;
            }
        }
        tk = nxt;


    }
    return res;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 253 ms 780 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 208 KB Output is correct
2 Correct 32 ms 208 KB Output is correct
3 Correct 209 ms 336 KB Output is correct
4 Correct 425 ms 592 KB Output is correct
5 Correct 864 ms 832 KB Output is correct
6 Correct 13 ms 220 KB Output is correct
7 Correct 28 ms 208 KB Output is correct
8 Correct 112 ms 336 KB Output is correct
9 Correct 432 ms 452 KB Output is correct
10 Correct 805 ms 848 KB Output is correct
11 Correct 996 ms 848 KB Output is correct
12 Correct 895 ms 768 KB Output is correct
13 Correct 762 ms 848 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 208 KB Output is correct
2 Correct 40 ms 208 KB Output is correct
3 Correct 207 ms 460 KB Output is correct
4 Correct 591 ms 568 KB Output is correct
5 Correct 968 ms 776 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 30 ms 208 KB Output is correct
8 Correct 159 ms 432 KB Output is correct
9 Correct 357 ms 444 KB Output is correct
10 Correct 953 ms 844 KB Output is correct
11 Execution timed out 1004 ms 832 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 208 KB Output is correct
2 Correct 38 ms 208 KB Output is correct
3 Partially correct 191 ms 336 KB Output is partially correct
4 Partially correct 507 ms 476 KB Output is partially correct
5 Partially correct 903 ms 760 KB Output is partially correct
6 Correct 12 ms 208 KB Output is correct
7 Correct 32 ms 208 KB Output is correct
8 Partially correct 186 ms 376 KB Output is partially correct
9 Partially correct 424 ms 456 KB Output is partially correct
10 Partially correct 737 ms 744 KB Output is partially correct
11 Partially correct 903 ms 836 KB Output is partially correct
12 Execution timed out 1016 ms 772 KB Time limit exceeded
13 Halted 0 ms 0 KB -