제출 #899754

#제출 시각아이디문제언어결과실행 시간메모리
899754nightfal전선 연결 (IOI17_wiring)C++14
55 / 100
31 ms7672 KiB
// #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 min_total_length(std::vector<int>, std::vector<int> ); long long min_total_length(std::vector<int> r, std::vector<int> b) { if (isSubtask4(r,b)) return subtask4(r,b); 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); // else return fullTask(r,b); return 0; } 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, sumL=0, sumL2=0, cntR=1, sumR=0, sumR2=0; 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++; if(i==n+m-1) { if(prev==0) { sumL = cntL*(cntL-1)/2; sumR = (cntR)*(cntR-1)/2; return sumL + sumR + max(cntL,cntR); } else { sumL = (cntL/2)*(cntL/2-1)/2; sumL2 = ((cntL+1)/2)*((cntL+1)/2-1)/2; sumR = (cntR)*(cntR-1)/2; long long dp = sumL + dp2 + sumR + max(cntL/2,cntR); if(dp1 < LLONG_MAX) dp = min(dp, sumL2 + dp1 + sumR + max((cntL+1)/2,cntR)); return dp; } } else if (a[i]!= a[i+1]) { if (prev==0) { sumL = cntL*(cntL-1)/2; sumR = (cntR/2)*(cntR/2-1)/2; sumR2 = ((cntR+1)/2)*((cntR+1)/2-1)/2; // if (cntR!=1) dp1 = sumL + sumR + max(cntL,cntR/2); dp2 = sumL + sumR2 + max(cntL,(cntR+1)/2); } else if (prev>0) { sumL = (cntL/2)*(cntL/2-1)/2; sumL2 = ((cntL+1)/2)*((cntL+1)/2-1)/2; sumR = (cntR/2)*(cntR/2-1)/2; sumR2 = ((cntR+1)/2)*((cntR+1)/2-1)/2; long long new_dp1 = sumL + dp2 + sumR + max(cntL/2,cntR/2); long long new_dp2 = sumL + dp2 + sumR2 + max(cntL/2,(cntR+1)/2); if (dp1<LLONG_MAX) { // if (cntL!=1) { new_dp1 = min(new_dp1, sumL2 + dp1 + sumR + max((cntL+1)/2,cntR/2)); new_dp2 = min(new_dp2, sumL2 + dp1 + sumR2 + max((cntL+1)/2,(cntR+1)/2)); } dp1 = new_dp1; dp2 = new_dp2; } // printf("sumL=%lld, sumL2=%lld, sumR=%lld, sumR2=%lld\n",sumL,sumL2,sumR,sumR2); // printf("dp1=%lld, dp2=%lld\n",dp1,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++) { if (a[i].second != a[i-1].second) { prev=curr; curr=i; sumR=cntR=0; gap= a[prev].second==0? b[a[curr].first]-r[a[curr-1].first]: r[a[curr].first]-b[a[curr-1].first]; } if (prev==-1) continue; sumR += a[curr].second==0? r[a[i].first]-r[a[curr].first]:b[a[i].first]-b[a[curr].first]; cntR++; for(int j=curr-1; j>=prev; j--) { cntL++; sumL += a[prev].second==0? r[a[curr-1].first]-r[a[j].first]:b[a[curr-1].first]-b[a[j].first]; long long temp = sumL + sumR + max(cntL,cntR)*gap; if (j==0) dp[i] = min(dp[i],temp); else { long long minDP = min(dp[j-1],dp[j]); if (minDP == LLONG_MAX) continue; else temp += minDP; if (dp[i]>temp) dp[i]=temp; } // printf("dp[%d,%d]=%d, sumL=%d, sumR=%d, gap=%d\n",i,j,dp[i],sumL,sumR,gap); } 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]; }

컴파일 시 표준 에러 (stderr) 메시지

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:152:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  152 |       for(int j=1; j<m; j++)
      |       ^~~
wiring.cpp:155:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  155 |  return dp[n-1][m-1];
      |  ^~~~~~
wiring.cpp: In function 'long long int subtask4(std::vector<int>, std::vector<int>)':
wiring.cpp:49:22: warning: control reaches end of non-void function [-Wreturn-type]
   49 |     vector<int> a(n+m);
      |                      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...