oj.uz

Submission #754875

# Submission time Handle Problem Language Result Execution time Memory
754875 2023-06-08T19:24:15 Z alexander707070 Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 70 ms 8876 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int n;
pair<int,int> a[200007];
 
bool cmp(pair<int,int> fr,pair<int,int> sc){
    return max(fr.second-sc.first,0) < max(sc.second-fr.first,0);
}
 
long long plan_roller_coaster(vector<int> s,vector<int> t){

    n=s.size();
    for(int i=1;i<=n;i++){
        a[i]={s[i-1],t[i-1]};
    }

    sort(a+1,a+n+1,cmp);

    for(int i=1;i<=n-1;i++){
        if(a[i].second>a[i+1].first)return 1;
    }
    
    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 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Incorrect 1 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 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Incorrect 1 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 70 ms 8780 KB n = 199999
2 Correct 64 ms 8780 KB n = 199991
3 Correct 69 ms 8876 KB n = 199993
4 Incorrect 43 ms 6492 KB answer is not correct: 1 instead of 0
5 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 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -