oj.uz

Submission #593181

# Submission time Handle Problem Language Result Execution time Memory
593181 2022-07-10T14:25:23 Z yutabi Wiring (IOI17_wiring) C++14
100 / 100
 53 ms 12824 KB 
#include "wiring.h"


#include <bits/stdc++.h>
using namespace std;


#define pb push_back


typedef long long ll;
typedef pair <ll,int> ii;




long long min_total_length(std::vector<int> r, std::vector<int> b)
{
	vector <ii> s;

	for(int i=0;i<r.size();i++)
	{
		s.pb(ii(r[i],0));
	}

	for(int i=0;i<b.size();i++)
	{
		s.pb(ii(b[i],1));
	}

	sort(s.begin(),s.end());

	vector <ll> L (s.size());
	vector <ll> R (s.size());

	int last_r=-1;
	int last_b=-1;

	for(int i=0;i<s.size();i++)
	{
		if(s[i].second==0)
		{
			last_r=s[i].first;

			L[i]=last_b;
		}

		else
		{
			last_b=s[i].first;

			L[i]=last_r;
		}
	}

	last_r=-1;
	last_b=-1;

	for(int i=s.size()-1;i>=0;i--)
	{
		if(s[i].second==0)
		{
			last_r=s[i].first;

			R[i]=last_b;
		}

		else
		{
			last_b=s[i].first;

			R[i]=last_r;
		}
	}

	vector <ll> extra_lines;

	priority_queue <ll> pq_b;
	priority_queue <ll> pq_r;

	int el_color=s[0].second;

	ll ans=0;

	int start;

	for(int i=0;s.size();i++)
	{
		if(s[i].second!=el_color)
		{
			for(int j=0;j<i-1;j++)
			{
				extra_lines.pb(s[i].first);
			}

			start=i+1;

			break;
		}

		ans+=R[i]-s[i].first;
	}

	//printf("%lld\n",ans);

	for(int i=start;i<s.size();i++)
	{
		if(el_color==s[i].second)
		{
			extra_lines.clear();
		}

		if(el_color!=s[i].second && extra_lines.size())
		{
			ans+=s[i].first-extra_lines.back();

			if(s[i].second==0)
			{
				pq_r.push(s[i].first-extra_lines.back()+s[i].first);
			}

			else
			{
				pq_b.push(s[i].first-extra_lines.back()+s[i].first);
			}

			extra_lines.pop_back();

			continue;
		}

		int taken=0;

		if(s[i].second==0)
		{
			if(pq_b.size())
			{
				ll num=pq_b.top();
				num-=s[i].first;

				pq_b.pop();

				if(num>-(s[i].first-L[i]))
				{
					taken++;

					ans-=num;

					if(num<0)
					{
						pq_r.push(-num+s[i].first);
					}
				}

				while(pq_b.size() && pq_b.top()-s[i].first>0)
				{
					num=pq_b.top();
					num-=s[i].first;

					pq_b.pop();

					ans-=num;

					el_color=1;

					extra_lines.pb(s[i].first);
				}
			}
		}

		else
		{
			if(pq_r.size())
			{
				ll num=pq_r.top();
				num-=s[i].first;

				pq_r.pop();

				if(num>-(s[i].first-L[i]))
				{
					taken++;

					ans-=num;

					if(num<0)
					{
						pq_b.push(-num+s[i].first);
					}
				}

				while(pq_r.size() && pq_r.top()-s[i].first>0)
				{
					num=pq_r.top();
					num-=s[i].first;

					pq_r.pop();

					ans-=num;

					el_color=0;

					extra_lines.pb(s[i].first);
				}
			}
		}

		if(taken==0)
		{
			ans+=s[i].first-L[i];

			if(s[i].second==0)
			{
				pq_r.push(s[i].first-L[i]+s[i].first);
			}

			else
			{
				pq_b.push(s[i].first-L[i]+s[i].first);
			}
		}

		//printf("%d %lld\n",i,ans);

		if(i==8)
		{
			//printf("\n%d %d %d %d %d\n\n",el_color,extra_lines.size(),pq_r.size(),pq_b.size(),L[8]);
		}
	}


	return ans;
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:21:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for(int i=0;i<r.size();i++)
      |              ~^~~~~~~~~
wiring.cpp:26:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for(int i=0;i<b.size();i++)
      |              ~^~~~~~~~~
wiring.cpp:39:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i=0;i<s.size();i++)
      |              ~^~~~~~~~~
wiring.cpp:106:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |  for(int i=start;i<s.size();i++)
      |                  ~^~~~~~~~~
