답안 #286640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286640	2020-08-30T15:54:46 Z	user202729	전선 연결 (IOI17_wiring)	C++17	100 / 100	63 ms	8696 KB

wiring

// moreflags=grader.cpp
//
// 13
// :(
#include "wiring.h"
#include<vector>
#if not LOCAL
#define NDEBUG
#endif
#include<cassert>
#include<climits>
#include<cstdint>
#include<algorithm>


struct Point{
	bool red; int pos;
	bool operator<(Point other) const{return pos<other.pos;}
};
template<bool type> struct Iterator
{
	using B=std::iterator<std::forward_iterator_tag, Point>;
#define F(N) using N=typename B::N
	F(iterator_category);
	F(value_type);
	F(difference_type);
	F(pointer);
	F(reference);
#undef F

	std::vector<int>::iterator iterator;
#define F(op) bool operator op (Iterator other) const{return iterator op other.iterator;}
	//F(<) F(>) 
	F(==) F(!=)
#undef F

	Iterator& operator++(){ ++iterator; return *this; }
	Point operator*() const{return {type, *iterator};}
}; // rust is nicer than this...

long long min_total_length(std::vector<int> red, std::vector<int> blue) {
	std::vector<Point> points;
	points.reserve(red.size()+blue.size());
	std::merge(
			Iterator<true>{red.begin()},
			Iterator<true>{red.end()},
			Iterator<false>{blue.begin()},
			Iterator<false>{blue.end()},
			std::back_inserter(points));
	assert(points.size()==red.size()+blue.size());

	std::vector<int64_t> sumSuffix(points.size()+1);
	for(auto [last, index]=std::pair((int64_t)0, points.size()); index--;){
		sumSuffix[index]=last+=points[index].pos;
	}
	// std::partial_sum
	
	std::vector<int64_t> result(points.size()+1, INT64_MAX);
	result[0]=0;

	auto const groupEnd=[&](int index){
		int result=index;
		while(result<(int)points.size() and points[result].red==points[index].red) ++result;
		return result;
	};
	int last=-1, next=groupEnd(0), next2=groupEnd(next);
	for(int index=0; index<(int)points.size(); ++index){
		if(index==next){
			last=index-1;
			next=next2; next2=groupEnd(next2);
		}
		auto const curResult=result[index];
		if(last>=0)
			result[index+1]=std::min(result[index+1], curResult+points[index].pos-points[last].pos);
		if(next<(int)points.size())
			result[index+1]=std::min(result[index+1], curResult+points[next].pos-points[index].pos);
		if(auto const block=next-index; next2-next>=block)
			result[next+block]=std::min(result[next+block], curResult
					+(sumSuffix[next]-sumSuffix[next+block])
					-(sumSuffix[index]-sumSuffix[next])
					);
	}

	return result[points.size()];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	30 ms	6392 KB	Output is correct
4	Correct	30 ms	6400 KB	Output is correct
5	Correct	31 ms	6392 KB	Output is correct
6	Correct	40 ms	8696 KB	Output is correct
7	Correct	42 ms	8444 KB	Output is correct
8	Correct	41 ms	8568 KB	Output is correct
9	Correct	40 ms	8552 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	43 ms	8440 KB	Output is correct
4	Correct	37 ms	8184 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	42 ms	8440 KB	Output is correct
19	Correct	42 ms	8568 KB	Output is correct
20	Correct	40 ms	8440 KB	Output is correct
21	Correct	43 ms	8440 KB	Output is correct
22	Correct	42 ms	8440 KB	Output is correct
23	Correct	41 ms	8532 KB	Output is correct
24	Correct	41 ms	8440 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	33 ms	7800 KB	Output is correct
3	Correct	41 ms	7808 KB	Output is correct
4	Correct	34 ms	7800 KB	Output is correct
5	Correct	34 ms	7800 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	32 ms	7800 KB	Output is correct
19	Correct	36 ms	7800 KB	Output is correct
20	Correct	33 ms	7800 KB	Output is correct
21	Correct	34 ms	7800 KB	Output is correct
22	Correct	33 ms	7808 KB	Output is correct
23	Correct	33 ms	7800 KB	Output is correct
24	Correct	34 ms	7800 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	30 ms	6392 KB	Output is correct
20	Correct	30 ms	6400 KB	Output is correct
21	Correct	31 ms	6392 KB	Output is correct
22	Correct	40 ms	8696 KB	Output is correct
23	Correct	42 ms	8444 KB	Output is correct
24	Correct	41 ms	8568 KB	Output is correct
25	Correct	40 ms	8552 KB	Output is correct
26	Correct	0 ms	256 KB	Output is correct
27	Correct	0 ms	256 KB	Output is correct
28	Correct	43 ms	8440 KB	Output is correct
29	Correct	37 ms	8184 KB	Output is correct
30	Correct	0 ms	256 KB	Output is correct
31	Correct	0 ms	256 KB	Output is correct
32	Correct	0 ms	256 KB	Output is correct
33	Correct	1 ms	256 KB	Output is correct
34	Correct	0 ms	256 KB	Output is correct
35	Correct	0 ms	256 KB	Output is correct
36	Correct	0 ms	256 KB	Output is correct
37	Correct	0 ms	256 KB	Output is correct
38	Correct	0 ms	256 KB	Output is correct
39	Correct	0 ms	256 KB	Output is correct
40	Correct	1 ms	256 KB	Output is correct
41	Correct	0 ms	256 KB	Output is correct
42	Correct	0 ms	256 KB	Output is correct
43	Correct	42 ms	8440 KB	Output is correct
44	Correct	42 ms	8568 KB	Output is correct
45	Correct	40 ms	8440 KB	Output is correct
46	Correct	43 ms	8440 KB	Output is correct
47	Correct	42 ms	8440 KB	Output is correct
48	Correct	41 ms	8532 KB	Output is correct
49	Correct	41 ms	8440 KB	Output is correct
50	Correct	0 ms	384 KB	Output is correct
51	Correct	33 ms	7800 KB	Output is correct
52	Correct	41 ms	7808 KB	Output is correct
53	Correct	34 ms	7800 KB	Output is correct
54	Correct	34 ms	7800 KB	Output is correct
55	Correct	0 ms	256 KB	Output is correct
56	Correct	1 ms	256 KB	Output is correct
57	Correct	1 ms	256 KB	Output is correct
58	Correct	1 ms	256 KB	Output is correct
59	Correct	1 ms	384 KB	Output is correct
60	Correct	0 ms	256 KB	Output is correct
61	Correct	0 ms	256 KB	Output is correct
62	Correct	1 ms	256 KB	Output is correct
63	Correct	1 ms	256 KB	Output is correct
64	Correct	1 ms	256 KB	Output is correct
65	Correct	1 ms	364 KB	Output is correct
66	Correct	1 ms	256 KB	Output is correct
67	Correct	32 ms	7800 KB	Output is correct
68	Correct	36 ms	7800 KB	Output is correct
69	Correct	33 ms	7800 KB	Output is correct
70	Correct	34 ms	7800 KB	Output is correct
71	Correct	33 ms	7808 KB	Output is correct
72	Correct	33 ms	7800 KB	Output is correct
73	Correct	34 ms	7800 KB	Output is correct
74	Correct	45 ms	8552 KB	Output is correct
75	Correct	37 ms	8172 KB	Output is correct
76	Correct	41 ms	8440 KB	Output is correct
77	Correct	47 ms	7928 KB	Output is correct
78	Correct	35 ms	7936 KB	Output is correct
79	Correct	36 ms	7928 KB	Output is correct
80	Correct	39 ms	7928 KB	Output is correct
81	Correct	36 ms	8056 KB	Output is correct
82	Correct	37 ms	7928 KB	Output is correct
83	Correct	46 ms	8184 KB	Output is correct
84	Correct	41 ms	8556 KB	Output is correct
85	Correct	44 ms	8440 KB	Output is correct
86	Correct	40 ms	8448 KB	Output is correct
87	Correct	63 ms	8440 KB	Output is correct
88	Correct	41 ms	8448 KB	Output is correct
89	Correct	49 ms	8440 KB	Output is correct
90	Correct	42 ms	8440 KB	Output is correct
91	Correct	41 ms	8440 KB	Output is correct
92	Correct	41 ms	8440 KB	Output is correct
93	Correct	41 ms	8440 KB	Output is correct
94	Correct	42 ms	8440 KB	Output is correct
95	Correct	41 ms	8440 KB	Output is correct
96	Correct	42 ms	8440 KB	Output is correct
97	Correct	41 ms	8440 KB	Output is correct
98	Correct	41 ms	8440 KB	Output is correct
99	Correct	41 ms	8440 KB	Output is correct
100	Correct	41 ms	8440 KB	Output is correct
101	Correct	40 ms	8568 KB	Output is correct
102	Correct	40 ms	8448 KB	Output is correct

답안 #286640

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 13.0 / 13.0

Subtask #3 10.0 / 10.0

Subtask #4 25.0 / 25.0

Subtask #5 45.0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
13.0 / 13.0

Subtask #3
10.0 / 10.0

Subtask #4
25.0 / 25.0

Subtask #5
45.0 / 45.0