oj.uz

Submission #911271

# Submission time Handle Problem Language Result Execution time Memory
911271 2024-01-18T17:27:14 Z JakobZorz Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 606 ms 90872 KB 
#include"railroad.h"
#include<iostream>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;

int dsu[200002];
int get(int a){
    if(dsu[a]<0)
        return a;
    return dsu[a]=get(dsu[a]);
}

void merge(int a,int b){
    a=get(a);
    b=get(b);
    if(a==b)
        return;
    if(dsu[a]>dsu[b])
        swap(a,b);
    dsu[a]+=dsu[b];
    dsu[b]=a;
}

ll plan_roller_coaster(vector<int>s,vector<int>t){
    for(int i=0;i<200002;i++)
        dsu[i]=-1;
    s.push_back(1e9);
    t.push_back(1);
    int n=(int)s.size();
    set<int>interestings;
    for(int i:s)
        interestings.insert(i);
    for(int i:t)
        interestings.insert(i);
    vector<int>interesting(interestings.begin(),interestings.end());
    map<int,int>m;
    {
        int idx=0;
        for(int i:interesting)
            m[i]=idx++;
    }
    vector<int>bal(interesting.size());
    for(int&i:s)
        i=m[i];
    for(int&i:t)
        i=m[i];
    for(int i=0;i<n;i++){
        int a=s[i],b=t[i];
        merge(a,b);
        bal[a]++;
        bal[b]--;
    }
    
    ll res=0;
    
    ll cbal=0;
    vector<pair<int,int>>conns;
    for(int i=0;i<(int)interesting.size()-1;i++){
        ll dist=interesting[i+1]-interesting[i];
        conns.emplace_back((int)dist,i);
        cbal+=bal[i];
        res+=max(0LL,cbal*dist);
        if(cbal!=0)
            merge(i,i+1);
    }
    sort(conns.begin(),conns.end());
    for(auto conn:conns){
        if(get(conn.second)!=get(conn.second+1)){
            merge(conn.second,conn.second+1);
            res+=conn.first;
        }
    }
    
    return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB n = 2
2 Correct 1 ms 1116 KB n = 2
3 Correct 1 ms 1116 KB n = 2
4 Correct 1 ms 1116 KB n = 2
5 Correct 1 ms 1116 KB n = 2
6 Correct 1 ms 1116 KB n = 2
7 Correct 1 ms 1116 KB n = 3
8 Correct 1 ms 1116 KB n = 3
9 Correct 1 ms 1112 KB n = 3
10 Correct 1 ms 1116 KB n = 8
11 Correct 1 ms 1116 KB n = 8
12 Correct 1 ms 1116 KB n = 8
13 Correct 1 ms 1116 KB n = 8
14 Correct 1 ms 1116 KB n = 8
15 Correct 1 ms 1116 KB n = 8
16 Correct 1 ms 1116 KB n = 8
17 Correct 1 ms 1116 KB n = 8
18 Correct 1 ms 1116 KB n = 8
19 Correct 1 ms 1112 KB n = 3
20 Correct 1 ms 1116 KB n = 7
21 Correct 1 ms 1116 KB n = 8
22 Correct 1 ms 1116 KB n = 8
23 Correct 1 ms 1116 KB n = 8
24 Correct 1 ms 1116 KB n = 8
25 Correct 1 ms 1112 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB n = 2
2 Correct 1 ms 1116 KB n = 2
3 Correct 1 ms 1116 KB n = 2
4 Correct 1 ms 1116 KB n = 2
5 Correct 1 ms 1116 KB n = 2
6 Correct 1 ms 1116 KB n = 2
7 Correct 1 ms 1116 KB n = 3
8 Correct 1 ms 1116 KB n = 3
9 Correct 1 ms 1112 KB n = 3
10 Correct 1 ms 1116 KB n = 8
11 Correct 1 ms 1116 KB n = 8
12 Correct 1 ms 1116 KB n = 8
13 Correct 1 ms 1116 KB n = 8
14 Correct 1 ms 1116 KB n = 8
15 Correct 1 ms 1116 KB n = 8
16 Correct 1 ms 1116 KB n = 8
17 Correct 1 ms 1116 KB n = 8
18 Correct 1 ms 1116 KB n = 8
19 Correct 1 ms 1112 KB n = 3
20 Correct 1 ms 1116 KB n = 7
21 Correct 1 ms 1116 KB n = 8
22 Correct 1 ms 1116 KB n = 8
23 Correct 1 ms 1116 KB n = 8
24 Correct 1 ms 1116 KB n = 8
25 Correct 1 ms 1112 KB n = 8
26 Correct 1 ms 1112 KB n = 8
27 Correct 1 ms 1116 KB n = 8
28 Correct 1 ms 1116 KB n = 8
29 Correct 1 ms 1116 KB n = 16
30 Correct 1 ms 1112 KB n = 16
31 Correct 1 ms 1112 KB n = 16
32 Correct 1 ms 1116 KB n = 16
33 Correct 1 ms 1116 KB n = 16
34 Correct 1 ms 1116 KB n = 16
35 Correct 1 ms 1116 KB n = 16
36 Correct 1 ms 1116 KB n = 15
37 Correct 1 ms 1116 KB n = 8
38 Correct 1 ms 1116 KB n = 16
39 Correct 1 ms 1116 KB n = 16
40 Correct 1 ms 1116 KB n = 9
41 Correct 1 ms 1116 KB n = 16
42 Correct 1 ms 1116 KB n = 16
43 Correct 1 ms 1116 KB n = 16
44 Correct 1 ms 1116 KB n = 9
45 Correct 1 ms 1116 KB n = 15
46 Correct 1 ms 1116 KB n = 16
47 Correct 1 ms 1112 KB n = 16
48 Correct 1 ms 1116 KB n = 16

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 606 ms 90872 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB n = 2
2 Correct 1 ms 1116 KB n = 2
3 Correct 1 ms 1116 KB n = 2
4 Correct 1 ms 1116 KB n = 2
5 Correct 1 ms 1116 KB n = 2
6 Correct 1 ms 1116 KB n = 2
7 Correct 1 ms 1116 KB n = 3
8 Correct 1 ms 1116 KB n = 3
9 Correct 1 ms 1112 KB n = 3
10 Correct 1 ms 1116 KB n = 8
11 Correct 1 ms 1116 KB n = 8
12 Correct 1 ms 1116 KB n = 8
13 Correct 1 ms 1116 KB n = 8
14 Correct 1 ms 1116 KB n = 8
15 Correct 1 ms 1116 KB n = 8
16 Correct 1 ms 1116 KB n = 8
17 Correct 1 ms 1116 KB n = 8
18 Correct 1 ms 1116 KB n = 8
19 Correct 1 ms 1112 KB n = 3
20 Correct 1 ms 1116 KB n = 7
21 Correct 1 ms 1116 KB n = 8
22 Correct 1 ms 1116 KB n = 8
23 Correct 1 ms 1116 KB n = 8
24 Correct 1 ms 1116 KB n = 8
25 Correct 1 ms 1112 KB n = 8
26 Correct 1 ms 1112 KB n = 8
27 Correct 1 ms 1116 KB n = 8
28 Correct 1 ms 1116 KB n = 8
29 Correct 1 ms 1116 KB n = 16
30 Correct 1 ms 1112 KB n = 16
31 Correct 1 ms 1112 KB n = 16
32 Correct 1 ms 1116 KB n = 16
33 Correct 1 ms 1116 KB n = 16
34 Correct 1 ms 1116 KB n = 16
35 Correct 1 ms 1116 KB n = 16
36 Correct 1 ms 1116 KB n = 15
37 Correct 1 ms 1116 KB n = 8
38 Correct 1 ms 1116 KB n = 16
39 Correct 1 ms 1116 KB n = 16
40 Correct 1 ms 1116 KB n = 9
41 Correct 1 ms 1116 KB n = 16
42 Correct 1 ms 1116 KB n = 16
43 Correct 1 ms 1116 KB n = 16
44 Correct 1 ms 1116 KB n = 9
45 Correct 1 ms 1116 KB n = 15
46 Correct 1 ms 1116 KB n = 16
47 Correct 1 ms 1112 KB n = 16
48 Correct 1 ms 1116 KB n = 16
49 Runtime error 606 ms 90872 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -