oj.uz

답안 #858343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858343 2023-10-08T08:10:18 Z onepunchac168 전선 연결 (IOI17_wiring) C++14
100 / 100
 50 ms 11240 KB 
//------------------------------------\\
//   ------------------------------   \\
//  |  created by Dinh Manh Hung   |  \\
//  |      tht.onepunchac168       |  \\
//  |     THPT CHUYEN HA TINH      |  \\
//  |      HA TINH, VIET NAM       |  \\
//  |           Siuuu              |  \\
//   ------------------------------   \\
//------------------------------------\\

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

#define            task     ""
#define       file(name)    if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define             ldb     long double
#define              pb     push_back
#define              eb     emplace_back
#define              fi     first
#define              se     second
#define           all(x)    begin(x),end(x)
#define       uniquev(v)    v.resize(unique(all(v))-v.begin())
#define       rep(i,a,b)    for (int i=a;i<=b;i++)
#define        cntbit(v)    __builtin_popcountll(v)
#define         gcd(a,b)    __gcd(a,b)
#define         lcm(a,b)    ((1LL*a*b)/__gcd(a,b))
#define          mask(x)    (1LL<<(x))
#define     readbit(x,i)    ((x>>i)&1)
#define             Yes     cout << "Yes"
#define             YES     cout << "YES"
#define              No     cout << "No"
#define              NO     cout << "NO"

typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
typedef pair <ii,ii> iiii;

ll dx[]= {1,-1,0,0,1,-1,1,-1};
ll dy[]= {0,0,-1,1,1,-1,-1,1};

const ldb PI = acos (-1);
//const ll mod=978846151;
//const ll base=29;
const ll mod=1e9+7;
const char nl = '\n';

inline int ReadInt()
{
    char co;
    for (co = getchar(); co < '0' || co > '9'; co = getchar());
    int xo = co - '0';
    for (co = getchar(); co >= '0' && co <= '9'; co = getchar())
        xo = (xo<<1) + (xo<<3) + co - '0';
    return xo;
}

void WriteInt(int xo)
{
    if (xo > 9)
        WriteInt(xo / 10);
    putchar(xo % 10 + '0');
}

// DEBUG
/*
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
*/

/* END OF TEMPLATE*/

// ================= Solution =================//

/*
void onepunchac168();

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    file(task);
    int tests;
    tests=1;
    //cin>>tests;
    while (tests--)
    {
        onepunchac168();
    }
}

const int N=2e5+5;

void onepunchac168()
{

}
// goodbye see ya

*/

const int N=2e5+5;
vector <ii> vt;
ll sum[N];
ll dp[N];
int n;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
    for (auto v:r)
    {
        vt.pb({v,0});
    }
    for (auto v:b)
    {
        vt.pb({v,1});
    }
    vt.pb({-1e18-5,0});
    n=vt.size()-1;
    sort (vt.begin(),vt.end());
    ll dem=0;
    for (int i=1;i<=n;i++)
    {
        sum[i]=sum[i-1]+vt[i].fi;
    }
    for (int i=1;i<=n;i++)
    {
        dp[i]=1e18+5;
    }
    dp[0]=0;
    for (int i=1;i<=n;i++)
    {
        dem++;
        if (i==n||vt[i].se!=vt[i+1].se)
        {
            ll left=i-dem+1;
            if (left==1)
            {

            }
            else
            {
                int l1,r1;
                r1=left-1;
                l1=r1;
                for (int j=r1-1;j>=1;j--)
                {
                    if (vt[j].se==vt[r1].se)
                    {
                        l1=j;
                        continue;
                    }
                    break;
                }
                int pos=l1;
                ll gmin=dp[l1-1];
                for (int j=i;j>=left;j--)
                {
                    while (pos <= r1 && r1-pos+1>j-left+1)
                    {
                        gmin=min(gmin+vt[left].fi-vt[pos].fi,dp[pos]);
                        pos++;
                    }
                    if (j-left+1<=r1-l1+1)
                    {
                        ll cost=sum[j]-sum[left-1]-(sum[left-1]-sum[2*left-j-2]);
                        dp[j]=min(dp[j],gmin+cost);
                    }
                }
                pos=r1;
                gmin=dp[r1];
                for (int j=left;j<=i;j++)
                {
                    while (pos>=l1&&r1-pos+1<j-left+1)
                    {
                        gmin=min(gmin,dp[pos-1]+sum[left+r1-pos]-sum[left-1]-(sum[r1]-sum[pos-1]));
                        pos--;
                    }
                    gmin+=vt[j].fi-vt[r1].fi;
                    dp[j]=min(dp[j],gmin);
                }
            }
            dem=0;
        }
    }
    return dp[n];
}

