oj.uz

Submission #878811

# Submission time Handle Problem Language Result Execution time Memory
878811 2023-11-25T09:16:57 Z junha1282 Wiring (IOI17_wiring) C++14
0 / 100
 38 ms 15052 KB 
#include "wiring.h"
#include <bits/stdc++.h>
 
using namespace std;
 
long long min_total_length(vector<int> s, vector<int> t) {
    int n = s.size(), m = t.size(), si = 0, ti = 0;
    
    vector<long long> ss(n+m+1), st(n+m+1), dp(n+m+1), c(2*n+2*m+2);
    vector<pair<long long, int>> v;
    v.push_back({-1, 0});
    for (int i = 0; i < n; i++) {
        v.push_back({s[i], 0});
    }
    for (int i = 0; i < m; i++) {
        v.push_back({t[i], 1});
    }
    sort(v.begin(), v.end());
    int x = n+m;
    for (int i = 1; i <= n+m; i++) {
        ss[i] = ss[i-1];
        st[i] = st[i-1];
        long long tmp = 0;
        if(v[i].second == 1){
            si = lower_bound(s.begin(), s.end(), v[i].first) - s.begin();
            if(si == (int)s.size()) si--;
            if(si > 0 && s[si] > v[i].first) si--;
            if(si < n-1) {
                tmp = min(abs(s[si] - v[i].first), abs(s[si+1] - v[i].first));
            } else {
                tmp = abs(s[si] - v[i].first);
            }
            x++;
            ss[i] += v[i].first;
        } else {
            ti = lower_bound(t.begin(), t.end(), v[i].first) - t.begin();
            if(ti == (int)t.size()) ti--;
            if(ti > 0 && t[ti] > v[i].first) ti--;
            if(ti < m-1) {
                tmp = min(abs(t[ti] - v[i].first), abs(t[ti+1] - v[i].first));
            } else {
                tmp = abs(t[ti] - v[i].first);
            }
            x--;
            st[i] += v[i].first;
        }
        if(c[x] != 0){
            dp[i] = min(dp[i-1] + tmp, dp[c[x]] + abs(ss[i] - ss[c[x]] + st[c[x]] - st[i]));
        } else {
            dp[i] = dp[i-1] + tmp;
        }
        c[x] = i;
    }
    return dp[n+m];
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 3rd lines differ - on the 1st token, expected: '25859', found: '25965'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 22 ms 12232 KB Output is correct
4 Correct 21 ms 11640 KB Output is correct
5 Incorrect 22 ms 12492 KB 3rd lines differ - on the 1st token, expected: '41752125325332', found: '41752125344522'
6 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '316', found: '324'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 32 ms 14284 KB Output is correct
3 Incorrect 38 ms 15052 KB 3rd lines differ - on the 1st token, expected: '1116068', found: '1116069'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 3rd lines differ - on the 1st token, expected: '25859', found: '25965'
2 Halted 0 ms 0 KB -