oj.uz

답안 #727130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727130 2023-04-20T05:03:07 Z iskhakkutbilim 도로 폐쇄 (APIO21_roads) C++14
5 / 100
 48 ms 6128 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
	vector<long long> ans;
	int sub1 = 1, sub2 = 1;
	vector<int> deg(N, 0);
	for(int i = 0;i < N-1; i++){
		deg[U[i]]++, deg[V[i]]++;
		if(U[i] != 0) sub1 = 0;
		if(U[i] != i or V[i] != i+1) sub2 = 0;
	}
	long long sum = 0LL;
	for(int i = 0;i < N-1; i++) sum+= W[i];
	if(sub1){
		ans.push_back(sum);
		sort(W.begin(), W.end());
		for(int i = N - 2;i >= 0; i--){
			sum -= W[i] * 1LL;
			ans.push_back(sum);
		}
	}else if(sub2){
		ans.push_back(sum);
		sum = 0;
		for(int i = 0;i < N-1; i++){
			if(i%2==0) sum+= W[i];
		}
		ans.push_back(sum);
		sum = 0;
		for(int i = 0;i < N-1; i++){
			if(i%2==1) sum+= W[i];
		}
		if(ans.back()>sum){
			ans.pop_back();
			ans.push_back(sum);
		}
		while(ans.size() < N) ans.push_back(0LL);
	}else{
		
	}
	if(ans.size() != N) assert(false);
	return ans;
}


//main(){
//	int N; cin >> N;
//	vector<int> U(N), V(N), W(N);
//	for(int i = 0;i < N-1; i++){
//		cin >> U[i] >> V[i];
//	}
//	for(int i = 0;i < N-1; i++) cin >> W[i];
//	
//	vector<long long> ans = minimum_closure_costs(N, U, V, 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:39:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |   while(ans.size() < N) ans.push_back(0LL);
      |         ~~~~~~~~~~~^~~
roads.cpp:43:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |  if(ans.size() != N) assert(false);
      |     ~~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 28 ms 2860 KB Output is correct
13 Correct 37 ms 4520 KB Output is correct
14 Correct 42 ms 4236 KB Output is correct
15 Correct 46 ms 4420 KB Output is correct
16 Correct 48 ms 4532 KB Output is correct
17 Correct 44 ms 4492 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 35 ms 4292 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 26 ms 6128 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 26 ms 6128 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 28 ms 2860 KB Output is correct
13 Correct 37 ms 4520 KB Output is correct
14 Correct 42 ms 4236 KB Output is correct
15 Correct 46 ms 4420 KB Output is correct
16 Correct 48 ms 4532 KB Output is correct
17 Correct 44 ms 4492 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 35 ms 4292 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Incorrect 36 ms 4036 KB Output isn't correct
22 Halted 0 ms 0 KB -