wiring.cpp:106:18: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
  106 |  for(int i=start;i<s.size();i++)
      |                  ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 26 ms 8776 KB Output is correct
4 Correct 28 ms 8892 KB Output is correct
5 Correct 31 ms 9200 KB Output is correct
6 Correct 37 ms 11568 KB Output is correct
7 Correct 34 ms 11576 KB Output is correct
8 Correct 36 ms 11528 KB Output is correct
9 Correct 35 ms 11528 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 51 ms 10012 KB Output is correct
4 Correct 45 ms 9624 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 52 ms 10008 KB Output is correct
19 Correct 45 ms 10040 KB Output is correct
20 Correct 47 ms 10000 KB Output is correct
21 Correct 46 ms 10016 KB Output is correct
22 Correct 46 ms 10004 KB Output is correct
23 Correct 46 ms 10008 KB Output is correct
24 Correct 46 ms 10024 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 49 ms 10004 KB Output is correct
3 Correct 44 ms 9400 KB Output is correct
4 Correct 50 ms 9580 KB Output is correct
5 Correct 45 ms 9368 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 46 ms 10780 KB Output is correct
19 Correct 47 ms 9364 KB Output is correct
20 Correct 49 ms 9608 KB Output is correct
21 Correct 46 ms 10004 KB Output is correct
22 Correct 42 ms 11380 KB Output is correct
23 Correct 34 ms 11604 KB Output is correct
24 Correct 37 ms 11412 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 26 ms 8776 KB Output is correct
20 Correct 28 ms 8892 KB Output is correct
21 Correct 31 ms 9200 KB Output is correct
22 Correct 37 ms 11568 KB Output is correct
23 Correct 34 ms 11576 KB Output is correct
24 Correct 36 ms 11528 KB Output is correct
25 Correct 35 ms 11528 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 51 ms 10012 KB Output is correct
29 Correct 45 ms 9624 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 304 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 52 ms 10008 KB Output is correct
44 Correct 45 ms 10040 KB Output is correct
45 Correct 47 ms 10000 KB Output is correct
46 Correct 46 ms 10016 KB Output is correct
47 Correct 46 ms 10004 KB Output is correct
48 Correct 46 ms 10008 KB Output is correct
49 Correct 46 ms 10024 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 49 ms 10004 KB Output is correct
52 Correct 44 ms 9400 KB Output is correct
53 Correct 50 ms 9580 KB Output is correct
54 Correct 45 ms 9368 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 296 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 296 KB Output is correct
61 Correct 0 ms 300 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 300 KB Output is correct
67 Correct 46 ms 10780 KB Output is correct
68 Correct 47 ms 9364 KB Output is correct
69 Correct 49 ms 9608 KB Output is correct
70 Correct 46 ms 10004 KB Output is correct
71 Correct 42 ms 11380 KB Output is correct
72 Correct 34 ms 11604 KB Output is correct
73 Correct 37 ms 11412 KB Output is correct
74 Correct 38 ms 12312 KB Output is correct
75 Correct 51 ms 11580 KB Output is correct
76 Correct 45 ms 11936 KB Output is correct
77 Correct 48 ms 11156 KB Output is correct
78 Correct 46 ms 12052 KB Output is correct
79 Correct 47 ms 11352 KB Output is correct
80 Correct 38 ms 11576 KB Output is correct
81 Correct 43 ms 12464 KB Output is correct
82 Correct 35 ms 11788 KB Output is correct
83 Correct 36 ms 11928 KB Output is correct
84 Correct 36 ms 12440 KB Output is correct
85 Correct 47 ms 11804 KB Output is correct
86 Correct 41 ms 12088 KB Output is correct
87 Correct 40 ms 12216 KB Output is correct
88 Correct 45 ms 11416 KB Output is correct
89 Correct 47 ms 11476 KB Output is correct
90 Correct 53 ms 11772 KB Output is correct
91 Correct 42 ms 12312 KB Output is correct
92 Correct 46 ms 12440 KB Output is correct
93 Correct 42 ms 11548 KB Output is correct
94 Correct 52 ms 12312 KB Output is correct
95 Correct 49 ms 11576 KB Output is correct
96 Correct 38 ms 12236 KB Output is correct
97 Correct 39 ms 12472 KB Output is correct
98 Correct 44 ms 12184 KB Output is correct
99 Correct 41 ms 12188 KB Output is correct
100 Correct 53 ms 12824 KB Output is correct
101 Correct 41 ms 12316 KB Output is correct
102 Correct 49 ms 11544 KB Output is correct