oj.uz

Submission #839737

# Submission time Handle Problem Language Result Execution time Memory
839737 2023-08-30T15:49:30 Z model_code Longest Trip (IOI23_longesttrip) C++17
15 / 100
 13 ms 332 KB 
// incorrect/solution-wa-2waysLineSearch.cpp

#include "longesttrip.h"
#include <algorithm>
#include <random>
#include <set>

std::vector<int> longest_trip(int N, int /*D*/)
{
    std::set<int> nodes;
    nodes.clear();
    std::vector<int> ans;
    ans.clear();
    srand(time(0));
    for (int i = 1; i < N; i++)
        nodes.insert(i);
    int last = 0;
    ans.push_back(0);

    bool flipped = false;
    while (!nodes.empty())
    {
        bool found = false;
        for (int i : nodes)
        {
            if (are_connected({last}, {i}))
            {
                last = i;
                nodes.erase(i);
                ans.push_back(last);
                found = true;
                flipped = false;
                break;
            }
        }
        if (!found)
        {
            if (flipped)
                break;
            flipped = true;
            std::reverse(ans.begin(), ans.end());
            auto it = ans.end();
            it--;
            last = (*it);
        }
    }

    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 3 ms 208 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 9 ms 208 KB Output is correct
5 Correct 6 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 8 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct
9 Correct 8 ms 208 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 8 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 4 ms 304 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct
3 Correct 5 ms 208 KB Output is correct
4 Correct 7 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 10 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct
8 Correct 5 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 7 ms 208 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 7 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 13 ms 208 KB Output is correct
15 Incorrect 2 ms 208 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 9 ms 208 KB Output is correct
3 Correct 9 ms 208 KB Output is correct
4 Correct 6 ms 208 KB Output is correct
5 Correct 8 ms 300 KB Output is correct
6 Correct 12 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 10 ms 208 KB Output is correct
11 Correct 8 ms 208 KB Output is correct
12 Correct 9 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Incorrect 0 ms 208 KB Incorrect
15 Halted 0 ms 0 KB -