oj.uz

Submission #961393

# Submission time Handle Problem Language Result Execution time Memory
961393 2024-04-12T03:32:12 Z zeta7532 Road Closures (APIO21_roads) C++17
5 / 100
 39 ms 5604 KB 
#include "roads.h"
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

#include <vector>

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
  sort(all(W));
  reverse(all(W));
  vector<ll> ans(N,0);
  for(ll i=N-2;i>=0;i--){
    ans[i]=ans[i+1]+W[i];
  }
  return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 628 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 19 ms 2908 KB Output is correct
13 Correct 31 ms 4388 KB Output is correct
14 Correct 35 ms 5028 KB Output is correct
15 Correct 39 ms 5288 KB Output is correct
16 Correct 39 ms 5572 KB Output is correct
17 Correct 37 ms 5604 KB Output is correct
18 Correct 0 ms 520 KB Output is correct
19 Correct 27 ms 4056 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 4700 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 628 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 19 ms 2908 KB Output is correct
13 Correct 31 ms 4388 KB Output is correct
14 Correct 35 ms 5028 KB Output is correct
15 Correct 39 ms 5288 KB Output is correct
16 Correct 39 ms 5572 KB Output is correct
17 Correct 37 ms 5604 KB Output is correct
18 Correct 0 ms 520 KB Output is correct
19 Correct 27 ms 4056 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Incorrect 33 ms 4980 KB Output isn't correct
22 Halted 0 ms 0 KB -