oj.uz

Submission #284372

# Submission time Handle Problem Language Result Execution time Memory
284372 2020-08-27T09:44:25 Z Berted Wiring (IOI17_wiring) C++14
100 / 100
 52 ms 11292 KB 
#include "wiring.h"
#include <vector>
#include <stack>
#include <algorithm>
#include <assert.h>
#include <iostream>
#define ll long long
#define pii pair<int, int>
#define fst first
#define snd second

using namespace std;

const ll INF = 1e9 + 7, INF2 = 1e18 + 7;

vector<pii> A;
int C[200001];
ll dp[200001], pref[200001], nx[200001];

void get(bool t)
{
	stack<int> s;
	for (int i = 0; i < A.size(); i++)
	{
		if (A[i].snd == t) {s.push(i);}
		else if (s.size()) {nx[i + 1] = s.top(); s.pop();}
	}
}

ll min_total_length(vector<int> r, vector<int> b) 
{
	int i = 0, j = 0;
	while (i < r.size() || j < b.size())
	{
		int valL = (i < r.size()) ? r[i] : INF;
		int valR = (j < b.size()) ? b[j] : INF;
		if (valL < valR) 
		{
			A.push_back({valL, 0}); 
			C[A.size() - 1] = INF;
			if (j < b.size()) {C[A.size() - 1] = min(C[A.size() - 1], b[j] - valL);}
			if (j) {C[A.size() - 1] = min(C[A.size() - 1], valL - b[j - 1]);}
			i++;
		} 
		else 
		{
			A.push_back({valR, 1}); 
			C[A.size() - 1] = INF;
			if (i < r.size()) {C[A.size() - 1] = min(C[A.size() - 1], r[i] - valR);}
			if (i) {C[A.size() - 1] = min(C[A.size() - 1], valR - r[i - 1]);}
			j++;
		}
	} 
	for (i = 1; i <= A.size(); i++) 
	{
		nx[i] = -1;
		if (A[i - 1].snd) pref[i] = pref[i - 1] + A[i - 1].fst;
		else pref[i] = pref[i - 1] - A[i - 1].fst;
	}
	get(0); get(1);
	dp[0] = 0;
	for (i = 1; i <= A.size(); i++)
	{
		dp[i] = dp[i - 1] + C[i - 1];
		if (nx[i] != -1)
		{
			dp[i] = min(dp[i], dp[nx[i]] + ((A[i - 1].snd) ? (pref[i] - pref[nx[i]]) : (pref[nx[i]] - pref[i])) );
		}
		//cout << i << " " << " " << C[i - 1] << " " << dp[i] << " " << nx[i] << " " << pref[i] - pref[nx[i]] << "\n";
	}
	return dp[A.size()];
}

Compilation message

wiring.cpp: In function 'void get(bool)':
wiring.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int i = 0; i < A.size(); i++)
      |                  ~~^~~~~~~~~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:33:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  while (i < r.size() || j < b.size())
      |         ~~^~~~~~~~~~
wiring.cpp:33:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  while (i < r.size() || j < b.size())
      |                         ~~^~~~~~~~~~
wiring.cpp:35:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   int valL = (i < r.size()) ? r[i] : INF;
      |               ~~^~~~~~~~~~
wiring.cpp:36:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   int valR = (j < b.size()) ? b[j] : INF;
      |               ~~^~~~~~~~~~
wiring.cpp:41:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |    if (j < b.size()) {C[A.size() - 1] = min(C[A.size() - 1], b[j] - valL);}
      |        ~~^~~~~~~~~~
wiring.cpp:49:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |    if (i < r.size()) {C[A.size() - 1] = min(C[A.size() - 1], r[i] - valR);}
      |        ~~^~~~~~~~~~
wiring.cpp:54:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for (i = 1; i <= A.size(); i++)
      |              ~~^~~~~~~~~~~
wiring.cpp:62:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for (i = 1; i <= A.size(); i++)
      |              ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 35 ms 8680 KB Output is correct
