oj.uz

답안 #1030343

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

int binary_search(vector <int> & path, int v){
    if (are_connected({path[0]}, {v})) return 0;
    int l = 0, r = (int)path.size()-1;
    while (r-l > 1){
        int m = (l + r) / 2;
        vector <int> cur(m+1);
        for (int i = 0; i <= m; i++) cur[i] = path[i];
        if (are_connected(cur, {v})) r = m;
        else l = m;
    }
    return r;
}

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;
    }
    
    mt19937 rnd(239);
    vector <int> perm(N);
    for (int i = 0; i < N; i++) perm[i] = i;
    shuffle(perm.begin(), perm.end(), rnd);
    
    vector <int> non_edge;
    for (int vv = 0; vv < N; vv++){
        int v = perm[vv];
        if (used[v]) continue;

        if (rnd() % 2) reverse(path.begin(), path.end());
        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, cc;
            if (rnd() % 2){
                cp = are_connected(path, {v});
                cc = (cp == 0 ? 1 : are_connected(clique, {v}));
            }
            else{
                cc = are_connected(clique, {v});
                cp = (cc == 0 ? 1 : are_connected(path, {v}));
            }
            if (cp && cc){
                non_edge = {clique[0], path[0]};

                int ip = binary_search(path, v);
                int ic = binary_search(clique, v);

                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}, {v})){
                reverse(path.begin(), path.end());
                path.push_back(v);
                continue;
            }
            else if (are_connected({fin}, {v})){
                path.push_back(v);
                continue;
            }
            else{
                if (rnd() % 2) swap(non_edge[0], non_edge[1]);
                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;
            }
        }

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

        if (are_connected({fin}, {v})){
            path.push_back(v);
            if (non_edge.empty()) non_edge = {st, v};  
            continue;
        }

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

        if (non_edge.empty()) non_edge = {st, v};   
             

        int i = binary_search(path, 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;
    }
    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:139:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  139 |     assert(path.size() + clique.size() == N);
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 5 ms 416 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 436 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 14 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 9 ms 344 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 13 ms 344 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 7 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 10 ms 344 KB Output is correct
38 Correct 16 ms 456 KB Output is correct
39 Correct 12 ms 344 KB Output is correct
40 Correct 12 ms 700 KB Output is correct
41 Correct 18 ms 344 KB Output is correct
42 Correct 18 ms 344 KB Output is correct
43 Correct 12 ms 344 KB Output is correct
44 Correct 13 ms 344 KB Output is correct
45 Correct 8 ms 344 KB Output is correct
46 Correct 13 ms 344 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 7 ms 344 KB Output is correct
51 Correct 7 ms 344 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 8 ms 344 KB Output is correct
54 Correct 7 ms 444 KB Output is correct
55 Correct 9 ms 344 KB Output is correct
56 Correct 7 ms 600 KB Output is correct
57 Correct 7 ms 344 KB Output is correct
58 Correct 12 ms 600 KB Output is correct
59 Correct 11 ms 600 KB Output is correct
60 Correct 11 ms 344 KB Output is correct
61 Correct 12 ms 600 KB Output is correct
62 Correct 10 ms 344 KB Output is correct
63 Correct 11 ms 600 KB Output is correct
64 Correct 10 ms 600 KB Output is correct

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 436 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 14 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 9 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 13 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 600 KB Output is correct
27 Correct 13 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 13 ms 344 KB Output is correct
32 Correct 11 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 7 ms 344 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 10 ms 600 KB Output is correct
40 Correct 10 ms 344 KB Output is correct
41 Correct 8 ms 444 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 13 ms 600 KB Output is correct
48 Correct 11 ms 456 KB Output is correct
49 Correct 18 ms 600 KB Output is correct
50 Correct 13 ms 448 KB Output is correct
51 Correct 16 ms 344 KB Output is correct
52 Correct 14 ms 344 KB Output is correct
53 Correct 16 ms 444 KB Output is correct
54 Correct 19 ms 444 KB Output is correct
55 Correct 12 ms 344 KB Output is correct
56 Correct 11 ms 472 KB Output is correct
57 Correct 15 ms 712 KB Output is correct
58 Correct 15 ms 440 KB Output is correct
59 Partially correct 16 ms 696 KB Output is partially correct
60 Correct 13 ms 600 KB Output is correct
61 Correct 13 ms 344 KB Output is correct
62 Correct 10 ms 464 KB Output is correct
63 Correct 13 ms 600 KB Output is correct
64 Correct 11 ms 344 KB Output is correct
65 Correct 13 ms 700 KB Output is correct
66 Correct 11 ms 600 KB Output is correct
67 Correct 13 ms 344 KB Output is correct
68 Correct 10 ms 448 KB Output is correct
69 Correct 13 ms 344 KB Output is correct
70 Correct 16 ms 600 KB Output is correct
71 Correct 8 ms 344 KB Output is correct
72 Correct 9 ms 344 KB Output is correct
73 Partially correct 16 ms 604 KB Output is partially correct
74 Correct 10 ms 344 KB Output is correct
75 Partially correct 11 ms 344 KB Output is partially correct
76 Correct 12 ms 460 KB Output is correct
77 Correct 9 ms 344 KB Output is correct
78 Correct 10 ms 344 KB Output is correct
79 Correct 12 ms 600 KB Output is correct
80 Partially correct 10 ms 452 KB Output is partially correct
81 Partially correct 16 ms 344 KB Output is partially correct
82 Correct 9 ms 344 KB Output is correct