oj.uz

Submission #829516

# Submission time Handle Problem Language Result Execution time Memory
829516 2023-08-18T11:52:08 Z bachhoangxuan Wiring (IOI17_wiring) C++17
7 / 100
 44 ms 10040 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
const ll inf=1e18;

ll dp[maxn],dist[maxn],pos[2],num[maxn];
pii p[maxn];

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    int n=0;p[0]={0,-1};
    for(int x:r) p[++n]={x,0};
    for(int x:b) p[++n]={x,1};
    sort(p+1,p+n+1);
    for(int i=1;i<=n;i++) dist[i]=inf;
    pos[0]=pos[1]=-1;
    for(int i=1;i<=n;i++){
        pos[p[i].se]=p[i].fi;
        if(pos[p[i].se^1]!=-1) dist[i]=min(dist[i],p[i].fi-pos[p[i].se^1]);
    }
    pos[0]=pos[1]=inf;
    for(int i=n;i>=1;i--){
        pos[p[i].se]=p[i].fi;
        if(pos[p[i].se^1]!=inf) dist[i]=min(dist[i],pos[p[i].se^1]-p[i].fi);
    }

    for(int i=1;i<=n;i++) p[i].fi+=p[i-1].fi;
    auto get = [&](int l,int r){
        return p[r].fi-p[l-1].fi;
    };

    dp[0]=0;
    for(int i=1;i<=n;i++){
        dp[i]=dp[i-1]+dist[i];
        if(p[i].se==p[i-1].se) num[i]=num[i-1]+1;
        else num[i]=1;
        if(num[i-num[i]]>=num[i]) dp[i]=min(dp[i],dp[i-2*num[i]]+get(i-num[i]+1,i)-get(i-2*num[i]+1,i-num[i]));
    }
    return dp[n];
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 17 ms 7540 KB 3rd lines differ - on the 1st token, expected: '41596985758595', found: '24911037813635'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Incorrect 35 ms 10040 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '-3225779673'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 31 ms 9284 KB Output is correct
3 Correct 32 ms 9324 KB Output is correct
4 Correct 32 ms 9348 KB Output is correct
5 Correct 44 ms 9316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 312 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Incorrect 32 ms 9316 KB 3rd lines differ - on the 1st token, expected: '2300170053', found: '-10300875628'
19 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Incorrect 17 ms 7540 KB 3rd lines differ - on the 1st token, expected: '41596985758595', found: '24911037813635'
20 Halted 0 ms 0 KB -