Submission #786735

#	Time	Username	Problem	Language	Result	Execution time	Memory
786735		mindiyak	Roller Coaster Railroad (IOI16_railroad)	C++14	11 / 100	2071 ms	10680 KiB

railroad

#include "railroad.h"
#include <iostream>
#include <unordered_set>

#define ll long long

using namespace std;

// const int MAXN = (2*1e5)+2;
const int MAXN = 100;
int costTable[MAXN][MAXN];
long long ans = 1e18;


void dfs(int n,int pos,unordered_set<int> visited,ll cost){
    if(cost >= ans){
        return;
    }
    visited.insert(pos);
    if(visited.size() == n){
        ans = min(ans,cost);
        return;
    }

    for(int i=0;i<n;i++){
        if(visited.count(i) == 0){
            dfs(n,i,visited,cost+costTable[pos][i]);
        }
    }
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(j==i){
                costTable[i][j] = 0;
            }else{
                // cout << i << " " << j << " " << t[i] << " " << s[i] << " " << t[j] << " " << s[j] << endl;
                costTable[i][j] = max(0,t[i]-s[j]);
            }
        }
    }

    // cout << endl;

    // for(int i=0;i<n;i++){
    //     for(int j=0;j<n;j++){
    //         cout << costTable[i][j] << " ";
    //     }cout << endl;
    // }

    unordered_set<int> visited;
    for(int i=0;i<n;i++){
        dfs(n,i,visited,0);
    }


    return ans;
}

Compilation message (stderr)

railroad.cpp: In function 'void dfs(int, int, std::unordered_set<int>, long long int)':
railroad.cpp:20:23: warning: comparison of integer expressions of different signedness: 'std::unordered_set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(visited.size() == n){
      |        ~~~~~~~~~~~~~~~^~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36