oj.uz

답안 #879078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879078 2023-11-26T09:16:56 Z snpmrnhlol 전선 연결 (IOI17_wiring) C++17
100 / 100
 40 ms 10180 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5;
const ll inf = 1e18;
vector <ll> a;
vector <ll> c;
struct p{
    ll nr,tip;
}v[2*N];
ll dp[2*N];
ll ps[2*N + 1];
ll sum(ll l,ll r){
    return ps[r + 1] - ps[l];
}
ll min_total_length(vector <int> r,vector <int> b){
    ll n = 0;
    for(ll i = 0;i < r.size();i++){
        v[n++] = {r[i],0};
    }
    for(ll i = 0;i < b.size();i++){
        v[n++] = {b[i],1};
    }
    sort(v,v + n,[&](p a,p b){
         return a.nr < b.nr;
    });
    for(ll i = 0;i < n;i++){
        ps[i + 1] = ps[i] + v[i].nr;
        dp[i] = inf;
    }
    ll i = 0,p = -1;
    while(i < n){
        ll nxt = i;
        while(nxt < n - 1 && v[i].tip == v[nxt + 1].tip)nxt++;
        if(p != -1){
            ///p index of first red
            ///i index of first blue
            ///nxt index of last blue
            ///case 1: right side bigger
            ll l = i - 1;
            ll r = i;
            ll cross = (v[i].nr - v[i - 1].nr);
            ll minn = inf;
            while(l >= p && r <= nxt){
                minn = min(minn,(l == 0?0:dp[l - 1]) + ((i - l)*v[i - 1].nr - sum(l,i - 1)));
                //cout<<minn<<' '<<(r - i + 1)*cross<<' '<<sum(i,r)<<' '<<'\n';
                dp[r] = min(dp[r],(r - i + 1)*cross + (sum(i,r) - v[i].nr*(r - i + 1)) + minn);
                l--;r++;
            }
            while(r <= nxt){
                //cout<<minn<<' '<<(r - i + 1)*cross<<' '<<sum(i,r)<<' '<<'\n';
                dp[r] = min(dp[r],(r - i + 1)*cross + (sum(i,r) - v[i].nr*(r - i + 1)) + minn);
                r++;
            }

            ///case 2:left side bigger
            l = p;
            r = nxt;
            minn = inf;
            while(i - 1 - l > r - i){
                minn = min(minn,(l == 0?0:dp[l - 1]) + (i - l)*cross + v[i - 1].nr*(i - l) - sum(l,i - 1));
                l++;
            }
            while(i - 1 - l < r - i){
                r--;
            }
            while(l < i && r > i - 1){
                minn = min(minn,(l == 0?0:dp[l - 1]) + (i - l)*cross + v[i - 1].nr*(i - l) - sum(l,i - 1));
                //cout<<r<<' '<<minn<<' '<<sum(i,r)<<' '<<v[i].nr*(r - i + 1)<<'\n';
                dp[r] = min(dp[r],sum(i,r) - v[i].nr*(r - i + 1) + minn);
                l++;
                r--;
            }
            //cout<<nxt<<' '<<p<<'\n';
            for(ll j = nxt - 1;j >= p;j--)dp[j] = min(dp[j],dp[j + 1]);
            /*for(ll j = 0;j < n;j++){
                cout<<dp[j]<<' ';
            }
            cout<<'\n';*/
        }
        p = i;
        i = nxt;
        i++;
    }
    return dp[n - 1];
}
/**
int main(){
    ll n,m;
    cin>>n>>m;
    a.resize(n);
    c.resize(m);
    for(ll i = 0;i < n;i++){
        cin>>a[i];
    }
    for(ll i = 0;i < m;i++){
        cin>>c[i];
    }
    min_total_length(a,c);
    return 0;
}
**/
/**
10 11
1 2 3 4 7 8 9 10 11 15
5 6 12 13 14 16 17 18 19 20 21
**/

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:19:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(ll i = 0;i < r.size();i++){
      |                  ~~^~~~~~~~~~
wiring.cpp:22:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(ll i = 0;i < b.size();i++){
      |                  ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 17 ms 6932 KB Output is correct
4 Correct 16 ms 7004 KB Output is correct
5 Correct 16 ms 7004 KB Output is correct
6 Correct 26 ms 8016 KB Output is correct
7 Correct 23 ms 8108 KB Output is correct
8 Correct 22 ms 8028 KB Output is correct
9 Correct 23 ms 8152 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4460 KB Output is correct
3 Correct 34 ms 8148 KB Output is correct
4 Correct 34 ms 9804 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4512 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 32 ms 10076 KB Output is correct
19 Correct 32 ms 10024 KB Output is correct
20 Correct 37 ms 10068 KB Output is correct
21 Correct 32 ms 10076 KB Output is correct
22 Correct 32 ms 10076 KB Output is correct
23 Correct 40 ms 10180 KB Output is correct
24 Correct 33 ms 10064 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 28 ms 8028 KB Output is correct
3 Correct 30 ms 8028 KB Output is correct
4 Correct 31 ms 8020 KB Output is correct
5 Correct 31 ms 8020 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4516 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 28 ms 9404 KB Output is correct
19 Correct 29 ms 9308 KB Output is correct
20 Correct 28 ms 9360 KB Output is correct
21 Correct 31 ms 9552 KB Output is correct
22 Correct 28 ms 9412 KB Output is correct
23 Correct 24 ms 9412 KB Output is correct
24 Correct 24 ms 9300 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4536 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 17 ms 6932 KB Output is correct
20 Correct 16 ms 7004 KB Output is correct
21 Correct 16 ms 7004 KB Output is correct
22 Correct 26 ms 8016 KB Output is correct
23 Correct 23 ms 8108 KB Output is correct
24 Correct 22 ms 8028 KB Output is correct
25 Correct 23 ms 8152 KB Output is correct
26 Correct 1 ms 4440 KB Output is correct
27 Correct 1 ms 4460 KB Output is correct
28 Correct 34 ms 8148 KB Output is correct
29 Correct 34 ms 9804 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4512 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4440 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 32 ms 10076 KB Output is correct
44 Correct 32 ms 10024 KB Output is correct
45 Correct 37 ms 10068 KB Output is correct
46 Correct 32 ms 10076 KB Output is correct
47 Correct 32 ms 10076 KB Output is correct
48 Correct 40 ms 10180 KB Output is correct
49 Correct 33 ms 10064 KB Output is correct
50 Correct 1 ms 4440 KB Output is correct
51 Correct 28 ms 8028 KB Output is correct
52 Correct 30 ms 8028 KB Output is correct
53 Correct 31 ms 8020 KB Output is correct
54 Correct 31 ms 8020 KB Output is correct
55 Correct 1 ms 4444 KB Output is correct
56 Correct 1 ms 4444 KB Output is correct
57 Correct 1 ms 4444 KB Output is correct
58 Correct 1 ms 4444 KB Output is correct
59 Correct 1 ms 4444 KB Output is correct
60 Correct 1 ms 4444 KB Output is correct
61 Correct 1 ms 4444 KB Output is correct
62 Correct 1 ms 4444 KB Output is correct
63 Correct 1 ms 4516 KB Output is correct
64 Correct 1 ms 4444 KB Output is correct
65 Correct 1 ms 4444 KB Output is correct
66 Correct 1 ms 4444 KB Output is correct
67 Correct 28 ms 9404 KB Output is correct
68 Correct 29 ms 9308 KB Output is correct
69 Correct 28 ms 9360 KB Output is correct
70 Correct 31 ms 9552 KB Output is correct
71 Correct 28 ms 9412 KB Output is correct
72 Correct 24 ms 9412 KB Output is correct
73 Correct 24 ms 9300 KB Output is correct
74 Correct 23 ms 10052 KB Output is correct
75 Correct 30 ms 9656 KB Output is correct
76 Correct 29 ms 10076 KB Output is correct
77 Correct 29 ms 9500 KB Output is correct
78 Correct 30 ms 9420 KB Output is correct
79 Correct 30 ms 9552 KB Output is correct
80 Correct 23 ms 9564 KB Output is correct
81 Correct 34 ms 9648 KB Output is correct
82 Correct 23 ms 9560 KB Output is correct
83 Correct 23 ms 9800 KB Output is correct
84 Correct 22 ms 10064 KB Output is correct
85 Correct 32 ms 10176 KB Output is correct
86 Correct 24 ms 10180 KB Output is correct
87 Correct 26 ms 10052 KB Output is correct
88 Correct 28 ms 10080 KB Output is correct
89 Correct 27 ms 10064 KB Output is correct
90 Correct 31 ms 10072 KB Output is correct
91 Correct 26 ms 10076 KB Output is correct
92 Correct 27 ms 10068 KB Output is correct
93 Correct 25 ms 10076 KB Output is correct
94 Correct 26 ms 10076 KB Output is correct
95 Correct 29 ms 10076 KB Output is correct
96 Correct 24 ms 10076 KB Output is correct
97 Correct 31 ms 10076 KB Output is correct
98 Correct 26 ms 10076 KB Output is correct
99 Correct 27 ms 10072 KB Output is correct
100 Correct 31 ms 10012 KB Output is correct
101 Correct 26 ms 10068 KB Output is correct
102 Correct 31 ms 10064 KB Output is correct