oj.uz

Submission #903027

# Submission time Handle Problem Language Result Execution time Memory
903027 2024-01-11T05:19:32 Z nightfal Wiring (IOI17_wiring) C++14
100 / 100
 34 ms 5980 KB 
// #include "wiring.h"
#include <cassert>
#include <cstdio>
#include <vector>
#include <climits>
#include <stdlib.h>
#include <algorithm>
 
using namespace std;
 
bool isSubtask1(std::vector<int> r, std::vector<int> b) {return r.size()<=200 && b.size()<=200;}
bool isSubtask2(std::vector<int> r, std::vector<int> b) {return r[r.size()-1]<b[0];}
bool isSubtask3(std::vector<int> r, std::vector<int> b) {
    int n=r.size(), m=b.size();
    vector<int> a(n+m);
   
    for(int i=0, j=0; i<n || j<m;)
        i==n? a[i+j++]=1: j==m? a[j+i++]=0: r[i]<b[j]? a[j+i++]=0:a[i+j++] = 1;
 
    int cnt = 1;
    for(int k=1; k<n+m; k++) {
        cnt = a[k]==a[k-1]? cnt+1:0;
        if (cnt > 6) return false;
    }
  return true;
}
bool isSubtask4(std::vector<int> r, std::vector<int> b) {
    return min(r[0],b[0])==1 && max(r[r.size()-1],b[b.size()-1])==r.size()+b.size();
}
 
long long subtask1(std::vector<int>, std::vector<int>);
long long subtask2(std::vector<int> &, std::vector<int> &, int, int, int, int);
long long subtask3(std::vector<int>, std::vector<int>);
long long subtask4(std::vector<int>, std::vector<int>);
long long fulltask(std::vector<int>, std::vector<int>);
long long min_total_length(std::vector<int>, std::vector<int> );
 
 
long long min_total_length(std::vector<int> r, std::vector<int> b) {
    return fulltask(r,b);
    // if (isSubtask4(r,b)) return subtask4(r,b);
    // else if (isSubtask3(r,b)) return subtask3(r,b);
  	// else if (isSubtask2(r,b)) return subtask2(r,b,0,r.size()-1,0,b.size()-1);    
  	// else if (isSubtask1(r,b)) return subtask1(r,b);
    return 0;
}
 
long long fulltask(std::vector<int> r, std::vector<int> b) {
    int n = r.size(), m = b.size();
    vector<pair<int,int>> a(n+m);
    
    for(int i=0, j=0; i<n || j<m;)
        i==n? a[i+j++]=make_pair(j,1): j==m? a[j+i++]=make_pair(i,0): r[i]<b[j]? a[j+i++]=make_pair(i,0): a[i+j++]=make_pair(j,1);
 
    vector<long long> dp(n+m,LLONG_MAX);
 
    long long sumL=0, cntL=0, sumR=0, cntR=0, gap=0;
    int prev=-1, curr=0, optIdx=0;
 
    for(int i=1; i<n+m; i++) {
        vector<int> *left, *right;
        if (a[i].second != a[i-1].second) {
            prev=curr; curr=i; sumR=cntR=0; sumL=0; optIdx=curr-1;
            if (a[prev].second==0) {left=&r; right=&b;}
            else {left=&b; right=&r;}
            gap = (*right)[a[curr].first]-(*left)[a[curr-1].first];
        }
 
        if (prev==-1) continue;
 
        sumR += (*right)[a[i].first]-(*right)[a[curr].first];
        cntR++;
 
        for(int j=optIdx; j>=prev; j--) {
            cntL=curr-j; 
            sumL += (*left)[a[curr-1].first]-(*left)[a[j].first];
            if(prev==0 && j!=0) continue;
            long long temp = sumL + sumR + max(cntL,cntR)*gap;
            if (prev!=0) temp += min(dp[j-1],dp[j]);
            if (dp[i]>temp) {dp[i]=temp; optIdx=j;}
                else break;            
        }
        for(int k=max(optIdx-1,prev); k<=optIdx; k++)
            sumL -= (*left)[a[curr-1].first]-(*left)[a[k].first];
    }
    return dp[n+m-1];
}
 
