oj.uz

Submission #101949

# Submission time Handle Problem Language Result Execution time Memory
101949 2019-03-21T07:33:21 Z daniel920712 Wiring (IOI17_wiring) C++14
7 / 100
 101 ms 3064 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);
    for(i=0;i<N;i++) ans+=abs(r[i]-b[0]);
    for(i=0;i<M;i++) ans+=abs(b[i]-r[0]);
    ans-=min(abs(b[0]-r[N-1]),abs(b[M-1]-r[0]));
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 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 2 ms 384 KB Output is correct
7 Correct 49 ms 3012 KB Output is correct
8 Correct 46 ms 2808 KB Output is correct
9 Correct 46 ms 2808 KB Output is correct
10 Correct 52 ms 2936 KB Output is correct
11 Correct 46 ms 2936 KB Output is correct
12 Correct 47 ms 2936 KB Output is correct
13 Correct 46 ms 2936 KB Output is correct
14 Correct 52 ms 3064 KB Output is correct
15 Correct 52 ms 2936 KB Output is correct
16 Correct 54 ms 2808 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 23 ms 1536 KB Output is correct
3 Incorrect 27 ms 1528 KB 3rd lines differ - on the 1st token, expected: '41596985758595', found: '74876785748649'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 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 2 ms 384 KB Output is correct
7 Correct 49 ms 3012 KB Output is correct
8 Correct 46 ms 2808 KB Output is correct
9 Correct 46 ms 2808 KB Output is correct
10 Correct 52 ms 2936 KB Output is correct
11 Correct 46 ms 2936 KB Output is correct
12 Correct 47 ms 2936 KB Output is correct
13 Correct 46 ms 2936 KB Output is correct
14 Correct 52 ms 3064 KB Output is correct
15 Correct 52 ms 2936 KB Output is correct
16 Correct 54 ms 2808 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 23 ms 1536 KB Output is correct
19 Incorrect 27 ms 1528 KB 3rd lines differ - on the 1st token, expected: '41596985758595', found: '74876785748649'
20 Halted 0 ms 0 KB -