Submission #284383

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
284383	2020-08-27 10:09:48	DystoriaX	Wiring (IOI17_wiring)	C++14	13 / 100	61 ms	9964 KiB

wiring

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "wiring.h"
#include <algorithm>
#include <iostream>
#include <set>
 
using namespace std;
 
vector<pair<int, int> > v;
const long long INF = 1e17;
long long dp[200010], pref[200010];
int st[200010], en[200010];
 
long long min_total_length(std::vector<int> r, std::vector<int> b) {
  int n = r.size() + b.size();
  for(auto &k : r) v.emplace_back(k, 0);
  for(auto &k : b) v.emplace_back(k, 1);
 
  v.emplace_back(-1, -1);
  sort(v.begin(), v.end());
  
  st[1] = 1;
  for(int i = 2; i <= n; i++){
    if(v[i].second == v[i - 1].second) st[i] = st[i - 1];
    else st[i] = i;
  }
 
  en[n] = n;
  for(int i = n - 1; i >= 1; i--){
    if(v[i].second == v[i + 1].second) en[i] = en[i + 1];
    else en[i] = i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45