제출 #895468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
895468		nightfal	전선 연결 (IOI17_wiring)	C++14	20 / 100	17 ms	2752 KiB

wiring

#include "wiring.h"
#include <stdlib.h>
#include <algorithm>
using namespace std;
 
bool isSubtask1(std::vector<int>, std::vector<int>); 
bool isSubtask2(std::vector<int>, std::vector<int>);
long long subtask1(std::vector<int>, std::vector<int>);
long long subtask2(std::vector<int>, std::vector<int>);
 
long long min_total_length(std::vector<int> r, std::vector<int> b) {
  	if (isSubtask1(r,b)) return subtask1(r,b);
  	else if (isSubtask2(r,b)) return subtask2(r,b);
}
 
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];
}
 
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];
}
 
long long subtask2(std::vector<int> r, std::vector<int> b) {
  long long rSum=0, bSum=0, n = r.size(), m = b.size();
  for(int i=0; i<n; i++) rSum += r[n-1] - r[i];
  for(int i=0; i<m; i++) bSum += b[i] - b[0];
  return rSum+bSum+max(n,m)*(b[0]-r[n-1]);
}

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

wiring.cpp: In function 'long long int subtask1(std::vector<int>, std::vector<int>)':
wiring.cpp:33:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   33 |       for(int j=1; j<m; j++)
      |       ^~~
wiring.cpp:35:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   35 |  return dp[n-1][m-1];
      |  ^~~~~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

• Subtask 1: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45