oj.uz

Submission #927740

# Submission time Handle Problem Language Result Execution time Memory
927740 2024-02-15T09:43:07 Z aykhn Longest Trip (IOI23_longesttrip) C++17
15 / 100
 757 ms 1112 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;
        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;
            int idx = -1;
            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}))
        {
            for (int x : v1)
            {
                for (int y : v1) assert(ask({x}, {y}));
            }
            vector<int> nw;
            int idx = -1;
            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:51:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |             for (int j = 0; j < v1.size(); j++)
      |                             ~~^~~~~~~~~~~
longesttrip.cpp:59:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             for (int j = 0; j < v2.size(); j++)
      |                             ~~^~~~~~~~~~~
longesttrip.cpp:85:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |             for (int j = 0; j < v1.size(); j++)
      |                             ~~^~~~~~~~~~~
longesttrip.cpp:108:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             for (int j = 0; j < v2.size(); j++)
      |                             ~~^~~~~~~~~~~
longesttrip.cpp:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |     for (int i = 1; i < res.size(); i++)
      |                     ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 162 ms 936 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Correct 126 ms 600 KB Output is correct
4 Correct 329 ms 600 KB Output is correct
5 Correct 710 ms 720 KB Output is correct

Subtask #2
10.0 / 10.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 121 ms 600 KB Output is correct
4 Correct 347 ms 600 KB Output is correct
5 Correct 701 ms 728 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Correct 109 ms 600 KB Output is correct
9 Correct 249 ms 592 KB Output is correct
10 Correct 727 ms 716 KB Output is correct
11 Correct 720 ms 748 KB Output is correct
12 Correct 729 ms 1080 KB Output is correct
13 Correct 705 ms 1112 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 19 ms 344 KB Output is correct
3 Correct 112 ms 600 KB Output is correct
4 Correct 381 ms 684 KB Output is correct
5 Correct 757 ms 720 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 21 ms 344 KB Output is correct
8 Correct 132 ms 344 KB Output is correct
9 Correct 244 ms 536 KB Output is correct
10 Correct 717 ms 724 KB Output is correct
11 Correct 701 ms 716 KB Output is correct
12 Correct 709 ms 856 KB Output is correct
13 Correct 728 ms 720 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Incorrect 4 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 20 ms 344 KB Output is correct
3 Partially correct 122 ms 600 KB Output is partially correct
4 Partially correct 331 ms 588 KB Output is partially correct
5 Partially correct 755 ms 724 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Partially correct 121 ms 600 KB Output is partially correct
9 Partially correct 241 ms 592 KB Output is partially correct
10 Partially correct 697 ms 856 KB Output is partially correct
11 Partially correct 700 ms 712 KB Output is partially correct
12 Partially correct 728 ms 716 KB Output is partially correct
13 Partially correct 652 ms 1112 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Incorrect 5 ms 600 KB Incorrect
16 Halted 0 ms 0 KB -