Compilation message

wiring.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //------------------------------------\\
      | ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 444 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 28 ms 8056 KB Output is correct
4 Correct 28 ms 7356 KB Output is correct
5 Correct 28 ms 6332 KB Output is correct
6 Correct 44 ms 8384 KB Output is correct
7 Correct 40 ms 8376 KB Output is correct
8 Correct 37 ms 8392 KB Output is correct
9 Correct 37 ms 8352 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 40 ms 10540 KB Output is correct
4 Correct 39 ms 10684 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 444 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 39 ms 10308 KB Output is correct
19 Correct 39 ms 10684 KB Output is correct
20 Correct 41 ms 10176 KB Output is correct
21 Correct 38 ms 10172 KB Output is correct
22 Correct 40 ms 10684 KB Output is correct
23 Correct 37 ms 10284 KB Output is correct
24 Correct 37 ms 11124 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 31 ms 9916 KB Output is correct
3 Correct 38 ms 9520 KB Output is correct
4 Correct 38 ms 9664 KB Output is correct
5 Correct 36 ms 9408 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 444 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 38 ms 9432 KB Output is correct
19 Correct 40 ms 10036 KB Output is correct
20 Correct 38 ms 9660 KB Output is correct
21 Correct 43 ms 10428 KB Output is correct
22 Correct 37 ms 9612 KB Output is correct
23 Correct 32 ms 9408 KB Output is correct
24 Correct 30 ms 9664 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 444 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 28 ms 8056 KB Output is correct
20 Correct 28 ms 7356 KB Output is correct
21 Correct 28 ms 6332 KB Output is correct
22 Correct 44 ms 8384 KB Output is correct
23 Correct 40 ms 8376 KB Output is correct
24 Correct 37 ms 8392 KB Output is correct
25 Correct 37 ms 8352 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 40 ms 10540 KB Output is correct
29 Correct 39 ms 10684 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 444 KB Output is correct
38 Correct 0 ms 448 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 39 ms 10308 KB Output is correct
44 Correct 39 ms 10684 KB Output is correct
45 Correct 41 ms 10176 KB Output is correct
46 Correct 38 ms 10172 KB Output is correct
47 Correct 40 ms 10684 KB Output is correct
48 Correct 37 ms 10284 KB Output is correct
49 Correct 37 ms 11124 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 31 ms 9916 KB Output is correct
52 Correct 38 ms 9520 KB Output is correct
53 Correct 38 ms 9664 KB Output is correct
54 Correct 36 ms 9408 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 444 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 38 ms 9432 KB Output is correct
68 Correct 40 ms 10036 KB Output is correct
69 Correct 38 ms 9660 KB Output is correct
70 Correct 43 ms 10428 KB Output is correct
71 Correct 37 ms 9612 KB Output is correct
72 Correct 32 ms 9408 KB Output is correct
73 Correct 30 ms 9664 KB Output is correct
74 Correct 42 ms 10940 KB Output is correct
75 Correct 46 ms 10028 KB Output is correct
76 Correct 41 ms 11240 KB Output is correct
77 Correct 38 ms 9664 KB Output is correct
78 Correct 32 ms 9660 KB Output is correct
79 Correct 30 ms 9920 KB Output is correct
80 Correct 38 ms 9660 KB Output is correct
81 Correct 37 ms 10440 KB Output is correct
82 Correct 32 ms 10240 KB Output is correct
83 Correct 37 ms 9920 KB Output is correct
84 Correct 38 ms 10176 KB Output is correct
85 Correct 32 ms 10940 KB Output is correct
86 Correct 49 ms 10288 KB Output is correct
87 Correct 33 ms 10176 KB Output is correct
88 Correct 44 ms 10684 KB Output is correct
89 Correct 50 ms 10884 KB Output is correct
90 Correct 40 ms 10788 KB Output is correct
91 Correct 34 ms 10428 KB Output is correct
92 Correct 40 ms 10940 KB Output is correct
93 Correct 40 ms 10428 KB Output is correct
94 Correct 35 ms 10440 KB Output is correct
95 Correct 40 ms 10668 KB Output is correct
96 Correct 39 ms 10720 KB Output is correct
97 Correct 35 ms 10172 KB Output is correct
98 Correct 34 ms 10172 KB Output is correct
99 Correct 33 ms 10684 KB Output is correct
100 Correct 35 ms 10688 KB Output is correct
101 Correct 47 ms 10288 KB Output is correct
102 Correct 40 ms 10292 KB Output is correct