oj.uz

Submission #147933

# Submission time Handle Problem Language Result Execution time Memory
147933 2019-08-31T08:04:13 Z neki Wiring (IOI17_wiring) C++14
100 / 100
 84 ms 10908 KB 
#include <bits/stdc++.h>
#include "wiring.h"
#define maxn 100100
#define loop(i, a, b) for(int i=a;i<b;i++)
typedef long long ll;
 
using namespace std;
 
ll min(ll a, ll b) { return (a<b)? a:b;}
 
long long min_total_length (vector <int> red, vector <int> blue) {
  pair<ll, ll> com[maxn*2];ll n=red.size()+blue.size();
  loop(i, 0, red.size()) com[i]=make_pair(red[i], 1);
  loop(i, 0, blue.size()) com[i+red.size()]=make_pair(blue[i], -1);
  com[n]=make_pair(-1, 0);
  sort(com, com+n+1);sort(red.begin(), red.end());sort(blue.begin(), blue.end());
  ll dp[maxn*2], nek[maxn*2], ind[maxn*2], bal=maxn, dif=0;loop(i, 0, 2*maxn) nek[i]=LLONG_MAX/2;dp[0]=0, nek[maxn]=0;
  loop(i, 1, n+1){
    ll ma=LLONG_MAX/2;
    bal+=com[i].second;dif+=com[i].first * com[i].second;
    if(com[i].second==1){
      auto cl=lower_bound(blue.begin(), blue.end(), com[i].first);
      if(cl!=blue.end()) ma=min(ma, (*cl)-com[i].first);
      if(cl!=blue.begin()) ma=min(ma, com[i].first-(*prev(cl)));
    }
    else{
      auto cl=lower_bound(red.begin(), red.end(), com[i].first);
      if(cl!=red.end()) ma=min(ma, (*cl)-com[i].first);
      if(cl!=red.begin()) ma=min(ma, com[i].first-(*prev(cl)));
    }
    dp[i]=min(dp[i-1]+ma, abs(dif-nek[bal])+dp[ind[bal]]);
    nek[bal]=dif;ind[bal]=i;
  }
  return dp[n];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:4:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define loop(i, a, b) for(int i=a;i<b;i++)
wiring.cpp:13:8:
   loop(i, 0, red.size()) com[i]=make_pair(red[i], 1);
        ~~~~~~~~~~~~~~~~             
wiring.cpp:13:3: note: in expansion of macro 'loop'
   loop(i, 0, red.size()) com[i]=make_pair(red[i], 1);
   ^~~~
wiring.cpp:4:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define loop(i, a, b) for(int i=a;i<b;i++)
wiring.cpp:14:8:
   loop(i, 0, blue.size()) com[i+red.size()]=make_pair(blue[i], -1);
        ~~~~~~~~~~~~~~~~~            
wiring.cpp:14:3: note: in expansion of macro 'loop'
   loop(i, 0, blue.size()) com[i+red.size()]=make_pair(blue[i], -1);
   ^~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 58 ms 9560 KB Output is correct
4 Correct 59 ms 9592 KB Output is correct
5 Correct 58 ms 9592 KB Output is correct
6 Correct 76 ms 10876 KB Output is correct
7 Correct 78 ms 10864 KB Output is correct
8 Correct 80 ms 10872 KB Output is correct
9 Correct 77 ms 10908 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 79 ms 10092 KB Output is correct
4 Correct 76 ms 9692 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5084 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 78 ms 10104 KB Output is correct
19 Correct 78 ms 10104 KB Output is correct
20 Correct 80 ms 10104 KB Output is correct
21 Correct 79 ms 10064 KB Output is correct
22 Correct 81 ms 10232 KB Output is correct
23 Correct 75 ms 10232 KB Output is correct
24 Correct 77 ms 10104 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 58 ms 8440 KB Output is correct
3 Correct 72 ms 9464 KB Output is correct
4 Correct 75 ms 9592 KB Output is correct
5 Correct 68 ms 9436 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 7 ms 5116 KB Output is correct
11 Correct 7 ms 5116 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 7 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 70 ms 9720 KB Output is correct
19 Correct 72 ms 9464 KB Output is correct
20 Correct 69 ms 9464 KB Output is correct
21 Correct 76 ms 9592 KB Output is correct
22 Correct 69 ms 10104 KB Output is correct
23 Correct 61 ms 10232 KB Output is correct
24 Correct 57 ms 9976 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5008 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 4984 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5084 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 4984 KB Output is correct
18 Correct 6 ms 4984 KB Output is correct
19 Correct 58 ms 9560 KB Output is correct
20 Correct 59 ms 9592 KB Output is correct
21 Correct 58 ms 9592 KB Output is correct
22 Correct 76 ms 10876 KB Output is correct
23 Correct 78 ms 10864 KB Output is correct
24 Correct 80 ms 10872 KB Output is correct
25 Correct 77 ms 10908 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 4984 KB Output is correct
28 Correct 79 ms 10092 KB Output is correct
29 Correct 76 ms 9692 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 6 ms 5084 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 6 ms 4984 KB Output is correct
38 Correct 6 ms 5112 KB Output is correct
39 Correct 6 ms 4984 KB Output is correct
40 Correct 6 ms 5112 KB Output is correct
41 Correct 6 ms 4984 KB Output is correct
42 Correct 6 ms 4984 KB Output is correct
43 Correct 78 ms 10104 KB Output is correct
44 Correct 78 ms 10104 KB Output is correct
45 Correct 80 ms 10104 KB Output is correct
46 Correct 79 ms 10064 KB Output is correct
47 Correct 81 ms 10232 KB Output is correct
48 Correct 75 ms 10232 KB Output is correct
49 Correct 77 ms 10104 KB Output is correct
50 Correct 6 ms 4984 KB Output is correct
51 Correct 58 ms 8440 KB Output is correct
52 Correct 72 ms 9464 KB Output is correct
53 Correct 75 ms 9592 KB Output is correct
54 Correct 68 ms 9436 KB Output is correct
55 Correct 6 ms 5112 KB Output is correct
56 Correct 6 ms 5112 KB Output is correct
57 Correct 6 ms 5112 KB Output is correct
58 Correct 6 ms 5112 KB Output is correct
59 Correct 7 ms 5116 KB Output is correct
60 Correct 7 ms 5116 KB Output is correct
61 Correct 6 ms 4984 KB Output is correct
62 Correct 7 ms 5112 KB Output is correct
63 Correct 6 ms 5112 KB Output is correct
64 Correct 6 ms 5112 KB Output is correct
65 Correct 6 ms 5112 KB Output is correct
66 Correct 6 ms 5112 KB Output is correct
67 Correct 70 ms 9720 KB Output is correct
68 Correct 72 ms 9464 KB Output is correct
69 Correct 69 ms 9464 KB Output is correct
70 Correct 76 ms 9592 KB Output is correct
71 Correct 69 ms 10104 KB Output is correct
72 Correct 61 ms 10232 KB Output is correct
73 Correct 57 ms 9976 KB Output is correct
74 Correct 78 ms 10760 KB Output is correct
75 Correct 74 ms 10268 KB Output is correct
76 Correct 81 ms 10632 KB Output is correct
77 Correct 73 ms 10104 KB Output is correct
78 Correct 61 ms 10104 KB Output is correct
79 Correct 57 ms 10096 KB Output is correct
80 Correct 72 ms 10104 KB Output is correct
81 Correct 71 ms 10268 KB Output is correct
82 Correct 62 ms 10232 KB Output is correct
83 Correct 74 ms 10356 KB Output is correct
84 Correct 78 ms 10872 KB Output is correct
85 Correct 64 ms 10744 KB Output is correct
86 Correct 84 ms 10604 KB Output is correct
87 Correct 68 ms 10704 KB Output is correct
88 Correct 78 ms 10616 KB Output is correct
89 Correct 79 ms 10616 KB Output is correct
90 Correct 77 ms 10488 KB Output is correct
91 Correct 72 ms 10772 KB Output is correct
92 Correct 79 ms 10616 KB Output is correct
93 Correct 79 ms 10616 KB Output is correct
94 Correct 71 ms 10668 KB Output is correct
95 Correct 79 ms 10488 KB Output is correct
96 Correct 78 ms 10744 KB Output is correct
97 Correct 72 ms 10872 KB Output is correct
98 Correct 66 ms 10808 KB Output is correct
99 Correct 66 ms 10744 KB Output is correct
100 Correct 70 ms 10604 KB Output is correct
101 Correct 78 ms 10744 KB Output is correct
102 Correct 78 ms 10616 KB Output is correct