oj.uz

Submission #927893

# Submission time Handle Problem Language Result Execution time Memory
927893 2024-02-15T13:47:53 Z aykhn Longest Trip (IOI23_longesttrip) C++17
60 / 100
 787 ms 1368 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
 
using namespace std;
 
int A[300][300];
 
int ask(vector<int> a, vector<int> b)
{
    for (int x : a)
    {
        for (int y : b)
        {
            if (A[x][y]) return 1;
        }
    }
    return 0;
}
 
vector<int> longest_trip(int n, int D)
{
    for (int i = 0; i < n; i++)
    {
        A[i][i] = 1;
        for (int j = i + 1; j < n; j++)
        {
            A[i][j] = A[j][i] = are_connected({i}, {j});
        }
    }
    vector<int> used(n, 0);
    vector<int> v1, v2;
    for (int i = 0; i < 3; i++)
    {
        for (int j = i + 1; j < 3; j++)
        {
            if (ask({i}, {j}))
            {
                v1.push_back(i), v1.push_back(j);
                used[i] = used[j] = 1;
                break;
            }
        }
        if (!v1.empty()) break;
    }
    for (int i = 0; i < n; i++)
    {
        if (used[i]) continue;
        used[i] = 1;
        if (ask(v1, {i}) && ask(v2, {i})) 
        {
            sort(v1.begin(), v1.end());
            sort(v2.begin(), v2.end());
            int id1 = -1, id2 = -1;
            for (int j = 0; j < v1.size(); j++)
            {
                if (ask({v1[j]}, {i}))
                {
                    id1 = j;
                    break;
                }
            }
            for (int j = 0; j < v2.size(); j++)
            {
                if (ask({v2[j]}, {i}))
                {
                    id2 = j;
                    break;
                }
            }
            assert(id1 != -1 && id2 != -1);
            vector<int> nw;
            for (int j = (id2 + 1) % v2.size(); 1; j = (j + 1) % v2.size())
            {
                nw.push_back(v2[j]);
                if (j == id2) break;
            }
            nw.push_back(i), nw.push_back(v1[id1]);
            for (int j = (id1 + 1) % v1.size(); j != id1; j = (j + 1) % v1.size())
            {
                nw.push_back(v1[j]);
            }
            v2.clear();
            v1 = nw;
        }
        else if (ask(v1, {i})) 
        {
            vector<int> nw;
            int idx = -1;
            if (ask({v1[0]}, {i})) 
            {
                nw.push_back(i);
                for (int x : v1) nw.push_back(x);
            }
            else if (ask({v1.back()}, {i}))
            {
                nw = v1;
                nw.push_back(i);
            }
            else
            {
                for (int j = 0; j < v1.size(); j++) 
                {
                    if (ask({i}, {v1[j]})) 
                    {
                        idx = j;
                        break;
                    }
                }
                nw.push_back(i), nw.push_back(v1[idx]);
                for (int j = (idx + 1) % v1.size(); j != idx; j = (j + 1) % v1.size())
                {
                    nw.push_back(v1[j]);
                }
            }
            v1 = nw;
        }
        else if (ask(v2, {i}))
        {
            vector<int> nw;
            int idx = -1;
            if (ask({v2[0]}, {i})) 
            {
                nw.push_back(i);
                for (int x : v2) nw.push_back(x);
            }
            else if (ask({v2.back()}, {i}))
            {
                nw = v2;
                nw.push_back(i);
            }
            else
            {
                for (int j = 0; j < v2.size(); j++) 
                {
                    if (ask({i}, {v2[j]})) 
                    {
                        idx = j;
                        break;
                    }
                }
                nw.push_back(i), nw.push_back(v2[idx]);
                for (int j = (idx + 1) % v2.size(); j != idx; j = (j + 1) % v2.size())
                {
                    nw.push_back(v2[j]);
                }
            }
            v2 = nw;
        }
        else v2.push_back(i);
    }
    vector<int> res;
    if (max(v1.size(), v2.size()) == v1.size()) res = v1;
    else if (max(v1.size(), v2.size()) == v2.size()) res = v2;
    int prev = res[0], f = 1;
    for (int i = 1; i < res.size(); i++)
    {
        f &= A[prev][res[i]];
        prev = res[i];
    }
    return res;
};

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:54:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |             for (int j = 0; j < v1.size(); j++)
      |                             ~~^~~~~~~~~~~
