oj.uz

답안 #1030261

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030261 2024-07-22T01:43:19 Z Agreb 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 24 ms 856 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

vector <int> longest_trip(int N, int D){
    vector <int> path, clique, used(N);
    for (int i = 0; i <= 2; i++){
        for (int j = 0; j < i; j++){
            if (are_connected({i}, {j})){
                path = {i, j};
                used[i] = used[j] = 1;
                break;
            }
        }
        if (!path.empty()) break;
    }

    vector <int> non_edge;
    for (int v = 0; v < N; v++){
        if (used[v]) continue;
        int P = path.size();
        int C = clique.size();
        int st = path[0], fin = path[P-1];

        // cout << v << endl;
        // for (int x : path) cout << x << " ";
        // cout << endl;
        // for (int y : clique) cout << y << endl;
        // cout << endl;

        if (!clique.empty()){
            int cp = are_connected(path, {v});
            int cc = are_connected(clique, {v});
            if (cp && cc){
                non_edge = {clique[0], path[0]};

                int ip = -1;
                for (int i = 0; i < P; i++){
                    if (are_connected({path[i]}, {v})){
                        ip = i;
                        break;
                    }
                }

                int ic = -1;
                for (int i = 0; i < C; i++){
                    if (are_connected({clique[i]}, {v})){
                        ic = i;
                        break;
                    }
                }

                vector <int> npath;
                for (int j = 0; j < P; j++) npath.push_back(path[(j+ip+1)%P]);
                npath.push_back(v);
                for (int j = 0; j < C; j++) npath.push_back(clique[(j+ic)%C]);
                path = npath;
                clique.clear();
                continue;
            }
            else if (cc){
                clique.push_back(v);
                continue;
            }
            else if (cp){
                path.push_back(v);
                continue;
            }
        }

        if (!non_edge.empty()){
            if (are_connected({st}, {fin})){
                int u = (are_connected({non_edge[0]}, {v}) ? non_edge[0] : non_edge[1]); 
                int i = -1;
                for (int ii = 0; ii < P; ii++)
                    if (path[ii] == u) i = ii;
                             
                vector <int> npath;
                for (int j = 0; j < P; j++) 
                    npath.push_back(path[(j+i+1)%P]);
                npath.push_back(v);
                path = npath;
                continue;
            }
            else{
                if (are_connected({st}, {v})){
                    reverse(path.begin(), path.end());
                    path.push_back(v);
                    continue;
                }
                else{
                    path.push_back(v);
                    continue;
                }
            }
        }

        if (!are_connected(path, {v})){
            clique.push_back(v);
            continue;
        }

        if (are_connected({st}, {v})){
            reverse(path.begin(), path.end());
            path.push_back(v);
            continue;
        }
        else if (non_edge.empty()) non_edge = {st, v};        

        for (int i = 1; i < P; i++){
            if (are_connected({path[i]}, {v})){   
                vector <int> npath;
                for (int j = 0; j < P; j++) 
                    npath.push_back(path[(j+i+1)%P]);
                npath.push_back(v);
                path = npath;
                break;
            }
        }        
    }
    assert(path.size() + clique.size() == N);
    if (path.size() >= clique.size()) return path;
    else return clique;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from longesttrip.cpp:1:
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:121:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  121 |     assert(path.size() + clique.size() == N);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 13 ms 344 KB Output is correct
5 Correct 14 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 11 ms 440 KB Output is correct
5 Correct 21 ms 856 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 19 ms 344 KB Output is correct
11 Correct 17 ms 344 KB Output is correct
12 Correct 19 ms 444 KB Output is correct
13 Correct 12 ms 472 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 16 ms 344 KB Output is correct
4 Correct 12 ms 344 KB Output is correct
5 Correct 14 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Correct 18 ms 344 KB Output is correct
11 Correct 17 ms 600 KB Output is correct
12 Correct 13 ms 344 KB Output is correct
13 Correct 12 ms 480 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Incorrect 8 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 18 ms 344 KB Output is correct
5 Partially correct 24 ms 600 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Partially correct 14 ms 344 KB Output is partially correct
11 Partially correct 13 ms 344 KB Output is partially correct
12 Partially correct 15 ms 468 KB Output is partially correct
13 Partially correct 12 ms 344 KB Output is partially correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Incorrect 9 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -