oj.uz

Submission #569983

# Submission time Handle Problem Language Result Execution time Memory
569983 2022-05-28T12:21:04 Z Cyber_Wolf Road Closures (APIO21_roads) C++14
5 / 100
 50 ms 3724 KB 
//Problem Link: https://oj.uz/problem/view/APIO21_roads
//APIO 2021 Problem Roads

#include "roads.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;

#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);
#define endl \n
#define lbound(x, y) lower_bound(x.begin(), x.end(), y) 
#define ubound(x, y) upper_bound(x.begin(), x.end(), y) 
#define sortasc(v) sort(v.begin(), v.end())	
#define sortdesc(v) sort(v.rbegin(), v.rend())	

const lg MOD = 1e9+7, N = 2e5+5, M = 1e7+1;
/*
bitset<N> primes;

lg fast_power(lg n, lg k)
{
	if(!k)	return 1;
	if(k&1)	return (fast_power(n, k-1)*n)%MOD;
	lg x = fast_power(n, k/2)%MOD;
	return (x*x)%MOD;
}

void sieve()
{
	primes.set();
	primes[0] = primes[1] = 0;
	for(lg i = 2; i < N; i++)
	{
		if(!primes[i])	continue;
		for(lg j = i*i; j < N; j += i)
		{
			primes[j] = 0;
		}
	}
	return;
}
*/

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) 
{
	vector<lg> a(N);
	for(int i = 1; i < N; i++)	a[i] = W[i-1];
	sort(a.begin(), a.end());
	for(int i = 1; i < N; i++)
	{
		a[i] += a[i-1];
	}
	reverse(a.begin(), a.end());
	return a;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 ms 340 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 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 28 ms 2168 KB Output is correct
13 Correct 39 ms 3412 KB Output is correct
14 Correct 42 ms 3308 KB Output is correct
15 Correct 47 ms 3648 KB Output is correct
16 Correct 50 ms 3632 KB Output is correct
17 Correct 44 ms 3724 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 35 ms 3036 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 ms 340 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 212 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 28 ms 2168 KB Output is correct
13 Correct 39 ms 3412 KB Output is correct
14 Correct 42 ms 3308 KB Output is correct
15 Correct 47 ms 3648 KB Output is correct
16 Correct 50 ms 3632 KB Output is correct
17 Correct 44 ms 3724 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 35 ms 3036 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 44 ms 3116 KB Output isn't correct
22 Halted 0 ms 0 KB -