oj.uz

답안 #764925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764925 2023-06-24T06:35:09 Z marvinthang 전선 연결 (IOI17_wiring) C++17
100 / 100
 36 ms 7100 KB 
/*************************************
*    author: marvinthang             *
*    created: 24.06.2023 11:57:30    *
*************************************/

#include "wiring.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int INF = 1e9 + 7;

long long min_total_length(vector <int> r, vector <int> b) {
	vector <pair <int, int>> p;
	p.emplace_back(-INF, 0);
	for (int x: r) p.emplace_back(x, 0);
	for (int x: b) p.emplace_back(x, 1);
	int n = (int) p.size() - 1;
	sort(ALL(p));
	p[0].se = p[1].se ^ 1;
	vector <long long> dp(n + 1, 1e18);
	dp[0] = 0;
	for (int cur = 1, nxt = 1, prv = 0; cur <= n; ) {
		while (nxt <= n && p[nxt].se == p[cur].se) ++nxt;
		FOR(i, prv, cur) minimize(dp[i], dp[i - 1] + p[cur].fi - p[i].fi);
		long long s = 0;
		for (int i = cur, j = cur - 1; i < nxt && j >= prv; ++i, --j) {
			s += p[i].fi - p[j].fi;
			minimize(dp[i], (j ? dp[j - 1] : 0) + s);
		}
		FOR(i, cur, nxt) minimize(dp[i], dp[i - 1] + p[i].fi - p[cur - 1].fi);
		prv = cur;
		cur = nxt;
	}
	return dp[n];
}

#ifdef LOCAL
#include "wiring.h"

#include <cassert>
#include <cstdio>

using namespace std;

int main() {
	file("wiring");
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> r(n), b(m);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));
	for(int i = 0; i < m; i++)
		assert(1 == scanf("%d", &b[i]));

	long long res = min_total_length(r, b);
	printf("%lld\n", res);
	
	return 0;
}
#endif

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 16 ms 3908 KB Output is correct
4 Correct 17 ms 5376 KB Output is correct
5 Correct 17 ms 5396 KB Output is correct
6 Correct 22 ms 6924 KB Output is correct
7 Correct 23 ms 7068 KB Output is correct
8 Correct 22 ms 6952 KB Output is correct
9 Correct 23 ms 7024 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 33 ms 5100 KB Output is correct
4 Correct 34 ms 6676 KB Output is correct
5 Correct 0 ms 212 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 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 300 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 33 ms 6940 KB Output is correct
19 Correct 32 ms 6940 KB Output is correct
20 Correct 35 ms 6972 KB Output is correct
21 Correct 33 ms 6948 KB Output is correct
22 Correct 34 ms 6944 KB Output is correct
23 Correct 35 ms 6944 KB Output is correct
24 Correct 33 ms 6972 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 24 ms 5104 KB Output is correct
3 Correct 29 ms 5148 KB Output is correct
4 Correct 25 ms 5040 KB Output is correct
5 Correct 27 ms 5096 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 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 23 ms 5016 KB Output is correct
19 Correct 27 ms 6332 KB Output is correct
20 Correct 27 ms 6284 KB Output is correct
21 Correct 28 ms 6304 KB Output is correct
22 Correct 26 ms 6340 KB Output is correct
23 Correct 25 ms 6300 KB Output is correct
24 Correct 26 ms 6296 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 16 ms 3908 KB Output is correct
20 Correct 17 ms 5376 KB Output is correct
21 Correct 17 ms 5396 KB Output is correct
22 Correct 22 ms 6924 KB Output is correct
23 Correct 23 ms 7068 KB Output is correct
24 Correct 22 ms 6952 KB Output is correct
25 Correct 23 ms 7024 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 33 ms 5100 KB Output is correct
29 Correct 34 ms 6676 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 300 KB Output is correct
37 Correct 0 ms 296 KB Output is correct
38 Correct 0 ms 304 KB Output is correct
39 Correct 1 ms 300 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 33 ms 6940 KB Output is correct
44 Correct 32 ms 6940 KB Output is correct
45 Correct 35 ms 6972 KB Output is correct
46 Correct 33 ms 6948 KB Output is correct
47 Correct 34 ms 6944 KB Output is correct
48 Correct 35 ms 6944 KB Output is correct
49 Correct 33 ms 6972 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 24 ms 5104 KB Output is correct
52 Correct 29 ms 5148 KB Output is correct
53 Correct 25 ms 5040 KB Output is correct
54 Correct 27 ms 5096 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 23 ms 5016 KB Output is correct
68 Correct 27 ms 6332 KB Output is correct
69 Correct 27 ms 6284 KB Output is correct
70 Correct 28 ms 6304 KB Output is correct
71 Correct 26 ms 6340 KB Output is correct
72 Correct 25 ms 6300 KB Output is correct
73 Correct 26 ms 6296 KB Output is correct
74 Correct 31 ms 6940 KB Output is correct
75 Correct 36 ms 6676 KB Output is correct
76 Correct 23 ms 6936 KB Output is correct
77 Correct 25 ms 6444 KB Output is correct
78 Correct 25 ms 6428 KB Output is correct
79 Correct 26 ms 6468 KB Output is correct
80 Correct 23 ms 6476 KB Output is correct
81 Correct 34 ms 6532 KB Output is correct
82 Correct 33 ms 6496 KB Output is correct
83 Correct 22 ms 6588 KB Output is correct
84 Correct 22 ms 7044 KB Output is correct
85 Correct 30 ms 6944 KB Output is correct
86 Correct 26 ms 6940 KB Output is correct
87 Correct 29 ms 6940 KB Output is correct
88 Correct 29 ms 6936 KB Output is correct
89 Correct 26 ms 6980 KB Output is correct
90 Correct 30 ms 7032 KB Output is correct
91 Correct 35 ms 6936 KB Output is correct
92 Correct 25 ms 6936 KB Output is correct
93 Correct 26 ms 6972 KB Output is correct
94 Correct 29 ms 6968 KB Output is correct
95 Correct 27 ms 6936 KB Output is correct
96 Correct 25 ms 6940 KB Output is correct
97 Correct 30 ms 6940 KB Output is correct
98 Correct 32 ms 7100 KB Output is correct
99 Correct 30 ms 6968 KB Output is correct
100 Correct 25 ms 6928 KB Output is correct
101 Correct 27 ms 6944 KB Output is correct
102 Correct 30 ms 6944 KB Output is correct