oj.uz

Submission #636912

# Submission time Handle Problem Language Result Execution time Memory
636912 2022-08-30T13:16:10 Z tabr Roller Coaster Railroad (IOI16_railroad) C++17
30 / 100
 621 ms 26136 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    s.emplace_back((int) 1e9);
    t.emplace_back(1);
    int n = (int) s.size();
    multiset<pair<int, int>> st, ts;
    for (int i = 0; i < n; i++) {
        st.emplace(s[i], t[i]);
        ts.emplace(t[i], s[i]);
    }
    while (st.size() > 1) {
        auto p = *ts.rbegin();
        ts.erase(ts.find(p));
        swap(p.first, p.second);
        st.erase(st.find(p));
        auto q = *st.rbegin();
        swap(q.first, q.second);
        ts.erase(ts.find(q));
        swap(q.first, q.second);
        st.erase(st.find(q));
        if (p.second > q.first) {
            return 1;
        }
        st.emplace(p.first, q.second);
        ts.emplace(q.second, p.first);
    }
    auto p = *st.begin();
    if (p.first < p.second) {
        return 1;
    } else {
        return 0;
    }
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    debug(plan_roller_coaster({1, 4, 5, 6}, {7, 3, 8, 6}));
    return 0;
}
#endif

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB n = 2
2 Correct 0 ms 216 KB n = 2
3 Correct 1 ms 216 KB n = 2
4 Correct 1 ms 216 KB n = 2
5 Correct 0 ms 216 KB n = 2
6 Incorrect 1 ms 216 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 0 ms 216 KB n = 2
2 Correct 0 ms 216 KB n = 2
3 Correct 1 ms 216 KB n = 2
4 Correct 1 ms 216 KB n = 2
5 Correct 0 ms 216 KB n = 2
6 Incorrect 1 ms 216 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 621 ms 22844 KB n = 199999
2 Correct 320 ms 26084 KB n = 199991
3 Correct 312 ms 26136 KB n = 199993
4 Correct 388 ms 19488 KB n = 152076
5 Correct 207 ms 12308 KB n = 93249
6 Correct 357 ms 24964 KB n = 199910
7 Correct 323 ms 25364 KB n = 199999
8 Correct 314 ms 24960 KB n = 199997
9 Correct 423 ms 22240 KB n = 171294
10 Correct 350 ms 18352 KB n = 140872
11 Correct 290 ms 24864 KB n = 199886
12 Correct 289 ms 25376 KB n = 199996
13 Correct 279 ms 25040 KB n = 200000
14 Correct 262 ms 25384 KB n = 199998
15 Correct 273 ms 25240 KB n = 200000
16 Correct 267 ms 25500 KB n = 199998
17 Correct 241 ms 26088 KB n = 200000
18 Correct 233 ms 24736 KB n = 190000
19 Correct 216 ms 23204 KB n = 177777
20 Correct 185 ms 13184 KB n = 100000
21 Correct 434 ms 26132 KB n = 200000
22 Correct 306 ms 26028 KB n = 200000
23 Correct 548 ms 26016 KB n = 200000

Subtask #4
0 / 36.0

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