Submission #1068657

#	Time	Username	Problem	Language	Result	Execution time	Memory
1068657		edogawa_something	Wiring (IOI17_wiring)	C++17	0 / 100	205 ms	9520 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
typedef vector<ll> vii;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
const ll inf=1e18;
ll ans,dp[2][15][15],n,m;
vector<pii>v;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
  n=r.size(),m=b.size();
  for(int i=0;i<n;i++) {
    v.pb({r[i],0});
  }
  for(int i=0;i<m;i++) {
    v.pb({b[i],1});
  }
  sort(all(v));
  dp[0][0][0]=0;
  for(int j=0;j<=8;j++)
    for(int k=0;k<=8;k++)
      dp[0][j][k]=inf;
  dp[0][0][0]=0;
  for(int i=1;i<=v.size();i++) {
    for(int j=0;j<=8;j++) {
      for(int k=0;k<=8;k++) {
        if(v[i-1].S==1) {
          dp[i%2][j][k]=inf;
          for(int c=j;c>=1;c--) {
            dp[i%2][j][k]=min(dp[i%2][j][k],dp[(i-1)%2][j-c][k]-c*v[i-1].F);
          }
          for(int c=1;c<=8;c++) {
            if(k+c>8)
              break;
            dp[i%2][j][k]=min(dp[i%2][j][k],dp[(i-1)%2][j][k+c]+c*v[i-1].F);
          }
        }
        else {
          dp[i%2][j][k]=inf;
          for(int c=k;c>=1;c--) {
            dp[i%2][j][k]=min(dp[i%2][j][k],dp[(i-1)%2][j][k-c]-c*v[i-1].F);
          }
          for(int c=1;c<=8;c++) {
            if(j+c>8)
              break;
            dp[i%2][j][k]=min(dp[i%2][j][k],dp[(i-1)%2][j+c][k]+c*v[i-1].F);
          }
        }
      }
    }
  }
  return dp[(v.size())%2][0][0];
}

Compilation message (stderr)

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:28:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   for(int i=1;i<=v.size();i++) {
      |               ~^~~~~~~~~~

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