oj.uz

Submission #724935

# Submission time Handle Problem Language Result Execution time Memory
724935 2023-04-16T10:55:37 Z yeyso Road Closures (APIO21_roads) C++14
7 / 100
 51 ms 8072 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {

    int n = N;
    vector<int> u = U;
    vector<int> v = V;
    vector<ll> w;
    for(int i = 0; i < W.size(); i ++){
        w.push_back(W[i]);
    }

    vector<ll> res(n, 0);
    // k = 0 
    for(int i = 0; i < w.size(); i ++){
        res[0] += w[i];
    }
    // k = 1;
    vector<ll> dp(n-1, 0);
    for(int i = 0; i < w.size(); i ++){
        if(i >= 1){
            if(i >= 2){
                dp[i] = max(dp[i-1], dp[i-2]+w[i]);
            } else {
                dp[i] = max(dp[i-1], w[i]);
            }
        } else {
            dp[i] = w[i];
        }
        
    }
    res[1] = res[0] - dp[dp.size() - 1];
    return res;
}
/*
g++ -std=gnu++17 -O2 -pipe -o roads grader.cpp roads.cpp

6
0 1 3
1 2 2
2 3 1
3 4 4
4 5 1
*/

Compilation message

roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:11:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i = 0; i < W.size(); i ++){
      |                    ~~^~~~~~~~~~
roads.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i = 0; i < w.size(); i ++){
      |                    ~~^~~~~~~~~~
roads.cpp:22:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i = 0; i < w.size(); i ++){
      |                    ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 40 ms 5688 KB Output is correct
3 Correct 48 ms 7524 KB Output is correct
4 Correct 45 ms 8004 KB Output is correct
5 Correct 42 ms 8072 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 22 ms 4448 KB Output is correct
13 Correct 51 ms 7232 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 32 ms 6448 KB Output is correct
16 Correct 36 ms 7216 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 296 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 296 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 6976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 6976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -