oj.uz

Submission #101966

# Submission time Handle Problem Language Result Execution time Memory
101966 2019-03-21T07:58:57 Z daniel920712 Wiring (IOI17_wiring) C++14
20 / 100
 52 ms 2936 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <utility>
#include <vector>
#include "wiring.h"

using namespace std;
map < pair < int ,int > , long long > DP;
long long F(int N,int M,vector < int > &r,vector < int > &b)
{
    if(N==0&&M==0) return abs(r[N]-b[M]);
    else
    {
        if(DP.find(make_pair(N,M))!=DP.end()) return DP[make_pair(N,M)];
        long long t=abs(r[N]-b[M]),x=1e18;
        if(N) x=min(x,F(N-1,M,r,b));
        if(M) x=min(x,F(N,M-1,r,b));
        if(N&&M) x=min(x,F(N-1,M-1,r,b));
        //printf("%d %d %lld\n",N,M,t+x);
        DP[make_pair(N,M)]=t+x;
        return t+x;
    }
}
long long min_total_length(vector < int > r, vector < int > b)
{
    int N=r.size();
    int M=b.size();
    int i;
    long long ans=0;
    if(N<=200&&M<=200) return F(N-1,M-1,r,b);
    if(N<M)
    {
        for(i=0;i<N;i++) ans+=abs(r[i]-b[i]);
        for(i=N;i<M;i++) ans+=abs(r[N-1]-b[i]);
    }
    else
    {
        for(i=0;i<M;i++) ans+=abs(r[i]-b[i]);
        for(i=M;i<N;i++) ans+=abs(r[i]-b[0]);
    }
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 49 ms 2936 KB Output is correct
8 Correct 48 ms 2808 KB Output is correct
9 Correct 48 ms 2936 KB Output is correct
10 Correct 51 ms 2936 KB Output is correct
11 Correct 50 ms 2936 KB Output is correct
12 Correct 47 ms 2852 KB Output is correct
13 Correct 52 ms 2808 KB Output is correct
14 Correct 49 ms 2936 KB Output is correct
15 Correct 49 ms 2936 KB Output is correct
16 Correct 46 ms 2808 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 21 ms 1468 KB Output is correct
3 Correct 34 ms 1528 KB Output is correct
4 Correct 32 ms 1528 KB Output is correct
5 Correct 32 ms 1528 KB Output is correct
6 Correct 35 ms 2040 KB Output is correct
7 Correct 39 ms 1912 KB Output is correct
8 Correct 31 ms 1916 KB Output is correct
9 Correct 42 ms 1916 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 33 ms 1960 KB 3rd lines differ - on the 1st token, expected: '373710605', found: '2194335600'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 49 ms 2936 KB Output is correct
8 Correct 48 ms 2808 KB Output is correct
9 Correct 48 ms 2936 KB Output is correct
10 Correct 51 ms 2936 KB Output is correct
11 Correct 50 ms 2936 KB Output is correct
12 Correct 47 ms 2852 KB Output is correct
13 Correct 52 ms 2808 KB Output is correct
14 Correct 49 ms 2936 KB Output is correct
15 Correct 49 ms 2936 KB Output is correct
16 Correct 46 ms 2808 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 21 ms 1468 KB Output is correct
19 Correct 34 ms 1528 KB Output is correct
20 Correct 32 ms 1528 KB Output is correct
21 Correct 32 ms 1528 KB Output is correct
22 Correct 35 ms 2040 KB Output is correct
23 Correct 39 ms 1912 KB Output is correct
24 Correct 31 ms 1916 KB Output is correct
25 Correct 42 ms 1916 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Incorrect 37 ms 1912 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '304088397207'
29 Halted 0 ms 0 KB -