oj.uz

답안 #981356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981356 2024-05-13T05:25:12 Z Jawad_Akbar_JJ 도로 폐쇄 (APIO21_roads) C++17
12 / 100
 43 ms 6640 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include "roads.h"

using namespace std;
#define ll long long
const int N = 1e5 + 10;
vector<pair<int,int>> nei[N];

vector<ll> sub1(int n,vector<int> W){
	sort(rbegin(W),rend(W));
	vector<ll> v;
	v.push_back(0);
	for (int i : W)
		v[0] += i;
	for (int i : W)
		v.push_back(v.back() - i);
	return v;
}

vector<ll> sub2(int n,vector<int> W){
	ll t = W[0];
	ll nt = 0;
	vector<ll> v(n,0);
	v[0] += W[0];
	for (int i=1;i<n-1;i++){
		ll a = t;
		t = min(t,nt) + W[i];
		nt = a;
		v[0] += W[i];
	}
	v[1] = min(t,nt);
	return v;
}

vector<ll>  minimum_closure_costs(int n,vector<int> U,vector<int> V,vector<int> W){
	long long sum = 0,sum2 = 0,sum3 = 0;

	for (int i=0;i<n-1;i++)
		sum += U[i],sum2 += W[i],sum3 += (U[i] == i);
	
	if (sum == 0)
		return sub1(n,W);
	
	// if (sum2 == n-1)
	// 	return sub5(n,U,V);
	if (sum3 == n-1)
		return sub2(n,W);
}

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:50:1: warning: control reaches end of non-void function [-Wreturn-type]
   50 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2904 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 20 ms 4908 KB Output is correct
13 Correct 32 ms 6640 KB Output is correct
14 Correct 38 ms 6472 KB Output is correct
15 Correct 43 ms 6612 KB Output is correct
16 Correct 40 ms 6604 KB Output is correct
17 Correct 36 ms 6612 KB Output is correct
18 Correct 1 ms 2648 KB Output is correct
19 Correct 27 ms 6440 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 27 ms 5564 KB Output is correct
3 Correct 30 ms 5980 KB Output is correct
4 Correct 32 ms 6232 KB Output is correct
5 Correct 33 ms 6236 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 19 ms 4676 KB Output is correct
13 Correct 30 ms 6272 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 27 ms 5724 KB Output is correct
16 Correct 31 ms 6236 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Incorrect 1 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Incorrect 1 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 5976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 5976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2904 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 20 ms 4908 KB Output is correct
13 Correct 32 ms 6640 KB Output is correct
14 Correct 38 ms 6472 KB Output is correct
15 Correct 43 ms 6612 KB Output is correct
16 Correct 40 ms 6604 KB Output is correct
17 Correct 36 ms 6612 KB Output is correct
18 Correct 1 ms 2648 KB Output is correct
19 Correct 27 ms 6440 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 27 ms 5564 KB Output is correct
22 Correct 30 ms 5980 KB Output is correct
23 Correct 32 ms 6232 KB Output is correct
24 Correct 33 ms 6236 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2652 KB Output is correct
29 Correct 1 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 19 ms 4676 KB Output is correct
32 Correct 30 ms 6272 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 27 ms 5724 KB Output is correct
35 Correct 31 ms 6236 KB Output is correct
36 Correct 1 ms 2648 KB Output is correct
37 Incorrect 1 ms 2648 KB Output isn't correct
38 Halted 0 ms 0 KB -