oj.uz

Submission #68985

# Submission time Handle Problem Language Result Execution time Memory
68985 2018-08-19T12:02:15 Z Kubalionzzale Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 376 ms 14620 KB 
#include "railroad.h"

#include <iostream>
#include <algorithm>
#include <functional>
#include <set>
#include <map>

int n;
std::pair<int, int> a[200010];
std::multimap< int, int, std::greater< int > > mapa;
//first - output speed, second - index

bool compare(const std::pair<int, int> &lhs, const std::pair<int, int> &rhs)
{
    if (lhs.first != rhs.first)
        return lhs.second > rhs.second;
    else
        return lhs.first > rhs.first;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = (int) s.size();

    for (int i = 0; i < n; ++i)
    {
        a[i].first = s[i];
        a[i].second = t[i];

        mapa.insert(std::make_pair(t[i], 0));
    }

    mapa.insert(std::make_pair(1, 0));

    int cnt = 1;
    for (auto it = --(mapa.end());;)
    {
        it->second = cnt;
        ++cnt;

        if (it == mapa.begin())
            break;
        else
            --it;
    }

    std::sort(a, a + n, compare);
    for (int i = 0; i < n; ++i)
    {
        auto it = mapa.lower_bound(s[i]);

        if (it->second < (n - i))
            return 1;

    }

    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 2
2 Correct 3 ms 488 KB n = 2
3 Correct 3 ms 544 KB n = 2
4 Correct 2 ms 544 KB n = 2
5 Correct 3 ms 544 KB n = 2
6 Incorrect 2 ms 544 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 2
2 Correct 3 ms 488 KB n = 2
3 Correct 3 ms 544 KB n = 2
4 Correct 2 ms 544 KB n = 2
5 Correct 3 ms 544 KB n = 2
6 Incorrect 2 ms 544 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 376 ms 14620 KB answer is not correct: 1 instead of 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 2
2 Correct 3 ms 488 KB n = 2
3 Correct 3 ms 544 KB n = 2
4 Correct 2 ms 544 KB n = 2
5 Correct 3 ms 544 KB n = 2
6 Incorrect 2 ms 544 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -