oj.uz

답안 #434255

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434255 2021-06-20T19:47:58 Z healme 전선 연결 (IOI17_wiring) C++14
100 / 100
 37 ms 9252 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
#define pb push_back
void minn(int &a,int b){
    if(b<a) a=b;
}
void maxx(int &a,int b){
    if(b<a) a=b;
}
using ll =long long;
const int MAX=2e5+2,inf=2e9+4;
const ll oo=1e16;
using ll =long long;
int dp[2][MAX];
int F[MAX],D[MAX];
#undef int
long long min_total_length(std::vector<int> r, std::vector<int> b)
#define int long long
{
    int n=r.size(),m=b.size();
    r.pb(inf);b.pb(inf);
    bool tt=(r[0]>b[0]);
    int ans=0;
    int u=0,v=0;
    int cn=0;
    memset(F,0x3f,sizeof F);
    memset(dp,0x3f,sizeof dp);
    dp[!tt][0]=0;
    while(u!=n || v!=m){
        if(tt){
            int st=v;
            while(b[v]<r[u]) v++;
            int pre;
            if(u==0) pre=-inf;
            else pre=r[u-1];
            int res=0,pl=b[st]-pre;
            F[cn+1]=oo;
            for(int i=cn;i>=0;i--)
                F[i]=min(F[i+1]+pl,dp[!tt][i]);
            D[0]=dp[!tt][0];
            for(int i=1;i<=cn;i++)
                D[i]=min(D[i-1],dp[!tt][i]);
            for(int i=st;i<=v;i++){
                dp[tt][v-i]=res+min(F[i-st],D[min(i-st,cn)]);
                res+=b[i]-pre;
            }
            res=0;
            for(int i=v-1;i>=st;i--){
                res+=b[v-1]-b[i];
                dp[tt][v-i]+=res;

            }
            for(int i=v-st;i<=cn;i++) F[i]=D[i]=oo;
            cn=v-st;

        }
        else{
            int st=u;
            while(r[u]<b[v]) u++;
            int pre;
            if(v==0) pre=-inf;
            else pre=b[v-1];
            int res=0,pl=r[st]-pre;
            F[cn+1]=oo;
            for(int i=cn;i>=0;i--)
                F[i]=min(F[i+1]+pl,dp[!tt][i]);
            D[0]=dp[!tt][0];
            for(int i=1;i<=cn;i++)
                D[i]=min(D[i-1],dp[!tt][i]);
            for(int i=st;i<=u;i++){
                dp[tt][u-i]=res+min(F[i-st],D[min(i-st,cn)]);
                res+=r[i]-pre;
            }
            res=0;
            for(int i=u-1;i>=st;i--){
                res+=r[u-1]-r[i];
                dp[tt][u-i]+=res;
            }
            for(int i=u-st;i<=cn;i++) F[i]=D[i]=oo;
            cn=u-st;
        }
        //cout<<"ST "<<tt<<' '<<cn<<' '<<dp[tt][cn]<<'\n';
        //for(int i=0;i<=cn;i++) cout<<dp[tt][i]<<' ';cout<<'\n';

        tt^=1;
    }
    ans=dp[!tt][0];
	return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 26 ms 6848 KB Output is correct
4 Correct 27 ms 6912 KB Output is correct
5 Correct 35 ms 6448 KB Output is correct
6 Correct 32 ms 7216 KB Output is correct
7 Correct 32 ms 7348 KB Output is correct
8 Correct 33 ms 7348 KB Output is correct
9 Correct 33 ms 7220 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 33 ms 6448 KB Output is correct
4 Correct 30 ms 8096 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4920 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4908 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 33 ms 8384 KB Output is correct
19 Correct 33 ms 8492 KB Output is correct
20 Correct 34 ms 8480 KB Output is correct
21 Correct 34 ms 8480 KB Output is correct
22 Correct 34 ms 8476 KB Output is correct
23 Correct 33 ms 8480 KB Output is correct
24 Correct 33 ms 8476 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 29 ms 6564 KB Output is correct
3 Correct 28 ms 7692 KB Output is correct
4 Correct 30 ms 7828 KB Output is correct
5 Correct 32 ms 7712 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 28 ms 8108 KB Output is correct
19 Correct 27 ms 7728 KB Output is correct
20 Correct 28 ms 7708 KB Output is correct
21 Correct 28 ms 7972 KB Output is correct
22 Correct 28 ms 8380 KB Output is correct
23 Correct 27 ms 8480 KB Output is correct
24 Correct 28 ms 8372 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 2 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 2 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 2 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 26 ms 6848 KB Output is correct
20 Correct 27 ms 6912 KB Output is correct
21 Correct 35 ms 6448 KB Output is correct
22 Correct 32 ms 7216 KB Output is correct
23 Correct 32 ms 7348 KB Output is correct
24 Correct 33 ms 7348 KB Output is correct
25 Correct 33 ms 7220 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 33 ms 6448 KB Output is correct
29 Correct 30 ms 8096 KB Output is correct
30 Correct 3 ms 4940 KB Output is correct
31 Correct 3 ms 4920 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 3 ms 4940 KB Output is correct
36 Correct 3 ms 4908 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 3 ms 4940 KB Output is correct
40 Correct 3 ms 4940 KB Output is correct
41 Correct 3 ms 4940 KB Output is correct
42 Correct 3 ms 4940 KB Output is correct
43 Correct 33 ms 8384 KB Output is correct
44 Correct 33 ms 8492 KB Output is correct
45 Correct 34 ms 8480 KB Output is correct
46 Correct 34 ms 8480 KB Output is correct
47 Correct 34 ms 8476 KB Output is correct
48 Correct 33 ms 8480 KB Output is correct
49 Correct 33 ms 8476 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 29 ms 6564 KB Output is correct
52 Correct 28 ms 7692 KB Output is correct
53 Correct 30 ms 7828 KB Output is correct
54 Correct 32 ms 7712 KB Output is correct
55 Correct 3 ms 4940 KB Output is correct
56 Correct 3 ms 4940 KB Output is correct
57 Correct 3 ms 4940 KB Output is correct
58 Correct 3 ms 4940 KB Output is correct
59 Correct 3 ms 4940 KB Output is correct
60 Correct 3 ms 4940 KB Output is correct
61 Correct 3 ms 4940 KB Output is correct
62 Correct 3 ms 4940 KB Output is correct
63 Correct 3 ms 4940 KB Output is correct
64 Correct 3 ms 4940 KB Output is correct
65 Correct 3 ms 4940 KB Output is correct
66 Correct 3 ms 5068 KB Output is correct
67 Correct 28 ms 8108 KB Output is correct
68 Correct 27 ms 7728 KB Output is correct
69 Correct 28 ms 7708 KB Output is correct
70 Correct 28 ms 7972 KB Output is correct
71 Correct 28 ms 8380 KB Output is correct
72 Correct 27 ms 8480 KB Output is correct
73 Correct 28 ms 8372 KB Output is correct
74 Correct 33 ms 9180 KB Output is correct
75 Correct 30 ms 8432 KB Output is correct
76 Correct 35 ms 8924 KB Output is correct
77 Correct 29 ms 8372 KB Output is correct
78 Correct 28 ms 8380 KB Output is correct
79 Correct 29 ms 8364 KB Output is correct
80 Correct 28 ms 8348 KB Output is correct
81 Correct 30 ms 8604 KB Output is correct
82 Correct 29 ms 8608 KB Output is correct
83 Correct 31 ms 8740 KB Output is correct
84 Correct 32 ms 9140 KB Output is correct
85 Correct 32 ms 8736 KB Output is correct
86 Correct 32 ms 8992 KB Output is correct
87 Correct 33 ms 9000 KB Output is correct
88 Correct 32 ms 8884 KB Output is correct
89 Correct 34 ms 8860 KB Output is correct
90 Correct 37 ms 8860 KB Output is correct
91 Correct 34 ms 9124 KB Output is correct
92 Correct 33 ms 8960 KB Output is correct
93 Correct 32 ms 8996 KB Output is correct
94 Correct 33 ms 9020 KB Output is correct
95 Correct 35 ms 8868 KB Output is correct
96 Correct 32 ms 8992 KB Output is correct
97 Correct 34 ms 9252 KB Output is correct
98 Correct 32 ms 9120 KB Output is correct
99 Correct 34 ms 9148 KB Output is correct
100 Correct 34 ms 8996 KB Output is correct
101 Correct 34 ms 9120 KB Output is correct
102 Correct 33 ms 8996 KB Output is correct