제출 #1105252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105252		xydwe12312	Cloud Computing (CEOI18_clo)	C++14	54 / 100	295 ms	1360 KiB

clo

#include <bits/stdc++.h>
using namespace std;

// Macros
#define pb          push_back
#define pf          push_front
#define ff          first
#define ss          second
#define all(v)      v.begin(), v.end()
#define rall(v)     v.rbegin(), v.rend()
#define up(v)       upper_bound(v)
#define low(v)      lower_bound(v)

// Read and Print
#define read(a, n) for(ll i = 0; i < n; ++i) cin >> a[i];
#define print(a, n) for(ll i = 0; i < n; ++i){ cout << a[i] << " ";} cout << "\n";
#define endl "\n"
#define sp " "

// Typedefs
typedef long long ll;
typedef long double ld;
typedef long long int lli;
typedef pair<ll, ll> pll;
typedef pair<lli, lli> plli;
typedef pair<ll, ll> pii; // Changed to ll
typedef vector<lli> vi;
typedef vector<vector<lli>> vvi;
using vec = vector<ll>; // Changed to ll

// Constants
const ll mxn = 1e6 + 5;
const ll mod = 1e9 + 7;

// Solve
const ll N = 1e5 + 5;

void solve() {

	ll n; cin >> n;
	vi c(n), f(n), v(n);

	vector<tuple<ll, ll, ll>> a; // Changed to ll
	ll sum = 0;
	for (ll i = 0; i < n; i++) {
		cin >> c[i] >> f[i] >> v[i];
		a.pb({f[i], c[i], -v[i]});
		sum += c[i];
	}


	ll m;  // Changed to ll
	cin >> m;
	vector<ll> C(m), F(m), V(m); // Changed to ll
	for (ll i = 0; i < m; i++) { // Changed to ll
		cin >> C[i] >> F[i] >> V[i];
		a.pb({F[i], C[i], V[i]});
	}

	sort(rall(a));
	vi dp(sum + 1, -2e18);
	dp[0] = 0;

	for (auto &[i, j, k] : a) {
		if (k > 0) {
			for (ll l = j; l <= sum; l++) { // Changed to ll
				dp[l - j] = max(dp[l - j], dp[l] + k);
			}
		} else {
			for (ll l = sum - j; l >= 0; l--) { // Changed to ll
				dp[l + j] = max(dp[l + j], dp[l] + k);
			}
		}
	}
	sort(rall(dp));
	cout << dp[0] << endl;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	solve();
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

clo.cpp: In function 'void solve()':
clo.cpp:64:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |  for (auto &[i, j, k] : a) {
      |             ^

• Subtask 1: 18 / 18
• Subtask 2: 0 / 18
• Subtask 3: 18 / 18
• Subtask 4: 0 / 18
• Subtask 5: 18 / 18
• Subtask 6: 0 / 10