oj.uz

답안 #121797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121797 2019-06-27T05:23:38 Z TuGSGeReL 전선 연결 (IOI17_wiring) C++14
100 / 100
 89 ms 7788 KB 
#include "wiring.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back()
#define ss second
#define ff first
#define mt make_tuple
#define pof pop_front()
#define fbo find_by_order
#define ook order_of_key
#define lb lower_bound
#define ub upper_bound

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
using pll = pair <ll, ll>;
using pii = pair <int, int>;

vector <ll> x, y;
ll dp[200002], z = -1, opt, k = 1, hd, st;

ll cost(vector <ll>& n, ll hed, vector <ll>& m ) {
	ll cst = 0;
	
	for (int i = hed; i < n.size() - 1; i++)
		cst += n.back() - n[i];
		
	for (int i = 1; i < m.size(); i++)
		cst += m[i] - m[0];
	
	cst += max((ll)n.size() - hed, (ll)m.size()) * (m[0] - n.back());
	
	return cst;
}

ll calc(vector <ll>& n, vector <ll>& m) {
	
	if ( dp[opt + hd] == 1e18 )
	{
		opt = 0;
		st = cost(n, 0, m);
	}

	while ( opt > 0 && min(dp[opt + hd], dp[opt + hd + 1]) > min(dp[opt + hd], dp[opt + hd - 1]) + n.back() - n[opt - 1] + (max((ll)n.size() - opt + 1ll, (ll)m.size()) - max((ll)n.size() - opt, (ll)m.size())) * (m[0] - n.back()) )
		st += n.back() - n[opt - 1] + (max((ll)n.size() - opt + 1ll, (ll)m.size()) - max((ll)n.size() - opt, (ll)m.size())) * (m[0] - n.back()), opt--;
	
	return st + min(dp[hd + opt + 1], dp[hd + opt]);
}

long long min_total_length(vector<int> r, vector<int> b) {
	int i = 0, j = 0;
	
	for (int i1 = 1; i1 <= r.size() + b.size(); i1++)
		dp[i1] = 1e18;
	
	while ( i < r.size() || j < b.size() ) {
		
		if ( i != r.size() && (j == b.size() || r[i] < b[j]) ) {

			if ( z == -1 ) {
				y.pub(r[i]);
			} else {
				if ( z == 1 )
				{
					hd += x.size();
					x = y;
					y.clear();
					y.pub(r[i]);
					
					if ( x.size() )
					{
						opt = x.size() - 1;
						st = cost(x, opt, y);
						dp[k] = calc(x, y);
					}
				} else {
					y.pub(r[i]);
	
					if ( x.size() )
					{
						st -= (max((ll)y.size() - 1ll, (ll)x.size() - opt) - max((ll)y.size(), (ll)x.size() - opt)) * (y[0] - x.back()) - y.back() + y[0];
						dp[k] = calc(x, y);
					}
				}
			}
			i++;
			z = 0;
		} else {
			if ( z == -1 ) {
				y.pub(b[j]);
			} else {
				if ( z == 0 ) {
					hd += x.size();
					x = y;
					y.clear();
					y.pub(b[j]);
					
					if ( x.size() )
					{
						opt = x.size() - 1;
						st = cost(x, opt, y);
						dp[k] = calc(x, y);
					}
				} else {
					y.pub(b[j]);
					if ( x.size() )
					{
						st -= (max((ll)y.size() - 1ll, (ll)x.size() - opt) - max((ll)y.size(), (ll)x.size() - opt)) * (y[0] - x.back()) - y.back() + y[0];
						dp[k] = calc(x, y);
					}
				}
			}
			z = 1;
			j++;
		}
		k++;
	}
	
	return dp[r.size() + b.size()];
}

Compilation message

wiring.cpp: In function 'long long int cost(std::vector<long long int>&, long long int, std::vector<long long int>&)':
wiring.cpp:31:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = hed; i < n.size() - 1; i++)
                    ~~^~~~~~~~~~~~~~
wiring.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < m.size(); i++)
                  ~~^~~~~~~~~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:59:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i1 = 1; i1 <= r.size() + b.size(); i1++)
                   ~~~^~~~~~~~~~~~~~~~~~~~~~
