oj.uz

답안 #881064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881064 2023-11-30T13:34:55 Z HuyQuang_re_Zero Roller Coaster Railroad (IOI16_railroad) C++14
34 / 100
 211 ms 72024 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define IDB pair <db,int>
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
using namespace std;
#include "railroad.h"
const int oo=2e9;
ll Real[200005],r[200005],u,U[200005],D[200005];
int root(int u) { return u==r[u] ? u : r[u]=root(r[u]); }
struct edge { int u,v,w; } e[200005];
bool join(int u,int v)
{
    u=root(u); v=root(v);
    if(u==v) return 0;
    r[u]=v;
    return 1;
}
ll plan_roller_coaster(vector <int> s,vector <int> t)
{
    set <int> val;
    map <int,int> rr;
    val.insert(1);
    val.insert(oo);
    for(int x:s) val.insert(x);
    for(int x:t) val.insert(x);
    int n_val=0;
    for(int x:val) rr[x]=++n_val,Real[n_val]=x;



    int n=s.size(),i,up=0,down=0;
    ll res=0;
    for(u=1;u<=n_val;u++) r[u]=u;
    D[1]++; D[n_val]--;
    join(1,n_val);
    for(i=0;i<n;i++)
    {
        s[i]=rr[s[i]]; t[i]=rr[t[i]];
        if(s[i]<=t[i]) U[s[i]]++,U[t[i]]--;
        else D[t[i]]++,D[s[i]]--;
        join(s[i],t[i]);
    }
    for(i=1;i<n_val;i++)
    {
        up+=U[i]; down+=D[i];
        res+=max(0,up-down)*(Real[i+1]-Real[i]);
        if(up!=down) join(i,i+1);
        e[i]={ i,i+1,Real[i+1]-Real[i] };
    }
    sort(e+1,e+n_val,[&](edge a,edge b){ return a.w<b.w; });
    for(i=1;i<n_val;i++)
        if(join(e[i].u,e[i].v)) res+=e[i].w;
    return res;
}

/*
int main()
{
    freopen("railroad.inp","r",stdin);
    freopen("railroad.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    vector <int> s,t;
    int l,r;
    while(cin>>l>>r) s.push_back(l),t.push_back(r);
    cout<<plan_roller_coaster(s,t);
}
*/

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:60:31: warning: narrowing conversion of '(Real[(i + 1)] - Real[i])' from 'long long int' to 'int' [-Wnarrowing]
   60 |         e[i]={ i,i+1,Real[i+1]-Real[i] };
      |                      ~~~~~~~~~^~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB n = 2
