oj.uz

답안 #849331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849331 2023-09-14T13:40:39 Z boris_mihov 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 10 ms 1112 KB 
#include "longesttrip.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <random>
#include <vector>

typedef long long llong;
const int MAXN = 256 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;

int n;
std::mt19937 rng(420);
std::vector <int> longest_trip(int N, int D)
{
    n = N;
    std::vector <int> a, b;
    a.push_back(0);
    for (int i = 1 ; i < n ; ++i)
    {
        bool resA = are_connected({a.back()}, {i});
        if (resA)
        {
            a.push_back(i);
        } else
        {
            if (b.empty())
            {
                b.push_back(i);
            } else
            {
                bool resB = are_connected({b.back()}, {i});
                if (resB)
                {
                    b.push_back(i);
                } else
                {
                    while (!b.empty())
                    {
                        a.push_back(b.back());
                        b.pop_back();
                    }

                    b.push_back(i);
                }
            }
        }
    }

    if (a.size() < b.size())
    {
        std::swap(a, b);
    }

    if (b.empty())
    {
        return a;
    }

    if (!are_connected(a, b))
    {
        return a;
    }

    if (are_connected({a[0]}, {b[0]}))
    {
        std::reverse(a.begin(), a.end());
        for (int i = 0 ; i < b.size() ; ++i)
        {
            a.push_back(b[i]);
        }

        return a;
    }

    if (b.size() > 1 && are_connected({a[0]}, {b.back()}))
    {
        std::reverse(b.begin(), b.end());
        std::reverse(a.begin(), a.end());
        for (int i = 0 ; i < b.size() ; ++i)
        {
            a.push_back(b[i]);
        }

        return a;
    }

    if (are_connected({b[0]}, {a.back()}))
    {
        for (int i = 0 ; i < b.size() ; ++i)
        {
            a.push_back(b[i]);
        }

        return a;
    }
    
    int aPos, bPos;
    int l = -1, r = a.size() - 1, mid;
    while (l < r - 1)
    {
        mid = (l + r) / 2;
        std::vector <int> prefix(a.begin(), a.begin() + mid + 1);
        if (!are_connected(prefix, b)) l = mid;
        else r = mid; 
    }

    aPos = r;
    std::vector <int> prefixA(a.begin(), a.begin() + aPos + 1);
    l = -1; r = b.size() - 1;
    while (l < r - 1)
    {
        mid = (l + r) / 2;
        std::vector <int> prefixB(b.begin(), b.begin() + mid + 1);
        if (!are_connected(prefixA, prefixB)) l = mid;
        else r = mid;
    }

    bPos = r;
    for (int i = 0 ; i < aPos ; ++i)
    {
        a.push_back(a[0]);
        a.erase(a.begin());
    }

    for (int i = 0 ; i < bPos ; ++i)
    {
        b.push_back(b[0]);
        b.erase(b.begin());
    }

    std::reverse(a.begin(), a.end());
    for (int i = 0 ; i < b.size() ; ++i)
    {
        a.push_back(b[i]);
    }

    return a;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:70:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for (int i = 0 ; i < b.size() ; ++i)
      |                          ~~^~~~~~~~~~
longesttrip.cpp:82:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |         for (int i = 0 ; i < b.size() ; ++i)
      |                          ~~^~~~~~~~~~
longesttrip.cpp:92:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for (int i = 0 ; i < b.size() ; ++i)
      |                          ~~^~~~~~~~~~
longesttrip.cpp:135:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |     for (int i = 0 ; i < b.size() ; ++i)
      |                      ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #4
45.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 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 5 ms 600 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 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 4 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 6 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 600 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 6 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 4 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 9 ms 344 KB Output is correct
35 Correct 6 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 5 ms 432 KB Output is correct
38 Correct 8 ms 440 KB Output is correct
39 Correct 8 ms 436 KB Output is correct
40 Correct 5 ms 600 KB Output is correct
41 Correct 5 ms 344 KB Output is correct
42 Correct 6 ms 440 KB Output is correct
43 Correct 5 ms 600 KB Output is correct
44 Correct 5 ms 444 KB Output is correct
45 Correct 5 ms 444 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 6 ms 600 KB Output is correct
51 Partially correct 6 ms 344 KB Output is partially correct
52 Correct 6 ms 600 KB Output is correct
53 Correct 7 ms 344 KB Output is correct
54 Correct 6 ms 600 KB Output is correct
55 Correct 6 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Partially correct 7 ms 600 KB Output is partially correct
58 Partially correct 7 ms 344 KB Output is partially correct
59 Partially correct 7 ms 600 KB Output is partially correct
60 Correct 8 ms 344 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 5 ms 708 KB Output is correct
63 Partially correct 7 ms 1112 KB Output is partially correct
64 Partially correct 8 ms 704 KB Output is partially correct
65 Partially correct 7 ms 600 KB Output is partially correct
66 Partially correct 8 ms 856 KB Output is partially correct
67 Correct 7 ms 604 KB Output is correct
68 Correct 10 ms 864 KB Output is correct
69 Partially correct 8 ms 612 KB Output is partially correct
70 Partially correct 8 ms 856 KB Output is partially correct
71 Correct 5 ms 708 KB Output is correct
72 Partially correct 8 ms 452 KB Output is partially correct
73 Partially correct 7 ms 444 KB Output is partially correct
74 Partially correct 7 ms 608 KB Output is partially correct
75 Correct 8 ms 856 KB Output is correct
76 Correct 8 ms 704 KB Output is correct
77 Correct 5 ms 456 KB Output is correct
78 Partially correct 7 ms 864 KB Output is partially correct
79 Correct 7 ms 444 KB Output is correct
80 Partially correct 7 ms 452 KB Output is partially correct
81 Correct 9 ms 448 KB Output is correct
82 Correct 8 ms 444 KB Output is correct