oj.uz

Submission #133846

# Submission time Handle Problem Language Result Execution time Memory
133846 2019-07-21T14:15:40 Z MetB Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 939 ms 46492 KB 
#include <algorithm>
#include <iostream>
#include <string.h>
#include <cstdlib>
#include <vector>
#include <string>
#include <bitset>
#include <math.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
 
typedef long long ll;
typedef long double ld;
 
const ll MOD = 1e9 + 7, INF = 1e18 + 1;
 
using namespace std;
 
int p[1000000], sz[1000000];
 
set <int> mp;
 
struct stop
{
	int x;
	bool op;
 
	bool operator < (const stop& b)
	{
		if (x == b.x) return op > b.op;
		else return x < b.x;
	}
};
 
struct edge
{
	int u, v;
	ll c;
 
	bool operator < (const edge& b)
	{
		return c < b.c;
	}
};
 
vector <stop> v;
 
int find (int x)
{
	if (p[x] == x) return x;
	else return p[x] = find (p[x]);
}
 
void unite (int a, int b)
{
	a = find (a);
	b = find (b);
 
	if (a == b) return;
 
	if (sz[a] < sz[b]) swap (a, b);
 
	p[b] = a;
 
	sz[a] += sz[b];
}
 
int ind (int a, vector <int>& s)
{
	return lower_bound (s.begin(), s.end(), a) - s.begin ();
}
 
ll plan_roller_coaster (vector <int> s, vector <int> t)
{
	ll ans = 0, balance = 0;

	s.push_back (1e9);
	t.push_back (1);
 
	vector <int> coord;
 
	for (int i = 0; i < s.size (); i++)
	{
		v.push_back ({s[i], true});
		v.push_back ({t[i], false});
 
		mp.insert (s[i]);
		mp.insert (t[i]);
	}
 
	for (auto a : mp)
		coord.push_back (a);
 
	for (int i = 0; i < coord.size (); i++)
	{
		sz[i] = 1;
		p[i] = i;
	}
 
	for (int i = 0; i < s.size (); i++)
		unite (ind (s[i], coord), ind (t[i], coord));
 
	sort (v.begin(), v.end());
 
	vector <edge> tr;
 
	for (int i = 0; i < v.size (); i++)
	{
		if (v[i].op) balance++;
		else balance--;
 
		if (i != v.size () - 1) 
		{
			ans += max (0LL, balance * 1LL * (v[i+1].x - v[i].x));
			if (balance != 0) unite (ind (v[i].x, coord), ind (v[i+1].x, coord));
			tr.push_back ({ind (v[i].x, coord), ind (v[i+1].x, coord), (v[i+1].x - v[i].x)});
		}
	}
 
	sort (tr.begin(), tr.end());
 
	for (edge e : tr)
	{
		if (find (e.u) != find (e.v))
		{
			ans += e.c;
			unite (e.u, e.v);
		}
	}
 
	return ans;
}

Compilation message

railroad.cpp: In function 'll plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:84:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.size (); i++)
                  ~~^~~~~~~~~~~
railroad.cpp:96:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < coord.size (); i++)
                  ~~^~~~~~~~~~~~~~~
railroad.cpp:102:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.size (); i++)
                  ~~^~~~~~~~~~~
railroad.cpp:109:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size (); i++)
                  ~~^~~~~~~~~~~
railroad.cpp:114:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (i != v.size () - 1) 
       ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 939 ms 43456 KB n = 199999
