| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 103387 |
2019-03-30T06:05:58 Z |
RockyB |
Wiring (IOI17_wiring) |
C++17 |
|
6 ms |
3584 KB |
/// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)4e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
vector < pair <int, int > > t;
ll dp[N];
ll get(int l, int r) {
int n, m;
int id = -1;
rep(i, l, r - 1) {
if (t[i].s != t[i + 1].s) {
n = i - l + 1;
m = r - i;
id = i;
break;
}
}
if (id == -1) assert(0);
ll res = 0;
rep(i, l, id) res += t[id].f - t[i].f;
rep(i, id + 1, r) res += t[i].f - t[id + 1].f;
res += max(n, m) * (t[id + 1].f - t[id].f);
return res;
}
ll calc(int v = 0) {
if (v == sz(t)) return 0;
if (~dp[v]) return dp[v];
ll res = linf;
{ /// go to the left
bool ok = 0;
ll sum = t[v].f;
per(i, v - 1, 0) {
if (t[i].s != t[v].s) {
res = min(res, calc(v + 1) + sum - (ll)t[i].f * (v - i));
break;
}
sum += t[i].f;
}
}
{ /// go to the right
bool ok = 0;
rep(i, v + 1, sz(t) - 1) {
if (t[i].s != t[v].s) {
ok = 1;
res = min(res, calc(i + 1) + get(v, i));
}
else if (ok) break;
}
}
return dp[v] = res;
}
ll min_total_length(vector <int> _r, vector <int> _b) {
for (auto it : _r) t.pb({it, 0});
for (auto it : _b) t.pb({it, 1});
sort(all(t));
for (auto it : t) cerr << it.f << ' ' << it.s << nl;
cerr << nl;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
rep(i, 1, sz(t)) {
{ /// go to the left
ll sum = t[i - 1].f;
per(j, i - 1, 1) {
if (t[j - 1].s != t[i - 1].s) {
dp[i] = min(dp[i], dp[j - 1] + sum - (ll)t[j - 1].f * (i - j));
}
sum += t[j - 1].f;
}
}
{ /// go to the right
bool ok = 0;
rep(j, i + 1, sz(t)) {
if (t[j - 1].s != t[i - 1].s) {
dp[j] = min(dp[j], min(dp[i - 1], dp[i]) + get(i - 1, j - 1));
ok = 1;
}
else if (ok) break;
}
}
cerr << dp[i] << nl;
}
return dp[sz(t)];
}
#ifdef IOI2018
namespace read {
void read() {
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);
ioi
}
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
freopen ("slow.out", "w", stdout);
#endif
read :: read();
ioi
}
#endif
Compilation message
wiring.cpp: In function 'll calc(int)':
wiring.cpp:64:8: warning: unused variable 'ok' [-Wunused-variable]
bool ok = 0;
^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
3456 KB |
secret mismatch |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
3456 KB |
secret mismatch |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
3584 KB |
secret mismatch |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
3456 KB |
secret mismatch |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
3456 KB |
secret mismatch |
| 2 |
Halted |
0 ms |
0 KB |
- |