wiring.cpp:62:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while ( i < r.size() || j < b.size() ) {
          ~~^~~~~~~~~~
wiring.cpp:62:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while ( i < r.size() || j < b.size() ) {
                          ~~^~~~~~~~~~
wiring.cpp:64:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if ( i != r.size() && (j == b.size() || r[i] < b[j]) ) {
        ~~^~~~~~~~~~~
wiring.cpp:64:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if ( i != r.size() && (j == b.size() || r[i] < b[j]) ) {
                          ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 27 ms 4340 KB Output is correct
4 Correct 28 ms 5868 KB Output is correct
5 Correct 28 ms 5616 KB Output is correct
6 Correct 35 ms 7148 KB Output is correct
7 Correct 37 ms 7192 KB Output is correct
8 Correct 35 ms 7020 KB Output is correct
9 Correct 36 ms 7196 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 35 ms 3448 KB Output is correct
4 Correct 32 ms 3448 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 35 ms 3452 KB Output is correct
19 Correct 35 ms 3448 KB Output is correct
20 Correct 34 ms 3448 KB Output is correct
21 Correct 89 ms 3448 KB Output is correct
22 Correct 34 ms 3448 KB Output is correct
23 Correct 35 ms 3448 KB Output is correct
24 Correct 37 ms 3456 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 27 ms 3704 KB Output is correct
3 Correct 28 ms 3448 KB Output is correct
4 Correct 27 ms 3576 KB Output is correct
5 Correct 28 ms 3456 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 29 ms 4208 KB Output is correct
19 Correct 30 ms 4856 KB Output is correct
20 Correct 28 ms 4984 KB Output is correct
21 Correct 28 ms 5236 KB Output is correct
22 Correct 29 ms 6556 KB Output is correct
23 Correct 29 ms 6260 KB Output is correct
24 Correct 30 ms 6508 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 27 ms 4340 KB Output is correct
20 Correct 28 ms 5868 KB Output is correct
21 Correct 28 ms 5616 KB Output is correct
22 Correct 35 ms 7148 KB Output is correct
23 Correct 37 ms 7192 KB Output is correct
24 Correct 35 ms 7020 KB Output is correct
25 Correct 36 ms 7196 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 35 ms 3448 KB Output is correct
29 Correct 32 ms 3448 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 3 ms 256 KB Output is correct
42 Correct 2 ms 384 KB Output is correct
43 Correct 35 ms 3452 KB Output is correct
44 Correct 35 ms 3448 KB Output is correct
45 Correct 34 ms 3448 KB Output is correct
46 Correct 89 ms 3448 KB Output is correct
47 Correct 34 ms 3448 KB Output is correct
48 Correct 35 ms 3448 KB Output is correct
49 Correct 37 ms 3456 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 27 ms 3704 KB Output is correct
52 Correct 28 ms 3448 KB Output is correct
53 Correct 27 ms 3576 KB Output is correct
54 Correct 28 ms 3456 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 256 KB Output is correct
58 Correct 2 ms 256 KB Output is correct
59 Correct 2 ms 384 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 2 ms 384 KB Output is correct
64 Correct 2 ms 256 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 29 ms 4208 KB Output is correct
68 Correct 30 ms 4856 KB Output is correct
69 Correct 28 ms 4984 KB Output is correct
70 Correct 28 ms 5236 KB Output is correct
71 Correct 29 ms 6556 KB Output is correct
72 Correct 29 ms 6260 KB Output is correct
73 Correct 30 ms 6508 KB Output is correct
74 Correct 35 ms 6892 KB Output is correct
75 Correct 32 ms 6384 KB Output is correct
76 Correct 35 ms 6564 KB Output is correct
77 Correct 32 ms 6340 KB Output is correct
78 Correct 31 ms 6512 KB Output is correct
79 Correct 31 ms 6000 KB Output is correct
80 Correct 31 ms 6100 KB Output is correct
81 Correct 31 ms 6512 KB Output is correct
82 Correct 30 ms 6396 KB Output is correct
83 Correct 31 ms 6632 KB Output is correct
84 Correct 56 ms 7068 KB Output is correct
85 Correct 37 ms 6524 KB Output is correct
86 Correct 36 ms 7024 KB Output is correct
87 Correct 35 ms 6644 KB Output is correct
88 Correct 36 ms 6384 KB Output is correct
89 Correct 37 ms 6996 KB Output is correct
90 Correct 41 ms 7092 KB Output is correct
91 Correct 35 ms 6892 KB Output is correct
92 Correct 36 ms 7004 KB Output is correct
93 Correct 35 ms 6640 KB Output is correct
94 Correct 36 ms 7276 KB Output is correct
95 Correct 35 ms 6512 KB Output is correct
96 Correct 35 ms 6948 KB Output is correct
97 Correct 36 ms 7788 KB Output is correct
98 Correct 35 ms 7404 KB Output is correct
99 Correct 35 ms 7404 KB Output is correct
100 Correct 35 ms 7152 KB Output is correct
101 Correct 36 ms 6892 KB Output is correct
102 Correct 35 ms 6640 KB Output is correct