2 Correct 1 ms 6488 KB n = 2
3 Correct 1 ms 6492 KB n = 2
4 Correct 1 ms 6492 KB n = 2
5 Correct 1 ms 6492 KB n = 2
6 Correct 1 ms 6492 KB n = 2
7 Correct 1 ms 6644 KB n = 3
8 Correct 1 ms 6492 KB n = 3
9 Correct 1 ms 6492 KB n = 3
10 Correct 1 ms 6596 KB n = 8
11 Correct 1 ms 6492 KB n = 8
12 Correct 1 ms 6488 KB n = 8
13 Correct 1 ms 6488 KB n = 8
14 Correct 1 ms 6492 KB n = 8
15 Correct 1 ms 6492 KB n = 8
16 Correct 1 ms 6488 KB n = 8
17 Correct 1 ms 6488 KB n = 8
18 Correct 1 ms 6492 KB n = 8
19 Correct 1 ms 6492 KB n = 3
20 Correct 1 ms 6492 KB n = 7
21 Correct 1 ms 6592 KB n = 8
22 Correct 1 ms 6492 KB n = 8
23 Correct 1 ms 6492 KB n = 8
24 Correct 1 ms 6492 KB n = 8
25 Correct 1 ms 6492 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB n = 2
2 Correct 1 ms 6488 KB n = 2
3 Correct 1 ms 6492 KB n = 2
4 Correct 1 ms 6492 KB n = 2
5 Correct 1 ms 6492 KB n = 2
6 Correct 1 ms 6492 KB n = 2
7 Correct 1 ms 6644 KB n = 3
8 Correct 1 ms 6492 KB n = 3
9 Correct 1 ms 6492 KB n = 3
10 Correct 1 ms 6596 KB n = 8
11 Correct 1 ms 6492 KB n = 8
12 Correct 1 ms 6488 KB n = 8
13 Correct 1 ms 6488 KB n = 8
14 Correct 1 ms 6492 KB n = 8
15 Correct 1 ms 6492 KB n = 8
16 Correct 1 ms 6488 KB n = 8
17 Correct 1 ms 6488 KB n = 8
18 Correct 1 ms 6492 KB n = 8
19 Correct 1 ms 6492 KB n = 3
20 Correct 1 ms 6492 KB n = 7
21 Correct 1 ms 6592 KB n = 8
22 Correct 1 ms 6492 KB n = 8
23 Correct 1 ms 6492 KB n = 8
24 Correct 1 ms 6492 KB n = 8
25 Correct 1 ms 6492 KB n = 8
26 Correct 1 ms 6492 KB n = 8
27 Correct 1 ms 6492 KB n = 8
28 Correct 1 ms 6604 KB n = 8
29 Correct 1 ms 6492 KB n = 16
30 Correct 1 ms 6488 KB n = 16
31 Correct 1 ms 6488 KB n = 16
32 Correct 1 ms 6492 KB n = 16
33 Correct 1 ms 6492 KB n = 16
34 Correct 1 ms 6492 KB n = 16
35 Correct 1 ms 6492 KB n = 16
36 Correct 1 ms 6492 KB n = 15
37 Correct 1 ms 6488 KB n = 8
38 Correct 1 ms 6488 KB n = 16
39 Correct 1 ms 6488 KB n = 16
40 Correct 1 ms 6492 KB n = 9
41 Correct 1 ms 6492 KB n = 16
42 Correct 1 ms 6492 KB n = 16
43 Correct 1 ms 6492 KB n = 16
44 Correct 1 ms 6492 KB n = 9
45 Correct 1 ms 6556 KB n = 15
46 Correct 1 ms 6492 KB n = 16
47 Correct 1 ms 6592 KB n = 16
48 Correct 1 ms 6492 KB n = 16

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 211 ms 72024 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB n = 2
2 Correct 1 ms 6488 KB n = 2
3 Correct 1 ms 6492 KB n = 2
4 Correct 1 ms 6492 KB n = 2
5 Correct 1 ms 6492 KB n = 2
6 Correct 1 ms 6492 KB n = 2
7 Correct 1 ms 6644 KB n = 3
8 Correct 1 ms 6492 KB n = 3
9 Correct 1 ms 6492 KB n = 3
10 Correct 1 ms 6596 KB n = 8
11 Correct 1 ms 6492 KB n = 8
12 Correct 1 ms 6488 KB n = 8
13 Correct 1 ms 6488 KB n = 8
14 Correct 1 ms 6492 KB n = 8
15 Correct 1 ms 6492 KB n = 8
16 Correct 1 ms 6488 KB n = 8
17 Correct 1 ms 6488 KB n = 8
18 Correct 1 ms 6492 KB n = 8
19 Correct 1 ms 6492 KB n = 3
20 Correct 1 ms 6492 KB n = 7
21 Correct 1 ms 6592 KB n = 8
22 Correct 1 ms 6492 KB n = 8
23 Correct 1 ms 6492 KB n = 8
24 Correct 1 ms 6492 KB n = 8
25 Correct 1 ms 6492 KB n = 8
26 Correct 1 ms 6492 KB n = 8
27 Correct 1 ms 6492 KB n = 8
28 Correct 1 ms 6604 KB n = 8
29 Correct 1 ms 6492 KB n = 16
30 Correct 1 ms 6488 KB n = 16
31 Correct 1 ms 6488 KB n = 16
32 Correct 1 ms 6492 KB n = 16
33 Correct 1 ms 6492 KB n = 16
34 Correct 1 ms 6492 KB n = 16
35 Correct 1 ms 6492 KB n = 16
36 Correct 1 ms 6492 KB n = 15
37 Correct 1 ms 6488 KB n = 8
38 Correct 1 ms 6488 KB n = 16
39 Correct 1 ms 6488 KB n = 16
40 Correct 1 ms 6492 KB n = 9
41 Correct 1 ms 6492 KB n = 16
42 Correct 1 ms 6492 KB n = 16
43 Correct 1 ms 6492 KB n = 16
44 Correct 1 ms 6492 KB n = 9
45 Correct 1 ms 6556 KB n = 15
46 Correct 1 ms 6492 KB n = 16
47 Correct 1 ms 6592 KB n = 16
48 Correct 1 ms 6492 KB n = 16
49 Runtime error 211 ms 72024 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -