oj.uz

Submission #928455

# Submission time Handle Problem Language Result Execution time Memory
928455 2024-02-16T12:12:57 Z aykhn Longest Trip (IOI23_longesttrip) C++17
70 / 100
 51 ms 2348 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
 
using namespace std;

map<pair<vector<int>, vector<int>>, int> mp;
 
int ask(vector<int> a, vector<int> b)
{
    if (a.empty() || b.empty()) return 0;
    if (mp.find({a, b}) != mp.end()) return mp[{a, b}];
    return mp[{a, b}] = mp[{b, a}] = are_connected(a, b);
}
 
vector<int> longest_trip(int n, int D)
{
    mp.clear();
    vector<int> v1, v2;
    v1.push_back(0);
    for (int i = 1; i < n; i++)
    {
        if (ask(v1, {i}) && ask(v2, {i})) 
        {
            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;
                }
            }
            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;
            if (ask({v1.back()}, {i}))
            {
                nw = v1;
                nw.push_back(i);
            }
            else
            {
                int l = 0, r = (int)v1.size() - 1;
                while (l < r)
                {
                    int mid = (l + r) >> 1;
                    vector<int> x;
                    for (int j = 0; j <= mid; j++)
                    {
                        x.push_back(v1[j]);
                    }
                    if (ask(x, {i})) r = mid;
                    else l = mid + 1;
                }
                int idx = l;
                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;
            if (ask({v2.back()}, {i}))
            {
                nw = v2;
                nw.push_back(i);
            }
            else
            {
                int l = 0, r = (int)v2.size() - 1;
                while (l < r)
                {
                    int mid = (l + r) >> 1;
                    vector<int> x;
                    for (int j = 0; j <= mid; j++)
                    {
                        x.push_back(v2[j]);
                    }
                    if (ask(x, {i})) r = mid;
                    else l = mid + 1;
                }
                int idx = l;
                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);
    }
    if (v1.size() > v2.size()) return v1;
    else return v2;
};

Compilation message

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

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 9 ms 1708 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 340 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 14 ms 600 KB Output is correct
4 Correct 21 ms 1180 KB Output is correct
5 Correct 32 ms 2024 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 16 ms 600 KB Output is correct
4 Correct 20 ms 1004 KB Output is correct
5 Correct 30 ms 1220 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 19 ms 800 KB Output is correct
10 Correct 31 ms 1608 KB Output is correct
11 Correct 28 ms 1288 KB Output is correct
12 Correct 29 ms 1576 KB Output is correct
13 Correct 29 ms 1916 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 18 ms 900 KB Output is correct
5 Correct 29 ms 1412 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 13 ms 600 KB Output is correct
9 Correct 18 ms 792 KB Output is correct
10 Correct 30 ms 1240 KB Output is correct
11 Correct 27 ms 1772 KB Output is correct
12 Correct 28 ms 1140 KB Output is correct
13 Correct 29 ms 1188 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 16 ms 600 KB Output is correct
17 Correct 18 ms 600 KB Output is correct
18 Correct 22 ms 856 KB Output is correct
19 Correct 27 ms 1192 KB Output is correct
20 Correct 27 ms 896 KB Output is correct
21 Correct 33 ms 1480 KB Output is correct
22 Correct 36 ms 1276 KB Output is correct
23 Correct 33 ms 1796 KB Output is correct
24 Correct 34 ms 1456 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 13 ms 344 KB Output is correct
28 Correct 14 ms 344 KB Output is correct
29 Correct 13 ms 344 KB Output is correct
30 Correct 19 ms 692 KB Output is correct
31 Correct 22 ms 696 KB Output is correct
32 Correct 19 ms 944 KB Output is correct
33 Correct 25 ms 808 KB Output is correct
34 Correct 23 ms 1052 KB Output is correct
35 Correct 21 ms 804 KB Output is correct
36 Correct 27 ms 1364 KB Output is correct
37 Correct 39 ms 1460 KB Output is correct
38 Correct 35 ms 1520 KB Output is correct
39 Correct 40 ms 1528 KB Output is correct
40 Correct 35 ms 1180 KB Output is correct
41 Correct 39 ms 1164 KB Output is correct
42 Correct 37 ms 1380 KB Output is correct
43 Correct 35 ms 2068 KB Output is correct
44 Correct 35 ms 1532 KB Output is correct
45 Correct 11 ms 344 KB Output is correct
46 Correct 11 ms 344 KB Output is correct
47 Correct 13 ms 344 KB Output is correct
48 Correct 12 ms 600 KB Output is correct
49 Correct 13 ms 600 KB Output is correct
50 Correct 18 ms 768 KB Output is correct
51 Correct 25 ms 948 KB Output is correct
52 Correct 29 ms 756 KB Output is correct
53 Correct 19 ms 1036 KB Output is correct
54 Correct 22 ms 600 KB Output is correct
55 Correct 25 ms 1460 KB Output is correct
56 Correct 28 ms 1436 KB Output is correct
57 Correct 39 ms 1496 KB Output is correct
58 Correct 48 ms 1804 KB Output is correct
59 Correct 47 ms 2348 KB Output is correct
60 Correct 41 ms 1568 KB Output is correct
61 Correct 51 ms 1660 KB Output is correct
62 Correct 38 ms 1804 KB Output is correct
63 Correct 47 ms 1696 KB Output is correct
64 Correct 41 ms 1604 KB Output is correct

