oj.uz

답안 #117891

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117891 2019-06-17T09:44:53 Z nvmdava Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 1484 ms 77388 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define N 200005
#define ff first
#define ss second
vector<pair<int, pair<int, int> > > f;
int p[N];

int find(int v){
   return (v == p[v] ? v : p[v] = find(p[v]));
}

bool unite(int v, int u){
   v = find(v);
   u = find(u);
   if(v == u) return 0;
   p[v] = u;
   return 1;
}

map<int, int> sw;
map<int, vector<int> > in;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
   int n = s.size();
   s.push_back(1000000001);
   t.push_back(1);
   for(int i = 0; i <= n; i++){
      sw[s[i]]++;
      p[i] = i;
      sw[t[i]]--;
      in[s[i]].push_back(i);
      in[t[i]].push_back(i);
   }
   long long res = 0;
   int bal = 0, last = 0, lastid = n;

   for(auto x : sw){
      if(bal > 0){
         res += 1LL * bal * (x.ff - last);
      }
      for(int y : in[x.ff]){
         f.push_back({ bal == 0 ? x.ff - last : 0, {y, lastid}});
         lastid = y;
         last = x.ff;
      }

      bal += x.ss;
   }
   sort(f.begin(), f.end());
   for(auto x : f)
      res += x.ff * unite(x.ss.ff, x.ss.ss);
   return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1484 ms 77224 KB n = 199999
2 Correct 1417 ms 77156 KB n = 199991
3 Correct 1347 ms 77096 KB n = 199993
4 Correct 1032 ms 60392 KB n = 152076
5 Correct 482 ms 36752 KB n = 93249
6 Correct 1099 ms 64584 KB n = 199910
7 Correct 1061 ms 75088 KB n = 199999
8 Correct 1006 ms 65100 KB n = 199997
9 Correct 1055 ms 67544 KB n = 171294
10 Correct 863 ms 57120 KB n = 140872
11 Correct 1088 ms 65568 KB n = 199886
12 Correct 1000 ms 75540 KB n = 199996
13 Correct 951 ms 67420 KB n = 200000
14 Correct 955 ms 75048 KB n = 199998
15 Correct 971 ms 73980 KB n = 200000
16 Correct 994 ms 76496 KB n = 199998
17 Correct 1187 ms 77388 KB n = 200000
18 Correct 1042 ms 74272 KB n = 190000
19 Correct 1049 ms 70092 KB n = 177777
20 Correct 526 ms 38984 KB n = 100000
21 Correct 1129 ms 77184 KB n = 200000
22 Correct 1173 ms 77092 KB n = 200000
23 Correct 1258 ms 77036 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 384 KB n = 2
3 Correct 2 ms 384 KB n = 2
4 Correct 2 ms 384 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 3 ms 384 KB n = 2
7 Correct 2 ms 384 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 2 ms 256 KB n = 3
10 Correct 2 ms 256 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 256 KB n = 8
15 Correct 2 ms 384 KB n = 8
16 Correct 2 ms 256 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 256 KB n = 8
19 Correct 3 ms 460 KB n = 3
20 Correct 2 ms 384 KB n = 7
21 Correct 2 ms 256 KB n = 8
22 Correct 2 ms 384 KB n = 8
23 Correct 1 ms 256 KB n = 8
24 Correct 2 ms 256 KB n = 8
25 Correct 2 ms 256 KB n = 8
26 Correct 2 ms 384 KB n = 8
27 Correct 2 ms 384 KB n = 8
28 Correct 2 ms 384 KB n = 8
29 Correct 2 ms 256 KB n = 16
30 Correct 2 ms 384 KB n = 16
31 Correct 2 ms 384 KB n = 16
32 Correct 2 ms 256 KB n = 16
33 Correct 2 ms 384 KB n = 16
34 Correct 2 ms 384 KB n = 16
35 Correct 2 ms 384 KB n = 16
36 Correct 2 ms 384 KB n = 15
37 Correct 2 ms 384 KB n = 8
38 Correct 2 ms 384 KB n = 16
39 Correct 2 ms 256 KB n = 16
40 Correct 2 ms 256 KB n = 9
41 Correct 2 ms 384 KB n = 16
42 Correct 2 ms 384 KB n = 16
43 Correct 2 ms 256 KB n = 16
44 Correct 2 ms 256 KB n = 9
45 Correct 2 ms 256 KB n = 15
46 Correct 2 ms 256 KB n = 16
47 Correct 2 ms 384 KB n = 16
48 Correct 2 ms 412 KB n = 16
49 Correct 1484 ms 77224 KB n = 199999
50 Correct 1417 ms 77156 KB n = 199991
51 Correct 1347 ms 77096 KB n = 199993
52 Correct 1032 ms 60392 KB n = 152076
53 Correct 482 ms 36752 KB n = 93249
54 Correct 1099 ms 64584 KB n = 199910
55 Correct 1061 ms 75088 KB n = 199999
56 Correct 1006 ms 65100 KB n = 199997
57 Correct 1055 ms 67544 KB n = 171294
58 Correct 863 ms 57120 KB n = 140872
59 Correct 1088 ms 65568 KB n = 199886
60 Correct 1000 ms 75540 KB n = 199996
61 Correct 951 ms 67420 KB n = 200000
62 Correct 955 ms 75048 KB n = 199998
63 Correct 971 ms 73980 KB n = 200000
64 Correct 994 ms 76496 KB n = 199998
65 Correct 1187 ms 77388 KB n = 200000
66 Correct 1042 ms 74272 KB n = 190000
67 Correct 1049 ms 70092 KB n = 177777
68 Correct 526 ms 38984 KB n = 100000
69 Correct 1129 ms 77184 KB n = 200000
70 Correct 1173 ms 77092 KB n = 200000
71 Correct 1258 ms 77036 KB n = 200000
72 Correct 1389 ms 77216 KB n = 200000
73 Correct 1440 ms 77256 KB n = 200000
74 Correct 1426 ms 77280 KB n = 200000
75 Correct 1125 ms 77136 KB n = 200000
76 Correct 1152 ms 77100 KB n = 200000
77 Correct 588 ms 45908 KB n = 200000
78 Correct 593 ms 45784 KB n = 200000
79 Correct 1350 ms 71980 KB n = 184307
80 Correct 440 ms 30748 KB n = 76040
81 Correct 1187 ms 65676 KB n = 199981
82 Correct 1097 ms 75476 KB n = 199994
83 Correct 1020 ms 67648 KB n = 199996
84 Correct 1020 ms 75156 KB n = 199998
85 Correct 1004 ms 74060 KB n = 200000
86 Correct 1004 ms 76368 KB n = 199998
87 Correct 1128 ms 77196 KB n = 200000
88 Correct 1190 ms 77144 KB n = 200000
89 Correct 1194 ms 77168 KB n = 200000
90 Correct 1144 ms 77136 KB n = 200000
91 Correct 1212 ms 77220 KB n = 200000
92 Correct 1389 ms 77148 KB n = 200000