oj.uz

Submission #941927

# Submission time Handle Problem Language Result Execution time Memory
941927 2024-03-09T17:55:44 Z mariaclara Roller Coaster Railroad (IOI16_railroad) C++17
0 / 100
 118 ms 18232 KB 
#include "railroad.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 2e5+5;
#define all(x) x.begin(), x.end()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

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

    vector<pii> s1(n);
    set<pii> t1;

    for(int i = 0; i < n; i++)
        s1[i].fr = s[i], s1[i].sc = i, t1.insert({t[i],i});

    sort(all(s1));

    ll resp = 0;
    bool esc_first = 0;
    for(auto [val, i] : s1) {
        if(t1.size() == 1) return resp;
        auto it = t1.lower_bound({val,0});

        if(it == t1.end()) {
            if(esc_first) {esc_first = 1; continue; } // s1 vai ficar em 1° lugar
            it--;
            if((*it).sc == i) it--;
            resp += val - (*it).fr;
            t1.erase(it);
        }
        else if((*it).sc == i) {
            it++;
            if(it == t1.end()) it--, it--;
            if(!esc_first and val > (*it).fr) { esc_first = 1; continue; } 
            resp += max(0, val - (*it).fr); 
            t1.erase(it);
        }
        else t1.erase(it);
    }

    return resp;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 23.0

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

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 118 ms 18232 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 Incorrect 0 ms 348 KB answer is not correct: 15509384 instead of 0
2 Halted 0 ms 0 KB -