long long subtask4(std::vector<int> r, std::vector<int> b) {
    int n = r.size(), m = b.size();
    vector<int> a(n+m);
    
    for(int i=0, j=0; i<n || j<m;)
        i==n? a[i+j++]=1: j==m? a[j+i++]=0: r[i]<b[j]? a[j+i++]=0: a[i+j++]=1;
 
    long long dp1=LLONG_MAX, dp2=LLONG_MAX;
    long long cntL=0, cntR=1;
    int prev=-1, curr=0; 
 
    for(int i=1; i<n+m; i++) {
        if (a[i]!=a[i-1]) {prev=curr; curr=i; cntL=cntR, cntR=0;}
        cntR++;
 
        long long cntL1 = cntL/2, cntL2 = (cntL+1)/2;                
        long long cntR1 = cntR/2, cntR2 = (cntR+1)/2;
 
        long long sumL = cntL*(cntL-1)/2, sumR = cntR*(cntR-1)/2; 
        long long sumL1 = cntL1*(cntL1-1)/2, sumL2 = cntL2*(cntL2-1)/2; 
        long long sumR1 = cntR1*(cntR1-1)/2, sumR2 = cntR2*(cntR2-1)/2;
 
        if(i==n+m-1) {
            if(prev==0) // subtask2와 동일하므로 생략가능
                return sumL + max(cntL,cntR) + sumR;
            else 
                return min(dp1 + sumL2 + max(cntL2,cntR), dp2 + sumL1 + max(cntL1,cntR)) + sumR;
        }
        else if (a[i]!= a[i+1]) { 
            if (prev==0) {
                dp1 = sumL + max(cntL,cntR1) + sumR1; 
                dp2 = sumL + max(cntL,cntR2) + sumR2;            
            }
            else {
                long long new_dp1 = min(dp1 + sumL2 + max(cntL2,cntR1), dp2 + sumL1 + max(cntL1,cntR1)) + sumR1;
                long long new_dp2 = min(dp1 + sumL2 + max(cntL2,cntR2), dp2 + sumL1 + max(cntL1,cntR2)) + sumR2;
                dp1 = new_dp1; dp2 = new_dp2;
            }
        }
    }
}
 
long long subtask3(std::vector<int> r, std::vector<int> b) {
    int n = r.size(), m = b.size();
    vector<pair<int,int>> a(n+m);
    
    for(int i=0, j=0; i<n || j<m;) // make_pair 내부에서 ++ 하면 안됨
        i==n? a[i+j++]=make_pair(j,1): j==m? a[j+i++]=make_pair(i,0): r[i]<b[j]? a[j+i++]=make_pair(i,0): a[i+j++]=make_pair(j,1);
 
    vector<long long> dp(n+m,LLONG_MAX);
 
    long long sumL=0, cntL=0, sumR=0, cntR=0, gap=0;
    int prev=-1, curr=0;
 
    for(int i=1; i<n+m; i++) {
        vector<int> *left, *right;
        if (a[i].second != a[i-1].second) {
            prev=curr; curr=i; sumR=cntR=0;
            if(a[prev].second==0) {left=&r; right=&b;}
            else {left=&b; right=&r;}
            gap= (*right)[a[curr].first]-(*left)[a[curr-1].first];
        }
        if (prev==-1) continue;
 
        sumR += (*right)[a[i].first]-(*right)[a[curr].first];
        cntR++;
 
        for(int j=curr-1; j>=prev; j--) {
            cntL++;
            sumL += (*left)[a[curr-1].first]-(*left)[a[j].first];
            if (prev==0 && j!=0) continue;
            long long temp = sumL + sumR + max(cntL,cntR)*gap;
            if (prev!=0) temp += min(dp[j-1],dp[j]);
            dp[i] = min(dp[i], temp);
        }
        sumL=cntL=0;
    }
    return dp[n+m-1];
}
 
long long subtask2(std::vector<int> &arr1, std::vector<int> &arr2, int s1, int e1, int s2, int e2) {
  long long sum1=0, sum2=0, n = e1-s1+1, m=e2-s2+1;
  for(int i=s1; i<=e1; i++) sum1 += arr1[e1] - arr1[i];
  for(int i=s2; i<=e2; i++) sum2 += arr2[i] - arr2[s2];
  return sum1+sum2+max(n,m)*(arr2[s2]-arr1[e1]);
}
 
long long subtask1(std::vector<int> r, std::vector<int> b) {
	int n = r.size(), m = b.size();
    long long dp[n][m];
  	dp[0][0] = abs(r[0]-b[0]);
  	for(int i=1; i<n; i++) dp[i][0] = dp[i-1][0] + abs(r[i]-b[0]);
    for(int j=1; j<m; j++) dp[0][j] = dp[0][j-1] + abs(r[0]-b[j]);
  	for(int i=1; i<n; i++)  	
      for(int j=1; j<m; j++)
        dp[i][j] = min(min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]) + abs(r[i]-b[j]);
 
	return dp[n-1][m-1];
}

Compilation message

wiring.cpp: In function 'bool isSubtask4(std::vector<int>, std::vector<int>)':
wiring.cpp:28:65: warning: comparison of integer expressions of different signedness: 'const int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     return min(r[0],b[0])==1 && max(r[r.size()-1],b[b.size()-1])==r.size()+b.size();
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
wiring.cpp: In function 'long long int subtask1(std::vector<int>, std::vector<int>)':
wiring.cpp:183:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  183 |       for(int j=1; j<m; j++)
      |       ^~~
