| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 969288 |
2024-04-24T21:50:59 Z |
mariaclara |
Wiring (IOI17_wiring) |
C++17 |
|
1000 ms |
14132 KB |
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const int INF = 1e9+10;
const ll LINF = 1e18+10;
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define mk make_pair
#define pb push_back
#define f first
#define s second
ll min_total_length(vector<int> r, vector<int> b) {
vector<pii> p;
r.pb(INF);
b.pb(INF);
p.pb({-1,-1});
for(int i = 0, j = 0; r[i] != b[j]; ) {
if(r[i] < b[j]) p.pb({r[i],0}), i++;
else p.pb({b[j],1}), j++;
}
int n = sz(p);
vector<ll> dp(n, LINF), v(n, 0), m(n, 0), prefix(n, 0);
dp[0] = 0;
for(int i = 1, last = -1, at = 1; i < n; i++) {
prefix[i] = prefix[i-1] + p[i].f;
if(p[i].s != p[i-1].s) last = at, at = i;
if(at == 1) continue;
for(int j = at-1; j >= last; j--) {
ll x = prefix[i] - prefix[at-1];
ll y = prefix[at-1] - prefix[j-1];
ll R = x - y;
if(i-at+1 >= at-j) R -= (i-at+1-at+j)*p[at-1].f;
else R += (at-j-i+at-1)*p[at].f;
dp[i] = min(dp[i], R+min(dp[j-1], dp[j]));
}
//cout << dp[i] << " " << at << " " << p[i].f << " " << p[i].s << "\n";
}
return dp[n-1];
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
600 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
344 KB |
Output is correct |
| 3 |
Execution timed out |
1090 ms |
9160 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
756 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
31 ms |
11176 KB |
Output is correct |
| 4 |
Correct |
24 ms |
13620 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
504 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
432 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
344 KB |
Output is correct |
| 17 |
Correct |
1 ms |
344 KB |
Output is correct |
| 18 |
Correct |
30 ms |
13184 KB |
Output is correct |
| 19 |
Correct |
24 ms |
14108 KB |
Output is correct |
| 20 |
Correct |
25 ms |
13120 KB |
Output is correct |
| 21 |
Correct |
24 ms |
13288 KB |
Output is correct |
| 22 |
Correct |
25 ms |
13160 KB |
Output is correct |
| 23 |
Correct |
25 ms |
13120 KB |
Output is correct |
| 24 |
Correct |
25 ms |
14132 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Execution timed out |
1088 ms |
12212 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
348 KB |
Output is correct |
| 16 |
Correct |
1 ms |
600 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
1 ms |
344 KB |
Output is correct |
| 19 |
Execution timed out |
1090 ms |
9160 KB |
Time limit exceeded |
| 20 |
Halted |
0 ms |
0 KB |
- |
