oj.uz

Submission #567196

# Submission time Handle Problem Language Result Execution time Memory
567196 2022-05-23T09:08:00 Z Mazaalai Road Closures (APIO21_roads) C++17
5 / 100
 49 ms 9932 KB 
#include "roads.h"
#define pb push_back
#define ALL(x) x.begin(),x.end()
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair <ll, ll>;
int n, m;
const int N = 1e5 + 5;
const int INF = 1e6;

vector <PII> paths[N];
vector<ll> minimum_closure_costs(int _n, vector<int> a, vector<int> b, vector<int> c) {
    vector <ll> res;
    m = a.size();
    bool test1 = 1;
    for (int i = 0; i < m; i++) {
        if (a[i] > b[i]) swap(a[i], b[i]);
        test1 &= (a[i] == 0);
    }
    if (test1) {
        vector <int> edges;
        for (int i = 0; i < m; i++) edges.pb(c[i]);
        sort(ALL(edges));
        ll sum = 0; res.pb(sum);
        for (int i = 0; i < m; i++) {
            sum += edges[i];
            res.pb(sum);
        }
        reverse(ALL(res));
        // for (auto el : res) cout <<
        return res;
    }
    for (int i = 0; i < m; i++) {
        paths[a[i]].pb({b[i], c[i]});
        paths[a[i]].pb({b[i], c[i]});
    }
    return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2788 KB Output is correct
3 Correct 3 ms 2708 KB Output is correct
4 Correct 3 ms 2792 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 26 ms 5460 KB Output is correct
13 Correct 41 ms 7520 KB Output is correct
14 Correct 44 ms 7756 KB Output is correct
15 Correct 49 ms 8024 KB Output is correct
16 Correct 49 ms 8036 KB Output is correct
17 Correct 45 ms 8036 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 35 ms 7160 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 2 ms 2644 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 9164 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 9164 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 2644 KB Output is correct
2 Correct 2 ms 2788 KB Output is correct
3 Correct 3 ms 2708 KB Output is correct
4 Correct 3 ms 2792 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 26 ms 5460 KB Output is correct
13 Correct 41 ms 7520 KB Output is correct
14 Correct 44 ms 7756 KB Output is correct
15 Correct 49 ms 8024 KB Output is correct
16 Correct 49 ms 8036 KB Output is correct
17 Correct 45 ms 8036 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 35 ms 7160 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Incorrect 35 ms 9932 KB Output isn't correct
22 Halted 0 ms 0 KB -