oj.uz

Submission #789823

# Submission time Handle Problem Language Result Execution time Memory
789823 2023-07-22T05:32:27 Z mindiyak Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 84 ms 9404 KB 
#include "railroad.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <climits>
#include <deque>

#define pb push_back
using namespace std;
#define ll long long

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

    for(int i=0;i<n;i++){
        s_start.push_back({s[i],i});
        s_end.push_back({t[i],i});
    }

    sort(s_start.rbegin(),s_start.rend());
    sort(s_end.rbegin(),s_end.rend());

    for(int i=0;i<n;i++){
        if(s_end[i].second != s_start[0].second){
            if(s_end[i].first > s_start[0].first){
                return 1;
            }
        }else if(s_start.size() > 1){
            if(s_end[i].first > s_start[1].first){
                return 1;
            }
        }
        s_start.pop_front();        
    }
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 0 ms 212 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 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Incorrect 0 ms 212 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 Correct 71 ms 6740 KB n = 199999
2 Correct 74 ms 6988 KB n = 199991
3 Correct 72 ms 6988 KB n = 199993
4 Correct 54 ms 5456 KB n = 152076
5 Correct 34 ms 5076 KB n = 93249
6 Incorrect 84 ms 9404 KB answer is not correct: 1 instead of 0
7 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

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