longesttrip.cpp:62:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for (int j = 0; j < v2.size(); j++)
      |                             ~~^~~~~~~~~~~
longesttrip.cpp:101:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |                 for (int j = 0; j < v1.size(); j++)
      |                                 ~~^~~~~~~~~~~
longesttrip.cpp:133:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |                 for (int j = 0; j < v2.size(); j++)
      |                                 ~~^~~~~~~~~~~
longesttrip.cpp:155:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |     for (int i = 1; i < res.size(); i++)
      |                     ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 201 ms 852 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 21 ms 600 KB Output is correct
3 Correct 115 ms 600 KB Output is correct
4 Correct 335 ms 600 KB Output is correct
5 Correct 719 ms 724 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Correct 122 ms 600 KB Output is correct
4 Correct 334 ms 564 KB Output is correct
5 Correct 778 ms 856 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 115 ms 600 KB Output is correct
9 Correct 266 ms 548 KB Output is correct
10 Correct 668 ms 856 KB Output is correct
11 Correct 694 ms 856 KB Output is correct
12 Correct 778 ms 716 KB Output is correct
13 Correct 769 ms 1368 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 17 ms 344 KB Output is correct
3 Correct 111 ms 344 KB Output is correct
4 Correct 320 ms 592 KB Output is correct
5 Correct 704 ms 720 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 22 ms 596 KB Output is correct
8 Correct 117 ms 856 KB Output is correct
9 Correct 253 ms 544 KB Output is correct
10 Correct 730 ms 856 KB Output is correct
11 Correct 677 ms 856 KB Output is correct
12 Correct 731 ms 716 KB Output is correct
13 Correct 689 ms 724 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Correct 42 ms 712 KB Output is correct
17 Correct 75 ms 600 KB Output is correct
18 Correct 138 ms 736 KB Output is correct
19 Correct 247 ms 596 KB Output is correct
20 Correct 255 ms 556 KB Output is correct
21 Correct 687 ms 792 KB Output is correct
22 Correct 644 ms 792 KB Output is correct
23 Correct 700 ms 716 KB Output is correct
24 Correct 686 ms 732 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 25 ms 344 KB Output is correct
28 Correct 28 ms 344 KB Output is correct
29 Correct 18 ms 344 KB Output is correct
30 Correct 179 ms 444 KB Output is correct
31 Correct 147 ms 704 KB Output is correct
32 Correct 160 ms 700 KB Output is correct
33 Correct 229 ms 552 KB Output is correct
34 Correct 227 ms 540 KB Output is correct
35 Correct 246 ms 536 KB Output is correct
36 Correct 644 ms 720 KB Output is correct
37 Correct 703 ms 720 KB Output is correct
38 Correct 693 ms 724 KB Output is correct
39 Correct 715 ms 720 KB Output is correct
40 Correct 765 ms 720 KB Output is correct
41 Correct 696 ms 748 KB Output is correct
42 Correct 730 ms 756 KB Output is correct
43 Correct 678 ms 748 KB Output is correct
44 Correct 752 ms 752 KB Output is correct
45 Correct 10 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 22 ms 344 KB Output is correct
48 Correct 19 ms 344 KB Output is correct
49 Correct 21 ms 344 KB Output is correct
50 Correct 162 ms 696 KB Output is correct
51 Correct 144 ms 956 KB Output is correct
52 Correct 153 ms 700 KB Output is correct
53 Correct 240 ms 552 KB Output is correct
54 Correct 232 ms 540 KB Output is correct
55 Correct 239 ms 592 KB Output is correct
56 Correct 665 ms 856 KB Output is correct
57 Correct 766 ms 720 KB Output is correct
58 Correct 723 ms 788 KB Output is correct
59 Correct 687 ms 1024 KB Output is correct
60 Correct 659 ms 1112 KB Output is correct
61 Correct 667 ms 792 KB Output is correct
62 Correct 703 ms 856 KB Output is correct
63 Correct 684 ms 752 KB Output is correct
64 Correct 686 ms 748 KB Output is correct

