Submission #313061

#	Time	Username	Problem	Language	Result	Execution time	Memory
313061		kylych03	Wiring (IOI17_wiring)	C++14	30 / 100	789 ms	7288 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
long long dp[200002];
long long dp1[202][202];
long long inf  = 1e15;
long long fun(vector <int> x, vector <int> y){
    long long ans = 0;
    if(x.size() == 0 || y.size()==0)
        return inf;
     for(int i = 0 ; i <= x.size() ;i++){
        for(int j = 0 ; j <= y.size() ; j++){
            dp1[i][j]=inf;
        }
    }
    dp1[0][0]=0;
    for(int i = 0 ; i < x.size() ;i++){
        for(int j = 0 ; j < y.size() ; j++){
            dp1[i+1][j+1] = min(dp1[i][j] ,  min(dp1[i][j+1]  ,  dp1[i+1][j] ) ) + + abs(x[i] - y[j]);
        }
    }
    return dp1[x.size()][y.size()];
}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    deque < pair <int, int> > pr;
    //sort(r.begin(), r.end());
    //sort(b.begin(), b.end());

    int n = r.size();
    int m = b.size();
    pr.resize(n+m);
    for(int i = 0 ; i < n; i++){
        pr[i].first = r[i];
        pr[i].second = 0;
    }
    for(int i = 0 ; i < m; i++){
        pr[i+n].first = b[i];
        pr[i+n].second = 1;
    }
    sort(pr.begin(), pr.end());
    if(r.back() < b[0]){
        long long sum = 0;
        for(int i = 0 ;i < r.size(); i++)
            sum += (r.back() - r[i]);
        for(int i = 0 ;i < b.size(); i++)
            sum += (b[i] - b[0]);
        return sum + max(r.size(), b.size()) * 1ll * (b[0] - r.back());
    }
    if(n >201 || m > 201){
        for(int i = 0 ; i < n + m ; i++){
            dp[i+1]=inf;
            vector <int> r1, b1;
            for(int j  = i-1 ;j >= 0 && i-j < 13; j-- ){

                for(int k = j ; k <= i ;k++){
                    if(pr[k].second == 0 )
                        r1.push_back(pr[k].first);
                    else
                        b1.push_back(pr[k].first);
                }

                dp[i+1] = min(dp[i+1], dp[j] + fun(r1, b1));
                r1.clear();
                b1.clear();
            }
        }
        return dp[n+m];
    }

	return fun(r, b);
}

Compilation message (stderr)

wiring.cpp: In function 'long long int fun(std::vector<int>, std::vector<int>)':
wiring.cpp:12:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |      for(int i = 0 ; i <= x.size() ;i++){
      |                      ~~^~~~~~~~~~~
wiring.cpp:13:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |         for(int j = 0 ; j <= y.size() ; j++){
      |                         ~~^~~~~~~~~~~
wiring.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i = 0 ; i < x.size() ;i++){
      |                     ~~^~~~~~~~~~
wiring.cpp:19:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         for(int j = 0 ; j < y.size() ; j++){
      |                         ~~^~~~~~~~~~
wiring.cpp:9:15: warning: unused variable 'ans' [-Wunused-variable]
    9 |     long long ans = 0;
      |               ^~~
wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:45:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for(int i = 0 ;i < r.size(); i++)
      |                        ~~^~~~~~~~~~
wiring.cpp:47:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int i = 0 ;i < b.size(); i++)
      |                        ~~^~~~~~~~~~

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