oj.uz

Submission #617932

# Submission time Handle Problem Language Result Execution time Memory
617932 2022-08-01T17:10:41 Z MohamedAliSaidane Road Closures (APIO21_roads) C++14
5 / 100
 48 ms 5540 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "roads.h"
        using namespace __gnu_pbds;
        using namespace std;

        typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;

        typedef long long ll;
        typedef long double ld;

        //#define int ll

        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
        typedef pair<ld,ld> pld;

        typedef vector<int> vi;
        typedef vector<ll> vll;
        typedef vector<pii> vpi;
        typedef vector<pll> vpl;

        #define pb push_back
        #define popb pop_back
        #define pp pop_back
        #define pf push_front
        #define popf pop_front
        #define all(x) (x).begin(),(x).end()
        #define ff first
        #define ss second



        int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
        ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
        ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}


        const ll MOD =   998244353;


       vll minimum_closure_costs(int N, vi U, vi V, vi W)
       {
           sort(all(W));
           vll ans(N, 0);
           ll cursum = 0ll;
           for(int i = 1; i < N;  i++)
           {
               cursum += W[i - 1];
               ans[i] = cursum;
           }
           reverse(all(ans));
           return ans;
       }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 21 ms 2664 KB Output is correct
13 Correct 36 ms 4280 KB Output is correct
14 Correct 41 ms 4880 KB Output is correct
15 Correct 48 ms 5312 KB Output is correct
16 Correct 45 ms 5408 KB Output is correct
17 Correct 40 ms 5540 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 32 ms 3920 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 4628 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 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 21 ms 2664 KB Output is correct
13 Correct 36 ms 4280 KB Output is correct
14 Correct 41 ms 4880 KB Output is correct
15 Correct 48 ms 5312 KB Output is correct
16 Correct 45 ms 5408 KB Output is correct
17 Correct 40 ms 5540 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 32 ms 3920 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 40 ms 4900 KB Output isn't correct
22 Halted 0 ms 0 KB -