oj.uz

Submission #864543

# Submission time Handle Problem Language Result Execution time Memory
864543 2023-10-23T07:42:30 Z suiyeet Roller Coaster Railroad (IOI16_railroad) C++14
30 / 100
 437 ms 32500 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
const int MAXN = 400005;
const int inf=1000000500ll;
const long long oo =1000000000000000500ll;
const int MOD = (int)1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi;
namespace ufds{
    int p[MAXN];
    int sz[MAXN];
    int find(int x){
        if(p[x]==x)return x;
        else return p[x]=find(p[x]);
    }
    void merge(int x, int y){
        x=find(x);y=find(y);
        if(x==y)return;
        if(sz[x]<sz[y])swap(sz[x],sz[y]);
        sz[x]+=sz[y];
        p[y]=x;
    }
};
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    iota(ufds::p,ufds::p+MAXN,0);
    fill(ufds::sz,ufds::sz+MAXN,1);
    s.push_back(2e9);
    t.push_back(1);
    vector<int>points;
    map<int,int> mp;
    int n=s.size();
    for(int i=0;i<n;i++){
        points.push_back(s[i]);
        points.push_back(t[i]);
    }
    sort(points.begin(),points.end());
    points.resize(unique(points.begin(),points.end())-points.begin());
    for(int i=0;i<(int)points.size();i++){
        mp[points[i]]=i+1;
    }
    int m=points.size();
    int sum[m+5];memset(sum,0,sizeof sum);
    for(int i=0;i<n;i++){
        ufds::merge(mp[s[i]],mp[t[i]]);
        sum[mp[s[i]]]++;
        sum[mp[t[i]]]--;
        
    }
    
    for(int i=1;i<m;i++){
        sum[i]+=sum[i-1];
        if(sum[i]>0)return 1;
        if(sum[i]<0){
            ufds::merge(i,i+1);
        }
    }
    
    for(int i=1;i<m;i++){
        if(ufds::find(i) != ufds::find(i+1)){
            return 1;
        }
    }
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB n = 2
2 Correct 1 ms 3416 KB n = 2
3 Correct 2 ms 3420 KB n = 2
4 Correct 1 ms 3420 KB n = 2
5 Correct 1 ms 3420 KB n = 2
6 Incorrect 1 ms 3420 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 1 ms 3416 KB n = 2
2 Correct 1 ms 3416 KB n = 2
3 Correct 2 ms 3420 KB n = 2
4 Correct 1 ms 3420 KB n = 2
5 Correct 1 ms 3420 KB n = 2
6 Incorrect 1 ms 3420 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 437 ms 30948 KB n = 199999
2 Correct 413 ms 31976 KB n = 199991
3 Correct 400 ms 31792 KB n = 199993
4 Correct 318 ms 24960 KB n = 152076
5 Correct 150 ms 17048 KB n = 93249
6 Correct 365 ms 27348 KB n = 199910
7 Correct 347 ms 30796 KB n = 199999
8 Correct 342 ms 27428 KB n = 199997
9 Correct 351 ms 27420 KB n = 171294
10 Correct 237 ms 23660 KB n = 140872
11 Correct 321 ms 27696 KB n = 199886
12 Correct 337 ms 31464 KB n = 199996
13 Correct 314 ms 28596 KB n = 200000
14 Correct 320 ms 31312 KB n = 199998
15 Correct 302 ms 30892 KB n = 200000
16 Correct 354 ms 32048 KB n = 199998
17 Correct 356 ms 32300 KB n = 200000
18 Correct 333 ms 31104 KB n = 190000
19 Correct 297 ms 29272 KB n = 177777
20 Correct 132 ms 17980 KB n = 100000
21 Correct 339 ms 32500 KB n = 200000
22 Correct 364 ms 32392 KB n = 200000
23 Correct 394 ms 32428 KB n = 200000

Subtask #4
0 / 36.0

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