oj.uz

Submission #962124

# Submission time Handle Problem Language Result Execution time Memory
962124 2024-04-13T07:17:50 Z Ahmed57 Roller Coaster Railroad (IOI16_railroad) C++17
34 / 100
 284 ms 94100 KB 
#include<bits/stdc++.h>
using namespace std;
#include "railroad.h"

int pr[200001];
int find(int x){
    if(x==pr[x])return x;
    return pr[x] = find(pr[x]);
}
bool mergegroup(int a,int b){
    a = find(a); b = find(b);
    if(a==b)return 0;
    pr[a] = b;
    return 1;
}
long long plan_roller_coaster(vector<int> s, vector<int> t){
    set<int> ss;
    for(auto i:s)ss.insert(i);
    for(auto i:t)ss.insert(i);
    map<int,int> sav;
    int rev[s.size()+t.size()+1];
    int cnt = 0;
    for(auto i:ss){
        sav[i] = ++cnt;
        rev[cnt] = i;
    }
    int in[cnt+1] = {0};
    int out[cnt+1] = {0};
    for(int i = 1;i<=cnt;i++)pr[i] = i;
    for(int i = 0;i<s.size();i++){
        in[sav[s[i]]]++;
        out[sav[t[i]]]++;
        mergegroup(sav[s[i]],sav[t[i]]);
    }
    in[cnt]++;
    out[1]++;
    mergegroup(1,cnt);
    long long ans = 0;
    vector<array<int,3>> ed;
    for(int i = cnt;i>1;i--){
        if(out[i]>in[i]){
            ans+=(out[i]-in[i])*(rev[i]-rev[i-1]);
            out[i-1]+=(out[i]-in[i]);
            mergegroup(i,i-1);
        }else if(in[i]>out[i]){
            in[i-1]+=(in[i]-out[i]);
            mergegroup(i,i-1);
        }
        ed.push_back({rev[i]-rev[i-1],i,i-1});
    }
    sort(ed.begin(),ed.end());
    for(auto i:ed){
        if(mergegroup(i[1],i[2]))ans+=i[0];
    }
    return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0;i<s.size();i++){
      |                   ~^~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
0 / 30.0

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