4 Correct 34 ms 8680 KB Output is correct
5 Correct 35 ms 8688 KB Output is correct
6 Correct 45 ms 11240 KB Output is correct
7 Correct 46 ms 11240 KB Output is correct
8 Correct 47 ms 11240 KB Output is correct
9 Correct 45 ms 11240 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 52 ms 10488 KB Output is correct
4 Correct 43 ms 10600 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 48 ms 10984 KB Output is correct
19 Correct 47 ms 10984 KB Output is correct
20 Correct 47 ms 10984 KB Output is correct
21 Correct 47 ms 10984 KB Output is correct
22 Correct 48 ms 10984 KB Output is correct
23 Correct 48 ms 10984 KB Output is correct
24 Correct 46 ms 10984 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 51 ms 10344 KB Output is correct
3 Correct 47 ms 10344 KB Output is correct
4 Correct 40 ms 10344 KB Output is correct
5 Correct 39 ms 10344 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 38 ms 10484 KB Output is correct
19 Correct 40 ms 10472 KB Output is correct
20 Correct 38 ms 10344 KB Output is correct
21 Correct 38 ms 10344 KB Output is correct
22 Correct 38 ms 10472 KB Output is correct
23 Correct 40 ms 10600 KB Output is correct
24 Correct 37 ms 10472 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 35 ms 8680 KB Output is correct
20 Correct 34 ms 8680 KB Output is correct
21 Correct 35 ms 8688 KB Output is correct
22 Correct 45 ms 11240 KB Output is correct
23 Correct 46 ms 11240 KB Output is correct
24 Correct 47 ms 11240 KB Output is correct
25 Correct 45 ms 11240 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 52 ms 10488 KB Output is correct
29 Correct 43 ms 10600 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 48 ms 10984 KB Output is correct
44 Correct 47 ms 10984 KB Output is correct
45 Correct 47 ms 10984 KB Output is correct
46 Correct 47 ms 10984 KB Output is correct
47 Correct 48 ms 10984 KB Output is correct
48 Correct 48 ms 10984 KB Output is correct
49 Correct 46 ms 10984 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 51 ms 10344 KB Output is correct
52 Correct 47 ms 10344 KB Output is correct
53 Correct 40 ms 10344 KB Output is correct
54 Correct 39 ms 10344 KB Output is correct
55 Correct 0 ms 384 KB Output is correct
56 Correct 0 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 1 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 1 ms 384 KB Output is correct
67 Correct 38 ms 10484 KB Output is correct
68 Correct 40 ms 10472 KB Output is correct
69 Correct 38 ms 10344 KB Output is correct
70 Correct 38 ms 10344 KB Output is correct
71 Correct 38 ms 10472 KB Output is correct
72 Correct 40 ms 10600 KB Output is correct
73 Correct 37 ms 10472 KB Output is correct
74 Correct 45 ms 11240 KB Output is correct
75 Correct 41 ms 10984 KB Output is correct
76 Correct 46 ms 11112 KB Output is correct
77 Correct 40 ms 10600 KB Output is correct
78 Correct 39 ms 10564 KB Output is correct
79 Correct 40 ms 10608 KB Output is correct
80 Correct 39 ms 10600 KB Output is correct
81 Correct 40 ms 10728 KB Output is correct
82 Correct 40 ms 10728 KB Output is correct
83 Correct 45 ms 10856 KB Output is correct
84 Correct 45 ms 11240 KB Output is correct
85 Correct 46 ms 11240 KB Output is correct
86 Correct 46 ms 11112 KB Output is correct
87 Correct 52 ms 11108 KB Output is correct
88 Correct 45 ms 11112 KB Output is correct
89 Correct 45 ms 11112 KB Output is correct
90 Correct 47 ms 11112 KB Output is correct
91 Correct 44 ms 11240 KB Output is correct
92 Correct 46 ms 11116 KB Output is correct
93 Correct 47 ms 11144 KB Output is correct
94 Correct 50 ms 11240 KB Output is correct
95 Correct 46 ms 11116 KB Output is correct
96 Correct 48 ms 11240 KB Output is correct
97 Correct 45 ms 11292 KB Output is correct
98 Correct 45 ms 11240 KB Output is correct
99 Correct 46 ms 11276 KB Output is correct
100 Correct 45 ms 11112 KB Output is correct
101 Correct 46 ms 11244 KB Output is correct
102 Correct 50 ms 11112 KB Output is correct