oj.uz

Submission #683167

# Submission time Handle Problem Language Result Execution time Memory
683167 2023-01-17T21:17:49 Z cadmiumsky Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 584 ms 56592 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 5e5 + 5, inf = 1e9 + 5; 

vector<tii> edg;

namespace DSU {
  int dsu[nmax];
  void init(int n) {
    for(int i = 0; i <= n; i++)
      dsu[i] = i;
  }
  int f(int x) { return x == dsu[x]? x: dsu[x] = f(dsu[x]); }
  int cost(int a, int b, int w) {
    a = f(a);
    b = f(b);
    if(a == b) return 0;
    dsu[a] = b;
    return w;
  }
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
  t.emplace_back(0);
  s.emplace_back(inf);
  
  unordered_map<int,int> nrm;
  map<int,int> smen;
  for(auto x : s)
    smen[x]++;
  for(auto x : t)
    smen[x]--;
  
  int edgc = 0;
  int last = 0, cnt = 0;
  
  ll cost = 0;
  
  for(auto [a, b] : smen)  {
    nrm[a] = cnt++;
    if(edgc == 0) {
      //cerr << edgc << ' ' << a << ' ' << last << ' ' << cost << '+' << (a - last) * max(edgc, 0) << '\n';
      edg.emplace_back(nrm[last], nrm[a], a - last);
    }
    else {
      //cerr << edgc << ' ' << a << ' ' << last << ' ' << cost << '+' << (a - last) * max(edgc, 0) << '\t';
      cost += (ll)(a - last) * max(edgc, 0);
      //cerr << cost << '\n';
      edg.emplace_back(nrm[last], nrm[a], 0);                                                                                                                                                
    }
    edgc += b;
    last = a;
  }
  for(int i = 0; i < sz(s); i++)
    edg.emplace_back(nrm[s[i]], nrm[t[i]], 0);
  DSU::init(sz(nrm));
  sort(all(edg), [](auto a, auto b) { return get<2>(a) < get<2>(b); });
  for(auto [x, y, w] : edg) {
    //cerr << x <<  ' ' << y << ' ' << w << '\n';
    cost += DSU::cost(x, y, w);
  }
  return cost;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 312 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 304 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 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 312 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 304 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 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 1 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 304 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 308 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 1 ms 304 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 1 ms 308 KB n = 16
40 Correct 0 ms 304 KB n = 9
41 Correct 1 ms 304 KB n = 16
42 Correct 1 ms 308 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 0 ms 212 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 1 ms 308 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 567 ms 53684 KB n = 199999
2 Correct 566 ms 56476 KB n = 199991
3 Correct 575 ms 56444 KB n = 199993
4 Correct 375 ms 38304 KB n = 152076
5 Correct 194 ms 27048 KB n = 93249
6 Correct 404 ms 46792 KB n = 199910
7 Correct 525 ms 55108 KB n = 199999
8 Correct 409 ms 46992 KB n = 199997
9 Correct 440 ms 43076 KB n = 171294
10 Correct 369 ms 36000 KB n = 140872
11 Correct 419 ms 47320 KB n = 199886
12 Correct 529 ms 55320 KB n = 199996
13 Correct 431 ms 48408 KB n = 200000
14 Correct 541 ms 54948 KB n = 199998
15 Correct 499 ms 54408 KB n = 200000
16 Correct 558 ms 55788 KB n = 199998
17 Correct 469 ms 56456 KB n = 200000
18 Correct 537 ms 54756 KB n = 190000
19 Correct 419 ms 52332 KB n = 177777
20 Correct 207 ms 28292 KB n = 100000
21 Correct 546 ms 56592 KB n = 200000
22 Correct 534 ms 56456 KB n = 200000
23 Correct 533 ms 56476 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 0 ms 312 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 304 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 0 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 1 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 304 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 308 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 1 ms 304 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 1 ms 308 KB n = 16
40 Correct 0 ms 304 KB n = 9
41 Correct 1 ms 304 KB n = 16
42 Correct 1 ms 308 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 0 ms 212 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 1 ms 308 KB n = 16
49 Correct 567 ms 53684 KB n = 199999
50 Correct 566 ms 56476 KB n = 199991
51 Correct 575 ms 56444 KB n = 199993
52 Correct 375 ms 38304 KB n = 152076
53 Correct 194 ms 27048 KB n = 93249
54 Correct 404 ms 46792 KB n = 199910
55 Correct 525 ms 55108 KB n = 199999
56 Correct 409 ms 46992 KB n = 199997
57 Correct 440 ms 43076 KB n = 171294
58 Correct 369 ms 36000 KB n = 140872
59 Correct 419 ms 47320 KB n = 199886
60 Correct 529 ms 55320 KB n = 199996
61 Correct 431 ms 48408 KB n = 200000
62 Correct 541 ms 54948 KB n = 199998
63 Correct 499 ms 54408 KB n = 200000
64 Correct 558 ms 55788 KB n = 199998
65 Correct 469 ms 56456 KB n = 200000
66 Correct 537 ms 54756 KB n = 190000
67 Correct 419 ms 52332 KB n = 177777
68 Correct 207 ms 28292 KB n = 100000
69 Correct 546 ms 56592 KB n = 200000
70 Correct 534 ms 56456 KB n = 200000
71 Correct 533 ms 56476 KB n = 200000
72 Correct 559 ms 56532 KB n = 200000
73 Correct 576 ms 56520 KB n = 200000
74 Correct 566 ms 56472 KB n = 200000
75 Correct 470 ms 56500 KB n = 200000
76 Correct 481 ms 56568 KB n = 200000
77 Correct 302 ms 31932 KB n = 200000
78 Correct 305 ms 31836 KB n = 200000
79 Correct 507 ms 53320 KB n = 184307
80 Correct 137 ms 19512 KB n = 76040
81 Correct 397 ms 47272 KB n = 199981
82 Correct 570 ms 55304 KB n = 199994
83 Correct 441 ms 48452 KB n = 199996
84 Correct 528 ms 55060 KB n = 199998
85 Correct 539 ms 54472 KB n = 200000
86 Correct 565 ms 55836 KB n = 199998
87 Correct 493 ms 56576 KB n = 200000
88 Correct 584 ms 56468 KB n = 200000
89 Correct 491 ms 56500 KB n = 200000
90 Correct 572 ms 56492 KB n = 200000
91 Correct 565 ms 56540 KB n = 200000
92 Correct 538 ms 56440 KB n = 200000