oj.uz

Submission #982163

# Submission time Handle Problem Language Result Execution time Memory
982163 2024-05-14T01:39:03 Z irmuun Wiring (IOI17_wiring) C++17
20 / 100
 154 ms 262144 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

ll min_total_length(vector<int>r,vector<int>b){
    ll ans=0,n=r.size(),m=b.size();
    if(r[n-1]<=b[0]){
        for(ll i=0;i<n-1;i++){
            ans+=(r[i+1]-r[i])*(i+1);
        }
        ll cur=0;
        for(ll i=m-1;i>=1;i--){
            ans+=(b[i]-b[i-1])*(++cur);
        }
        ans+=(b[0]-r[n-1])*max(n,m);
        return ans;
    }
    ll dp[n+5][m+5];
    for(ll i=0;i<=n;i++){
        for(ll j=0;j<=m;j++){
            if(i==0||j==0){
                if(i==0&&j==0) dp[i][j]=0;
                else dp[i][j]=1e18;
                continue;
            }
            dp[i][j]=min({dp[i-1][j],dp[i][j-1],dp[i-1][j-1]})+abs(r[i-1]-b[j-1]);
        }
    }
    return dp[n][m];
}

Subtask #1
7.0 / 7.0

# 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 12 ms 1372 KB Output is correct
4 Correct 12 ms 1372 KB Output is correct
5 Correct 12 ms 1372 KB Output is correct
6 Correct 17 ms 1884 KB Output is correct
7 Correct 16 ms 1996 KB Output is correct
8 Correct 16 ms 1884 KB Output is correct
9 Correct 17 ms 1884 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 154 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 138 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 12 ms 1372 KB Output is correct
20 Correct 12 ms 1372 KB Output is correct
21 Correct 12 ms 1372 KB Output is correct
22 Correct 17 ms 1884 KB Output is correct
23 Correct 16 ms 1996 KB Output is correct
24 Correct 16 ms 1884 KB Output is correct
25 Correct 17 ms 1884 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Runtime error 154 ms 262144 KB Execution killed with signal 9
29 Halted 0 ms 0 KB -