oj.uz

Submission #851187

# Submission time Handle Problem Language Result Execution time Memory
851187 2023-09-18T19:48:11 Z abcvuitunggio Wiring (IOI17_wiring) C++17
0 / 100
 33 ms 11356 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e15;
ll dp[200001],mn[200001],mn2[200001],val[200002],sum[200001];
pair <int, int> position[200001];
int id,cur[2],l,r,lo;
ll min_total_length(vector <int> a, vector <int> b){
    for (int i:a)
        position[++id]={i,0};
    for (int i:b)
        position[++id]={i,1};
    sort(position+1,position+id+1);
    for (int i=id;i;i--){
        val[i]=cur[position[i].second^1]-position[i].first;
        if (i<id&&position[i+1].second==position[i].second)
            val[i]+=val[i+1];
        if (position[i].second!=position[i-1].second)
            cur[position[i].second]=position[i].first;
    }
    for (int i=1;i<=id;i++)
        sum[i]=sum[i-1]+position[i].first;
    mn[0]=val[1];
    for (int i=1;i<=id;i++){
        dp[i]=INF;
        if (l){
          	if (l==r){
                dp[i]=dp[r]+sum[i]-sum[r]-position[r].first*(i-r);
                continue;
            }
            dp[i]=mn2[max(r*2-i,l-1)]+sum[i]-sum[r]-position[r].first*(i-r);
            if (i-r<r-l+1)
                dp[i]=min(dp[i],mn[r*2-i]-val[r*2-i+1]+sum[i]-sum[r]*2+sum[r*2-i]);
        }
        mn[i]=min(mn[i-1],dp[i]+val[i+1]);
        if (i==1||position[i-1].second!=position[i].second){
            lo=i;
            mn[i]=min(dp[i-1]+val[i],dp[i]+val[i+1]);
        }
        if (position[i].second!=position[i+1].second){
            l=lo;
            r=i;
            mn2[r]=INF;
            for (int i=r-1;i>=l-1;i--)
                mn2[i]=min(mn2[i+1],dp[i]+position[r].first*(r-i)-sum[r]+sum[i]);
        }
    }
	return dp[id];
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Incorrect 1 ms 6492 KB 3rd lines differ - on the 1st token, expected: '3123', found: '18701'
6 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 17 ms 10512 KB Output is correct
4 Correct 17 ms 10588 KB Output is correct
5 Incorrect 18 ms 10576 KB 3rd lines differ - on the 1st token, expected: '41752125325332', found: '58373648760852'
6 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Incorrect 33 ms 11140 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '100060029351069'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 29 ms 11348 KB Output is correct
3 Correct 31 ms 11344 KB Output is correct
4 Correct 31 ms 11156 KB Output is correct
5 Correct 31 ms 11356 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Incorrect 1 ms 6492 KB 3rd lines differ - on the 1st token, expected: '25', found: '101'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Incorrect 1 ms 6492 KB 3rd lines differ - on the 1st token, expected: '3123', found: '18701'
6 Halted 0 ms 0 KB -