Subtask #4
19.999999998 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Partially correct 119 ms 600 KB Output is partially correct
4 Partially correct 313 ms 568 KB Output is partially correct
5 Partially correct 654 ms 716 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 28 ms 344 KB Output is correct
8 Partially correct 106 ms 600 KB Output is partially correct
9 Partially correct 256 ms 600 KB Output is partially correct
10 Partially correct 681 ms 856 KB Output is partially correct
11 Partially correct 658 ms 716 KB Output is partially correct
12 Partially correct 732 ms 712 KB Output is partially correct
13 Partially correct 656 ms 856 KB Output is partially correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 35 ms 344 KB Output is correct
17 Partially correct 69 ms 600 KB Output is partially correct
18 Partially correct 107 ms 592 KB Output is partially correct
19 Partially correct 238 ms 600 KB Output is partially correct
20 Partially correct 287 ms 812 KB Output is partially correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 19 ms 344 KB Output is correct
24 Correct 19 ms 344 KB Output is correct
25 Correct 21 ms 344 KB Output is correct
26 Partially correct 165 ms 716 KB Output is partially correct
27 Partially correct 153 ms 696 KB Output is partially correct
28 Partially correct 151 ms 700 KB Output is partially correct
29 Partially correct 272 ms 592 KB Output is partially correct
30 Partially correct 279 ms 532 KB Output is partially correct
31 Partially correct 251 ms 560 KB Output is partially correct
32 Correct 12 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 22 ms 344 KB Output is correct
35 Correct 18 ms 344 KB Output is correct
36 Correct 32 ms 344 KB Output is correct
37 Partially correct 143 ms 700 KB Output is partially correct
38 Partially correct 161 ms 948 KB Output is partially correct
39 Partially correct 163 ms 444 KB Output is partially correct
40 Partially correct 262 ms 792 KB Output is partially correct
41 Partially correct 232 ms 532 KB Output is partially correct
42 Partially correct 272 ms 592 KB Output is partially correct
43 Partially correct 735 ms 788 KB Output is partially correct
44 Partially correct 769 ms 788 KB Output is partially correct
45 Partially correct 754 ms 936 KB Output is partially correct
46 Partially correct 707 ms 856 KB Output is partially correct
47 Partially correct 688 ms 1112 KB Output is partially correct
48 Partially correct 763 ms 720 KB Output is partially correct
49 Partially correct 721 ms 720 KB Output is partially correct
50 Partially correct 739 ms 720 KB Output is partially correct
51 Partially correct 696 ms 848 KB Output is partially correct
52 Partially correct 779 ms 756 KB Output is partially correct
53 Partially correct 697 ms 752 KB Output is partially correct
54 Partially correct 682 ms 748 KB Output is partially correct
55 Partially correct 639 ms 848 KB Output is partially correct
56 Partially correct 658 ms 720 KB Output is partially correct
57 Partially correct 715 ms 720 KB Output is partially correct
58 Partially correct 681 ms 720 KB Output is partially correct
59 Partially correct 632 ms 1104 KB Output is partially correct
60 Partially correct 684 ms 856 KB Output is partially correct
61 Partially correct 663 ms 748 KB Output is partially correct
62 Partially correct 640 ms 920 KB Output is partially correct
63 Partially correct 643 ms 884 KB Output is partially correct
64 Partially correct 659 ms 856 KB Output is partially correct
65 Partially correct 661 ms 772 KB Output is partially correct
66 Partially correct 660 ms 768 KB Output is partially correct
67 Partially correct 663 ms 796 KB Output is partially correct
68 Partially correct 669 ms 1120 KB Output is partially correct
69 Partially correct 696 ms 756 KB Output is partially correct
70 Partially correct 722 ms 752 KB Output is partially correct
71 Partially correct 730 ms 856 KB Output is partially correct
72 Partially correct 675 ms 856 KB Output is partially correct
73 Partially correct 699 ms 716 KB Output is partially correct
74 Partially correct 767 ms 856 KB Output is partially correct
75 Partially correct 677 ms 780 KB Output is partially correct
76 Partially correct 667 ms 800 KB Output is partially correct
77 Partially correct 672 ms 720 KB Output is partially correct
78 Partially correct 744 ms 856 KB Output is partially correct
79 Partially correct 787 ms 792 KB Output is partially correct
80 Partially correct 724 ms 716 KB Output is partially correct
81 Partially correct 709 ms 796 KB Output is partially correct
82 Partially correct 684 ms 1112 KB Output is partially correct