oj.uz

답안 #880050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880050 2023-11-28T16:17:34 Z RaresFelix 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 16 ms 800 KB 
#include "longesttrip.h"

#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;

int gaseste_leg(int u, vi comp) {
    int l = 0;
    auto ok = [&](int len) {
        vi A;
        for(int i = 0; i < len; ++i)
            A.push_back(comp[i]);
        return are_connected(A, {u});
    };
    for(int i = 10; i >= 0; --i) {
        if(l + (1 << i) <= int(comp.size()) - 1) {
            if(!ok(l + (1 << i))) l += (1 << i);
        }
    }
    return comp[l];
}

std::vector<int> longest_trip(int N, int D) {
    if(D >= 2) {
        deque<int> Re;
        Re.push_back(0);
        vi Took(N, 0);
        Took[0] = 1;
        if(are_connected({0}, {1})) {
            Re.push_back(1);
            Took[1] = 1;
        } else {
            Took[2] = 1;
            Re.push_back(2);
        }
        for(int i = 0; i < N; ++i) {
            if(!Took[i]) {
                if(are_connected({i}, {Re.front()})) {
                    Re.push_front(i);
                } else Re.push_back(i);
                Took[i] = 1;
            }
        }
        vi R;
        for(auto it : Re) R.push_back(it);
        return R;
    }
    int nod_curent = 0;
    vi comp, R;
    for(int i = 1; i < N; ++i) {
        if(are_connected({nod_curent}, {i})) {
            R.push_back(nod_curent);
            nod_curent = i;
            if(!comp.empty() && are_connected(comp, {i})) {
                int it = gaseste_leg(i, comp);
                R.push_back(i);
                vi E;
                E.push_back(it);
                for(auto it2 : comp) if(it2 != it) E.push_back(it2);
                nod_curent = E.back();
                E.pop_back();
                for(auto it : E) R.push_back(it);
                comp.clear();
            }
        } else {
            comp.push_back(i);
        }
    }
    if(comp.empty()) {
        R.push_back(nod_curent);
        return R;
    }
    if(R.empty()) {
        ///nod singur si componenta
        return comp;
    }
    //am ramas cu (R, nod_curent) si o componenta conexa
    if(are_connected({R[0]}, comp)) {
        int it = gaseste_leg(R[0], comp);
        vi Re;
        for(auto it2:comp)
            if(it2 != it) Re.push_back(it2);
        Re.push_back(it);
        for(auto it : R) Re.push_back(it);
        Re.push_back(nod_curent);
        return Re;
    }
    if(are_connected({nod_curent}, comp)) {
        int it = gaseste_leg(nod_curent, comp);
        vi Re;
        for(auto it : R) Re.push_back(it);
        Re.push_back(nod_curent);
        Re.push_back(it);
        for(auto it2 : R)
            if(it2 != it) Re.push_back(it2);
        return Re;
    }
    vi Re;
    for(int i = 1; i + 1 < R.size(); ++i) {
        if(are_connected({R[i]}, comp)) {
            vi Re;
            for(int j = i + 1; j < R.size(); ++j)
                Re.push_back(R[j]);
            Re.push_back(nod_curent);
            for(int j = 0; j <= i; ++j)
                Re.push_back(R[j]);
            int it = gaseste_leg(R[i], comp);
            Re.push_back(it);
            for(auto it2 : comp)
                if(it2 != it) Re.push_back(it2);
            return Re;
        }
    }
    if(comp.size() >= 1 + R.size()) {
        return comp;
    }
    R.push_back(nod_curent);
    return R;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:101:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for(int i = 1; i + 1 < R.size(); ++i) {
      |                    ~~~~~~^~~~~~~~~~
longesttrip.cpp:104:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             for(int j = i + 1; j < R.size(); ++j)
      |                                ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 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 340 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 600 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 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 4 ms 600 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 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 7 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 10 ms 344 KB Output is correct
27 Correct 13 ms 344 KB Output is correct
28 Correct 11 ms 344 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 10 ms 344 KB Output is correct
31 Correct 11 ms 436 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 10 ms 344 KB Output is correct
35 Correct 11 ms 608 KB Output is correct
36 Correct 11 ms 344 KB Output is correct
37 Correct 13 ms 344 KB Output is correct
38 Correct 14 ms 600 KB Output is correct
39 Correct 15 ms 344 KB Output is correct
40 Correct 15 ms 604 KB Output is correct
41 Correct 15 ms 596 KB Output is correct
42 Correct 15 ms 616 KB Output is correct
43 Correct 16 ms 696 KB Output is correct
44 Correct 16 ms 688 KB Output is correct
45 Correct 7 ms 596 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 12 ms 344 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 6 ms 436 KB Output is correct
51 Correct 7 ms 432 KB Output is correct
52 Correct 9 ms 436 KB Output is correct
53 Correct 8 ms 432 KB Output is correct
54 Correct 7 ms 344 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Correct 7 ms 600 KB Output is correct
57 Correct 8 ms 800 KB Output is correct
58 Correct 9 ms 452 KB Output is correct
59 Correct 9 ms 600 KB Output is correct
60 Correct 13 ms 440 KB Output is correct
61 Correct 10 ms 440 KB Output is correct
62 Correct 10 ms 692 KB Output is correct
63 Correct 12 ms 688 KB Output is correct
64 Correct 11 ms 696 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 15 ms 344 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 12 ms 344 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 10 ms 432 KB Output is correct
28 Correct 10 ms 344 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 11 ms 344 KB Output is correct
31 Correct 12 ms 600 KB Output is correct
32 Incorrect 1 ms 344 KB Incorrect
33 Halted 0 ms 0 KB -