제출 #832713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832713		gustason	Fruits (NOI22_fruits)	C++14	6 / 100	1079 ms	12712 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin >> n;
	
	int a[n], c[n];
	
	for(int i = 0; i < n; i++) {
		cin >> a[i];
	}
	
	for(int i = 0; i < n; i++) {
		cin >> c[i];
	}

	int order[n];
	iota(order, order+n, 1);
	vector<ll> ans(n);
	
	do {
		int curr = -1;
		ll val = 0;
		
		for(int i = 0; i < n; i++) {
			if (a[i] != -1 && order[i] != a[i]) {
				goto Out;
			}
		}
		
		for(int i = 0; i < n; i++) {
			if (order[i] > curr) {
				curr = order[i];
				val += c[order[i]-1];
			}
			ans[i] = max(ans[i], val);
		}
	
		Out:;
	} while(next_permutation(order, order+n));

	for(auto& i : ans) {
		cout << i << " ";
	}
	cout << "\n";
	
	
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 13
• Subtask 5: 0 / 23
• Subtask 6: 0 / 42