wiring.cpp:186:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  186 |  return dp[n-1][m-1];
      |  ^~~~~~
wiring.cpp: In function 'long long int subtask4(std::vector<int>, std::vector<int>)':
wiring.cpp:91:22: warning: control reaches end of non-void function [-Wreturn-type]
   91 |     vector<int> a(n+m);
      |                      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 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 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 1 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 14 ms 4456 KB Output is correct
4 Correct 14 ms 4456 KB Output is correct
5 Correct 15 ms 4368 KB Output is correct
6 Correct 20 ms 5820 KB Output is correct
7 Correct 19 ms 5724 KB Output is correct
8 Correct 19 ms 5724 KB Output is correct
9 Correct 18 ms 5720 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 21 ms 5820 KB Output is correct
4 Correct 31 ms 5824 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 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 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 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 34 ms 5888 KB Output is correct
19 Correct 32 ms 5724 KB Output is correct
20 Correct 23 ms 5724 KB Output is correct
21 Correct 23 ms 5824 KB Output is correct
22 Correct 21 ms 5880 KB Output is correct
23 Correct 26 ms 5668 KB Output is correct
24 Correct 22 ms 5724 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 29 ms 5816 KB Output is correct
3 Correct 18 ms 5720 KB Output is correct
4 Correct 18 ms 5824 KB Output is correct
5 Correct 18 ms 5828 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 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 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 21 ms 5824 KB Output is correct
19 Correct 18 ms 5824 KB Output is correct
20 Correct 18 ms 5720 KB Output is correct
21 Correct 17 ms 5724 KB Output is correct
22 Correct 20 ms 5724 KB Output is correct
23 Correct 17 ms 5824 KB Output is correct
24 Correct 17 ms 5724 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 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 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 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 360 KB Output is correct
19 Correct 14 ms 4456 KB Output is correct
20 Correct 14 ms 4456 KB Output is correct
21 Correct 15 ms 4368 KB Output is correct
22 Correct 20 ms 5820 KB Output is correct
23 Correct 19 ms 5724 KB Output is correct
24 Correct 19 ms 5724 KB Output is correct
25 Correct 18 ms 5720 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 21 ms 5820 KB Output is correct
29 Correct 31 ms 5824 KB Output is correct
30 Correct 0 ms 348 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 348 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 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 34 ms 5888 KB Output is correct
44 Correct 32 ms 5724 KB Output is correct
45 Correct 23 ms 5724 KB Output is correct
46 Correct 23 ms 5824 KB Output is correct
47 Correct 21 ms 5880 KB Output is correct
48 Correct 26 ms 5668 KB Output is correct
49 Correct 22 ms 5724 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 29 ms 5816 KB Output is correct
52 Correct 18 ms 5720 KB Output is correct
53 Correct 18 ms 5824 KB Output is correct
54 Correct 18 ms 5828 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 344 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 348 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 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 344 KB Output is correct
67 Correct 21 ms 5824 KB Output is correct
68 Correct 18 ms 5824 KB Output is correct
69 Correct 18 ms 5720 KB Output is correct
70 Correct 17 ms 5724 KB Output is correct
71 Correct 20 ms 5724 KB Output is correct
72 Correct 17 ms 5824 KB Output is correct
73 Correct 17 ms 5724 KB Output is correct
74 Correct 19 ms 5720 KB Output is correct
75 Correct 20 ms 5724 KB Output is correct
76 Correct 19 ms 5720 KB Output is correct
77 Correct 18 ms 5724 KB Output is correct
78 Correct 17 ms 5724 KB Output is correct
79 Correct 18 ms 5724 KB Output is correct
80 Correct 17 ms 5724 KB Output is correct
81 Correct 19 ms 5724 KB Output is correct
82 Correct 17 ms 5708 KB Output is correct
83 Correct 18 ms 5716 KB Output is correct
84 Correct 21 ms 5712 KB Output is correct
85 Correct 20 ms 5724 KB Output is correct
86 Correct 18 ms 5828 KB Output is correct
87 Correct 19 ms 5824 KB Output is correct
88 Correct 19 ms 5724 KB Output is correct
89 Correct 19 ms 5924 KB Output is correct
90 Correct 19 ms 5920 KB Output is correct
91 Correct 24 ms 5980 KB Output is correct
92 Correct 22 ms 5824 KB Output is correct
93 Correct 19 ms 5724 KB Output is correct
94 Correct 21 ms 5824 KB Output is correct
95 Correct 20 ms 5720 KB Output is correct
96 Correct 31 ms 5712 KB Output is correct
97 Correct 31 ms 5720 KB Output is correct
98 Correct 23 ms 5720 KB Output is correct
99 Correct 19 ms 5828 KB Output is correct
100 Correct 21 ms 5724 KB Output is correct
101 Correct 18 ms 5828 KB Output is correct
102 Correct 23 ms 5828 KB Output is correct