Subtask #4
30.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 15 ms 856 KB Output is correct
4 Correct 21 ms 876 KB Output is correct
5 Partially correct 29 ms 1548 KB Output is partially correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 13 ms 344 KB Output is correct
8 Correct 16 ms 856 KB Output is correct
9 Correct 16 ms 700 KB Output is correct
10 Partially correct 32 ms 1592 KB Output is partially correct
11 Partially correct 33 ms 1372 KB Output is partially correct
12 Partially correct 27 ms 1440 KB Output is partially correct
13 Partially correct 27 ms 1920 KB Output is partially correct
14 Correct 8 ms 548 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 19 ms 600 KB Output is correct
17 Correct 19 ms 856 KB Output is correct
18 Correct 21 ms 600 KB Output is correct
19 Correct 25 ms 808 KB Output is correct
20 Correct 22 ms 884 KB Output is correct
21 Correct 8 ms 600 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 13 ms 344 KB Output is correct
24 Correct 13 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 18 ms 764 KB Output is correct
27 Correct 19 ms 948 KB Output is correct
28 Correct 20 ms 436 KB Output is correct
29 Correct 22 ms 800 KB Output is correct
30 Correct 20 ms 792 KB Output is correct
31 Correct 22 ms 1000 KB Output is correct
32 Correct 10 ms 600 KB Output is correct
33 Correct 10 ms 344 KB Output is correct
34 Correct 15 ms 344 KB Output is correct
35 Correct 13 ms 344 KB Output is correct
36 Correct 12 ms 344 KB Output is correct
37 Partially correct 18 ms 952 KB Output is partially correct
38 Correct 29 ms 776 KB Output is correct
39 Correct 28 ms 756 KB Output is correct
40 Partially correct 20 ms 1336 KB Output is partially correct
41 Correct 22 ms 792 KB Output is correct
42 Partially correct 23 ms 932 KB Output is partially correct
43 Partially correct 33 ms 1448 KB Output is partially correct
44 Partially correct 34 ms 1508 KB Output is partially correct
45 Partially correct 37 ms 1464 KB Output is partially correct
46 Partially correct 30 ms 1736 KB Output is partially correct
47 Partially correct 33 ms 1608 KB Output is partially correct
48 Partially correct 38 ms 1372 KB Output is partially correct
49 Partially correct 36 ms 1496 KB Output is partially correct
50 Partially correct 34 ms 1444 KB Output is partially correct
51 Partially correct 34 ms 1860 KB Output is partially correct
52 Partially correct 34 ms 1612 KB Output is partially correct
53 Partially correct 34 ms 1544 KB Output is partially correct
54 Partially correct 35 ms 1816 KB Output is partially correct
55 Partially correct 37 ms 1196 KB Output is partially correct
56 Partially correct 32 ms 1452 KB Output is partially correct
57 Partially correct 35 ms 1496 KB Output is partially correct
58 Partially correct 32 ms 1256 KB Output is partially correct
59 Partially correct 36 ms 1476 KB Output is partially correct
60 Partially correct 37 ms 1388 KB Output is partially correct
61 Partially correct 33 ms 968 KB Output is partially correct
62 Partially correct 33 ms 1608 KB Output is partially correct
63 Partially correct 43 ms 1236 KB Output is partially correct
64 Partially correct 45 ms 2320 KB Output is partially correct
65 Partially correct 46 ms 1996 KB Output is partially correct
66 Partially correct 40 ms 1868 KB Output is partially correct
67 Partially correct 44 ms 2000 KB Output is partially correct
68 Partially correct 41 ms 2000 KB Output is partially correct
69 Partially correct 42 ms 1544 KB Output is partially correct
70 Partially correct 44 ms 2080 KB Output is partially correct
71 Partially correct 34 ms 1500 KB Output is partially correct
72 Partially correct 43 ms 1532 KB Output is partially correct
73 Partially correct 41 ms 1980 KB Output is partially correct
74 Partially correct 40 ms 1632 KB Output is partially correct
75 Partially correct 48 ms 1552 KB Output is partially correct
76 Partially correct 44 ms 2064 KB Output is partially correct
77 Partially correct 29 ms 1136 KB Output is partially correct
78 Partially correct 38 ms 1772 KB Output is partially correct
79 Partially correct 39 ms 1768 KB Output is partially correct
80 Partially correct 43 ms 2032 KB Output is partially correct
81 Partially correct 39 ms 1176 KB Output is partially correct
82 Partially correct 40 ms 1876 KB Output is partially correct