oj.uz

Submission #332156

# Submission time Handle Problem Language Result Execution time Memory
332156 2020-12-01T15:01:25 Z ruatin Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 220 ms 17628 KB 
#include <bits/stdc++.h>
#include "railroad.h"
#define forinc(i,a,b) for(int i=a;i<=b;++i)
#define fordec(i,a,b) for(int i=a;i>=b;--i)
#define all(a) a.begin(),a.end()
#define lli long long
using namespace std;

const int N = 4e5+5;
int n;
int in[N], out[N];
lli that[N], res;

struct DSU
{
    int n;
    vector<int> id;
    DSU(int n) : n(n), id(n+1,-1) {}
    int root(int u)
    {
        return id[u]<0 ? u : id[u]=root(id[u]);
    }
    bool join(int u,int v)
    {
        if((u=root(u))==(v=root(v)))
            return 0;
        if(id[u]>id[v])
            swap(u,v);
        id[u] += id[v];
        id[v] = u;
        return 1;
    }
};

struct edge
{
    int u, v, c;
};
vector<edge> E;

long long plan_roller_coaster(vector<int> s, vector<int> t)
{
  	n = s.size();
    vector<int> rrh;
    forinc(i,0,n-1)
    {
        rrh.push_back(s[i]);
        rrh.push_back(t[i]);
    }
    sort(all(rrh));
    rrh.erase(unique(all(rrh)),rrh.end());
    int ma = rrh.size();
    DSU dsu(ma);
    forinc(i,0,n-1)
    {
        int _s = lower_bound(all(rrh),s[i]) - rrh.begin() + 1;
        int _t = lower_bound(all(rrh),t[i]) - rrh.begin() + 1;
        that[_s] = s[i], that[_t] = t[i];
        out[_s]++;
        in[_t]++;
        dsu.join(_s,_t);
    }
    out[ma]++;
    in[1]++;
    fordec(i,ma,1)
    {
        if(in[i] > out[i])
        {
            in[i-1] += in[i]-out[i];
            res += 1ll*(in[i]-out[i])*(that[i]-that[i-1]);
            dsu.join(i-1,i);
        }
        else if(in[i] < out[i])
        {
            out[i-1] += out[i] - in[i];
            dsu.join(i-1,i);
        }
    }
    forinc(i,1,ma-1) if(dsu.root(i) != dsu.root(i+1))
        E.push_back({i,i+1,that[i+1]-that[i]});
    sort(all(E),[](const edge &a, const edge &b)
    {
        return a.c < b.c;
    });
    for(edge e:E)
    {
        if(dsu.join(e.u, e.v))
            res += e.c;
    }
    return res;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:80:37: warning: narrowing conversion of '(that[(i + 1)] - that[i])' from 'long long int' to 'int' [-Wnarrowing]
   80 |         E.push_back({i,i+1,that[i+1]-that[i]});
      |                            ~~~~~~~~~^~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 13020 KB n = 199999
2 Correct 196 ms 13148 KB n = 199991
3 Correct 199 ms 13108 KB n = 199993
4 Correct 143 ms 10124 KB n = 152076
5 Correct 80 ms 6368 KB n = 93249
6 Correct 184 ms 11612 KB n = 199910
7 Correct 183 ms 12764 KB n = 199999
8 Correct 170 ms 11740 KB n = 199997
9 Correct 163 ms 11484 KB n = 171294
10 Correct 132 ms 9308 KB n = 140872
11 Correct 175 ms 11744 KB n = 199886
12 Correct 182 ms 13148 KB n = 199996
13 Correct 174 ms 11996 KB n = 200000
14 Correct 189 ms 14044 KB n = 199998
15 Correct 191 ms 13916 KB n = 200000
16 Correct 188 ms 14300 KB n = 199998
17 Correct 190 ms 12428 KB n = 200000
18 Correct 183 ms 12380 KB n = 190000
19 Correct 158 ms 10844 KB n = 177777
20 Correct 85 ms 6880 KB n = 100000
21 Correct 191 ms 13020 KB n = 200000
22 Correct 219 ms 17628 KB n = 200000
23 Correct 206 ms 13148 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 364 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 0 ms 364 KB n = 2
6 Correct 0 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 0 ms 364 KB n = 3
10 Correct 0 ms 364 KB n = 8
11 Correct 0 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 0 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 1 ms 364 KB n = 8
28 Correct 0 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 396 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 0 ms 364 KB n = 16
33 Correct 1 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 364 KB n = 16
36 Correct 1 ms 364 KB n = 15
37 Correct 1 ms 364 KB n = 8
38 Correct 1 ms 364 KB n = 16
39 Correct 1 ms 364 KB n = 16
40 Correct 1 ms 364 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 1 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 1 ms 364 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 1 ms 364 KB n = 16
47 Correct 0 ms 364 KB n = 16
48 Correct 1 ms 364 KB n = 16
49 Correct 189 ms 13020 KB n = 199999
50 Correct 196 ms 13148 KB n = 199991
51 Correct 199 ms 13108 KB n = 199993
52 Correct 143 ms 10124 KB n = 152076
53 Correct 80 ms 6368 KB n = 93249
54 Correct 184 ms 11612 KB n = 199910
55 Correct 183 ms 12764 KB n = 199999
56 Correct 170 ms 11740 KB n = 199997
57 Correct 163 ms 11484 KB n = 171294
58 Correct 132 ms 9308 KB n = 140872
59 Correct 175 ms 11744 KB n = 199886
60 Correct 182 ms 13148 KB n = 199996
61 Correct 174 ms 11996 KB n = 200000
62 Correct 189 ms 14044 KB n = 199998
63 Correct 191 ms 13916 KB n = 200000
64 Correct 188 ms 14300 KB n = 199998
65 Correct 190 ms 12428 KB n = 200000
66 Correct 183 ms 12380 KB n = 190000
67 Correct 158 ms 10844 KB n = 177777
68 Correct 85 ms 6880 KB n = 100000
69 Correct 191 ms 13020 KB n = 200000
70 Correct 219 ms 17628 KB n = 200000
71 Correct 206 ms 13148 KB n = 200000
72 Correct 193 ms 13020 KB n = 200000
73 Correct 197 ms 13148 KB n = 200000
74 Correct 191 ms 13020 KB n = 200000
75 Correct 184 ms 12248 KB n = 200000
76 Correct 184 ms 12252 KB n = 200000
77 Correct 154 ms 8924 KB n = 200000
78 Correct 189 ms 13660 KB n = 200000
79 Correct 180 ms 11996 KB n = 184307
80 Correct 70 ms 5472 KB n = 76040
81 Correct 184 ms 11740 KB n = 199981
82 Correct 198 ms 13012 KB n = 199994
83 Correct 189 ms 11988 KB n = 199996
84 Correct 185 ms 14172 KB n = 199998
85 Correct 194 ms 13916 KB n = 200000
86 Correct 196 ms 14300 KB n = 199998
87 Correct 199 ms 12252 KB n = 200000
88 Correct 197 ms 13020 KB n = 200000
89 Correct 183 ms 12380 KB n = 200000
90 Correct 193 ms 13228 KB n = 200000
91 Correct 220 ms 17500 KB n = 200000
92 Correct 197 ms 13020 KB n = 200000