oj.uz

답안 #813457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813457 2023-08-07T18:14:15 Z mosiashvililuka Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 660 ms 41972 KB 
#include<bits/stdc++.h>
#include "railroad.h"
using namespace std;
long long pas,A,B;
int a,b,c,d,e,i,j,ii,jj,zx,xc,S[200009],T[200009],pi,msh[400009],zm[400009],cmp;
pair <int, int> p[400009];
map <int, int> m;
map <int, int>::iterator it,tt;
vector <pair <pair <int, int>, int> > edges;
int fnd(int q){
    if(msh[q]==q) return q; else return msh[q]=fnd(msh[q]);
}
void mrg(int q, int w){
    q=fnd(q);w=fnd(w);
    if(q==w) return;
    cmp--;
    if(zm[q]<zm[w]) swap(q,w);
    if(zm[q]==zm[w]) zm[q]++;
    msh[w]=q;
}
long long plan_roller_coaster(std::vector<int> Ss, std::vector<int> Tt) {
    a=Ss.size();
    for(i=1; i<=a; i++){
        S[i]=Ss[i-1];T[i]=Tt[i-1];
    }

    for(i=1; i<=a; i++){
        m[S[i]]++;m[T[i]]--;
    }
    zx=0;xc=0;
    pi++;p[pi]={0,0};
    xc++;m[0]=xc;
    for(it=m.begin(); it!=m.end(); it++){
        if((*it).first==0) continue;
        zx+=(*it).second;
        pi++;p[pi]={(*it).first,zx};
        xc++;
        (*it).second=xc;
        if(zx>1){
            c=(*it).first;
            tt=it;tt++;d=(*tt).first;
            edges.push_back({{xc,xc+1},0});
          	A=zx-1;B=(d-c);
            pas+=A*B;
        }
    }
    pi++;p[pi]={1000000003,zx};
    xc++;m[p[pi].first]=xc;

    for(ii=1; ii<pi; ii++){
        if(p[ii].second<1){
            edges.push_back({{m[p[ii].first],m[p[ii+1].first]},0});
        }
    }

    for(i=1; i<=a; i++){
        edges.push_back({{m[S[i]],m[T[i]]},0});
    }
    for(ii=1; ii<pi; ii++){
        edges.push_back({{m[p[ii].first],m[p[ii+1].first]},p[ii+1].first-p[ii].first});
    }
    for(auto &x:edges){
        swap(x.first.first,x.second);
    }
    sort(edges.begin(),edges.end());
    for(auto &x:edges){
        swap(x.first.first,x.second);
    }
    for(i=1; i<=pi; i++){
        msh[i]=i;zm[i]=0;
    }
    cmp=pi;
    for(auto x:edges){
        if(cmp==1) break;
        if(fnd(x.first.first)==fnd(x.first.second)) continue;
        mrg(x.first.first,x.first.second);
        pas+=x.second;
    }
    return pas;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 41864 KB n = 199999
2 Correct 560 ms 41912 KB n = 199991
3 Correct 566 ms 41872 KB n = 199993
4 Correct 392 ms 32948 KB n = 152076
5 Correct 229 ms 19848 KB n = 93249
6 Correct 443 ms 35536 KB n = 199910
7 Correct 534 ms 41300 KB n = 199999
8 Correct 455 ms 35864 KB n = 199997
9 Correct 509 ms 35848 KB n = 171294
10 Correct 376 ms 31460 KB n = 140872
11 Correct 519 ms 36020 KB n = 199886
12 Correct 505 ms 41072 KB n = 199996
13 Correct 435 ms 36976 KB n = 200000
14 Correct 547 ms 39464 KB n = 199998
15 Correct 528 ms 38940 KB n = 200000
16 Correct 471 ms 40012 KB n = 199998
17 Correct 452 ms 41860 KB n = 200000
18 Correct 488 ms 39776 KB n = 190000
19 Correct 496 ms 37264 KB n = 177777
20 Correct 205 ms 21116 KB n = 100000
21 Correct 612 ms 41884 KB n = 200000
22 Correct 547 ms 39528 KB n = 200000
23 Correct 564 ms 39528 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 0 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 276 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 0 ms 340 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 340 KB n = 8
28 Correct 0 ms 340 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 0 ms 212 KB n = 16
33 Correct 0 ms 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 0 ms 340 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 0 ms 340 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 0 ms 340 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 340 KB n = 16
49 Correct 564 ms 41864 KB n = 199999
50 Correct 560 ms 41912 KB n = 199991
51 Correct 566 ms 41872 KB n = 199993
52 Correct 392 ms 32948 KB n = 152076
53 Correct 229 ms 19848 KB n = 93249
54 Correct 443 ms 35536 KB n = 199910
55 Correct 534 ms 41300 KB n = 199999
56 Correct 455 ms 35864 KB n = 199997
57 Correct 509 ms 35848 KB n = 171294
58 Correct 376 ms 31460 KB n = 140872
59 Correct 519 ms 36020 KB n = 199886
60 Correct 505 ms 41072 KB n = 199996
61 Correct 435 ms 36976 KB n = 200000
62 Correct 547 ms 39464 KB n = 199998
63 Correct 528 ms 38940 KB n = 200000
64 Correct 471 ms 40012 KB n = 199998
65 Correct 452 ms 41860 KB n = 200000
66 Correct 488 ms 39776 KB n = 190000
67 Correct 496 ms 37264 KB n = 177777
68 Correct 205 ms 21116 KB n = 100000
69 Correct 612 ms 41884 KB n = 200000
70 Correct 547 ms 39528 KB n = 200000
71 Correct 564 ms 39528 KB n = 200000
72 Correct 576 ms 41804 KB n = 200000
73 Correct 594 ms 41896 KB n = 200000
74 Correct 653 ms 41972 KB n = 200000
75 Correct 500 ms 41872 KB n = 200000
76 Correct 522 ms 41928 KB n = 200000
77 Correct 289 ms 28380 KB n = 200000
78 Correct 291 ms 22348 KB n = 200000
79 Correct 585 ms 38680 KB n = 184307
80 Correct 157 ms 16700 KB n = 76040
81 Correct 501 ms 36096 KB n = 199981
82 Correct 550 ms 41136 KB n = 199994
83 Correct 458 ms 37068 KB n = 199996
84 Correct 555 ms 39500 KB n = 199998
85 Correct 571 ms 38964 KB n = 200000
86 Correct 531 ms 40008 KB n = 199998
87 Correct 584 ms 41860 KB n = 200000
88 Correct 506 ms 41852 KB n = 200000
89 Correct 613 ms 41864 KB n = 200000
90 Correct 642 ms 41800 KB n = 200000
91 Correct 593 ms 39576 KB n = 200000
92 Correct 660 ms 39552 KB n = 200000