2 Correct 771 ms 43488 KB n = 199991
3 Correct 801 ms 43412 KB n = 199993
4 Correct 539 ms 35924 KB n = 152076
5 Correct 316 ms 20924 KB n = 93249
6 Correct 636 ms 38876 KB n = 199910
7 Correct 694 ms 43008 KB n = 199999
8 Correct 606 ms 39168 KB n = 199997
9 Correct 619 ms 39216 KB n = 171294
10 Correct 522 ms 34368 KB n = 140872
11 Correct 644 ms 39220 KB n = 199886
12 Correct 658 ms 44836 KB n = 199996
13 Correct 613 ms 42056 KB n = 200000
14 Correct 610 ms 44828 KB n = 199998
15 Correct 602 ms 44392 KB n = 200000
16 Correct 639 ms 44884 KB n = 199998
17 Correct 705 ms 45008 KB n = 200000
18 Correct 687 ms 43532 KB n = 190000
19 Correct 611 ms 41728 KB n = 177777
20 Correct 309 ms 23392 KB n = 100000
21 Correct 713 ms 45156 KB n = 200000
22 Correct 711 ms 45136 KB n = 200000
23 Correct 787 ms 46296 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB n = 2
2 Correct 2 ms 376 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 376 KB n = 2
5 Correct 2 ms 252 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 380 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 376 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 2 ms 376 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 376 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 2 ms 376 KB n = 8
25 Correct 2 ms 376 KB n = 8
26 Correct 2 ms 376 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 368 KB n = 8
29 Correct 2 ms 376 KB n = 16
30 Correct 2 ms 376 KB n = 16
31 Correct 2 ms 380 KB n = 16
32 Correct 3 ms 404 KB n = 16
33 Correct 2 ms 376 KB n = 16
34 Correct 2 ms 376 KB n = 16
35 Correct 2 ms 364 KB n = 16
36 Correct 2 ms 380 KB n = 15
37 Correct 2 ms 376 KB n = 8
38 Correct 2 ms 380 KB n = 16
39 Correct 2 ms 376 KB n = 16
40 Correct 2 ms 376 KB n = 9
41 Correct 2 ms 376 KB n = 16
42 Correct 2 ms 376 KB n = 16
43 Correct 2 ms 376 KB n = 16
44 Correct 2 ms 376 KB n = 9
45 Correct 2 ms 376 KB n = 15
46 Correct 2 ms 376 KB n = 16
47 Correct 2 ms 376 KB n = 16
48 Correct 2 ms 376 KB n = 16
49 Correct 939 ms 43456 KB n = 199999
50 Correct 771 ms 43488 KB n = 199991
51 Correct 801 ms 43412 KB n = 199993
52 Correct 539 ms 35924 KB n = 152076
53 Correct 316 ms 20924 KB n = 93249
54 Correct 636 ms 38876 KB n = 199910
55 Correct 694 ms 43008 KB n = 199999
56 Correct 606 ms 39168 KB n = 199997
57 Correct 619 ms 39216 KB n = 171294
58 Correct 522 ms 34368 KB n = 140872
59 Correct 644 ms 39220 KB n = 199886
60 Correct 658 ms 44836 KB n = 199996
61 Correct 613 ms 42056 KB n = 200000
62 Correct 610 ms 44828 KB n = 199998
63 Correct 602 ms 44392 KB n = 200000
64 Correct 639 ms 44884 KB n = 199998
65 Correct 705 ms 45008 KB n = 200000
66 Correct 687 ms 43532 KB n = 190000
67 Correct 611 ms 41728 KB n = 177777
68 Correct 309 ms 23392 KB n = 100000
69 Correct 713 ms 45156 KB n = 200000
70 Correct 711 ms 45136 KB n = 200000
71 Correct 787 ms 46296 KB n = 200000
72 Correct 787 ms 46408 KB n = 200000
73 Correct 776 ms 46476 KB n = 200000
74 Correct 750 ms 46416 KB n = 200000
75 Correct 712 ms 46244 KB n = 200000
76 Correct 680 ms 46288 KB n = 200000
77 Correct 477 ms 34640 KB n = 200000
78 Correct 476 ms 34676 KB n = 200000
79 Correct 691 ms 43728 KB n = 184307
80 Correct 235 ms 19416 KB n = 76040
81 Correct 674 ms 41316 KB n = 199981
82 Correct 783 ms 45256 KB n = 199994
83 Correct 602 ms 42084 KB n = 199996
84 Correct 595 ms 45136 KB n = 199998
85 Correct 597 ms 44624 KB n = 200000
86 Correct 616 ms 45760 KB n = 199998
87 Correct 679 ms 46296 KB n = 200000
88 Correct 719 ms 46420 KB n = 200000
89 Correct 696 ms 46288 KB n = 200000
90 Correct 697 ms 46492 KB n = 200000
91 Correct 681 ms 46340 KB n = 200000
92 Correct 747 ms 46484 KB n = 200000