oj.uz

Submission #883926

# Submission time Handle Problem Language Result Execution time Memory
883926 2023-12-06T12:13:25 Z JakobZorz Wiring (IOI17_wiring) C++14
55 / 100
 124 ms 14516 KB 
#include"wiring.h"
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;

const int TREE_SIZE=1<<18;

ll tree[2*TREE_SIZE];
ll min_pre[2*TREE_SIZE];

void add(int i,ll x){
    int node=TREE_SIZE+i;
    tree[node]+=x;
    min_pre[node]+=x;
    node/=2;
    
    while(node){
        tree[node]=tree[2*node]+tree[2*node+1];
        min_pre[node]=min(min(min_pre[2*node],tree[2*node]),min_pre[2*node+1]+tree[2*node]);
        node/=2;
    }
}

ll get_min(int node,int l,int r,int rl,int rr){
    if(r<=rl||rr<=l)
        return 1e17;
    
    if(l<=rl&&rr<=r)
        return min_pre[node];
    
    int mid=(rl+rr)/2;
    return min(get_min(2*node,l,r,rl,mid),tree[2*node]+get_min(2*node+1,l,r,mid,rr));
}

ll get_min(int l,int r){
    return get_min(1,l,r,0,TREE_SIZE);
}

ll min_total_length(vector<int>r,vector<int>b){
    vector<pair<int,int>>arr;
    for(int i:r)
        arr.push_back({i,0});
    for(int i:b)
        arr.push_back({i,1});
    sort(arr.begin(),arr.end());
    
    vector<ll>dp(arr.size(),1e17);
    dp.push_back(0);
    arr.emplace_back(-1,arr.back().second^1);
    int i2=(int)dp.size()-1;
    int i3=(int)dp.size()-1;
    multiset<int>ms;
    ll cost1=0;
    for(int i1=(int)dp.size()-2;i1>=0;i1--){
        if(arr[i2].second==arr[i1].second){
            i3=i2;
            i2=i1+1;
            cost1=0;
            int first1=arr[i2-1].first;
            for(int i=i2;i<i3;i++){
                add(i,arr[i].first-first1);
                add(i,dp[i+1]);
                add(i+1,-dp[i+1]);
            }
        }
        
        if(i2==dp.size()-1)
            continue;
        
        int mid=arr[i2].first;
        int num1=i2-i1;
        int first1=arr[i2-1].first;
        
        cost1+=mid-arr[i1].first;
        
        add(2*i2-i1-1,first1-mid);
        
        dp[i1]=min(dp[i2],get_min(i2,i3))+cost1;
    }
    
    return dp[0];
}

Compilation message

wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:69:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         if(i2==dp.size()-1)
      |            ~~^~~~~~~~~~~~~
wiring.cpp:73:13: warning: unused variable 'num1' [-Wunused-variable]
   73 |         int num1=i2-i1;
      |             ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 54 ms 10904 KB Output is correct
4 Correct 54 ms 11056 KB Output is correct
5 Correct 57 ms 11120 KB Output is correct
6 Correct 73 ms 12968 KB Output is correct
7 Correct 72 ms 12672 KB Output is correct
8 Correct 68 ms 12196 KB Output is correct
9 Correct 73 ms 12272 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 122 ms 12968 KB Output is correct
4 Correct 122 ms 12964 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 122 ms 13816 KB Output is correct
19 Correct 120 ms 13480 KB Output is correct
20 Correct 124 ms 13328 KB Output is correct
21 Correct 124 ms 12836 KB Output is correct
22 Correct 121 ms 12968 KB Output is correct
23 Correct 124 ms 13336 KB Output is correct
24 Correct 120 ms 14252 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 124 ms 13552 KB Output is correct
3 Correct 121 ms 12712 KB Output is correct
4 Correct 123 ms 13908 KB Output is correct
5 Correct 118 ms 13472 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 110 ms 13676 KB Output is correct
19 Correct 122 ms 12884 KB Output is correct
20 Correct 123 ms 12916 KB Output is correct
21 Correct 124 ms 13924 KB Output is correct
22 Correct 108 ms 12708 KB Output is correct
23 Correct 101 ms 13992 KB Output is correct
24 Correct 101 ms 12456 KB Output is correct

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 54 ms 10904 KB Output is correct
20 Correct 54 ms 11056 KB Output is correct
21 Correct 57 ms 11120 KB Output is correct
22 Correct 73 ms 12968 KB Output is correct
23 Correct 72 ms 12672 KB Output is correct
24 Correct 68 ms 12196 KB Output is correct
25 Correct 73 ms 12272 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 122 ms 12968 KB Output is correct
29 Correct 122 ms 12964 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6488 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 122 ms 13816 KB Output is correct
44 Correct 120 ms 13480 KB Output is correct
45 Correct 124 ms 13328 KB Output is correct
46 Correct 124 ms 12836 KB Output is correct
47 Correct 121 ms 12968 KB Output is correct
48 Correct 124 ms 13336 KB Output is correct
49 Correct 120 ms 14252 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 124 ms 13552 KB Output is correct
52 Correct 121 ms 12712 KB Output is correct
53 Correct 123 ms 13908 KB Output is correct
54 Correct 118 ms 13472 KB Output is correct
55 Correct 1 ms 6492 KB Output is correct
56 Correct 1 ms 6492 KB Output is correct
57 Correct 1 ms 6492 KB Output is correct
58 Correct 2 ms 6492 KB Output is correct
59 Correct 1 ms 6492 KB Output is correct
60 Correct 1 ms 6492 KB Output is correct
61 Correct 1 ms 6492 KB Output is correct
62 Correct 1 ms 6492 KB Output is correct
63 Correct 1 ms 6492 KB Output is correct
64 Correct 1 ms 6492 KB Output is correct
65 Correct 1 ms 6492 KB Output is correct
66 Correct 1 ms 6492 KB Output is correct
67 Correct 110 ms 13676 KB Output is correct
68 Correct 122 ms 12884 KB Output is correct
69 Correct 123 ms 12916 KB Output is correct
70 Correct 124 ms 13924 KB Output is correct
71 Correct 108 ms 12708 KB Output is correct
72 Correct 101 ms 13992 KB Output is correct
73 Correct 101 ms 12456 KB Output is correct
74 Correct 103 ms 12968 KB Output is correct
75 Correct 115 ms 12708 KB Output is correct
76 Correct 108 ms 12572 KB Output is correct
77 Correct 124 ms 12904 KB Output is correct
78 Incorrect 112 ms 14516 KB 3rd lines differ - on the 1st token, expected: '16571007298', found: '-7294043428507900044'
79 Halted 0 ms 0 KB -