oj.uz

Submission #219000

# Submission time Handle Problem Language Result Execution time Memory
219000 2020-04-03T11:10:04 Z pavement Cloud Computing (CEOI18_clo) C++17
36 / 100
 799 ms 1664 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
typedef long double ld;

int N, M, f, c, v, idx1, idx2, dp[100005];
vector<tuple<int, int, int> > F, S;
vector<pair<int, bool> > V;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1, c, f, v; i <= N; i++) {
		cin >> c >> f >> v;
		F.eb(-f, c, v);
	}
	cin >> M;
	for (int i = 1; i <= M; i++) {
		cin >> c >> f >> v;
		S.eb(-f, c, v);
	}
	sort(F.begin(), F.end());
	sort(S.begin(), S.end());
	while (idx1 < F.size() && idx2 < S.size())
		if (get<0>(F[idx1]) < get<0>(S[idx2])) V.eb(idx1++, 0);
		else V.eb(idx2++, 1);
	while (idx1 < F.size()) V.eb(idx1++, 0);
	while (idx2 < S.size()) V.eb(idx2++, 1);
	fill(dp + 1, dp + 100005, -1e18);
	for (int i = N + M - 1; i >= 0; i--) {
		if (V[i].second)
			for (int j = 100000; j >= get<1>(S[V[i].first]); j--)
				dp[j] = max(dp[j], dp[j - get<1>(S[V[i].first])] + get<2>(S[V[i].first]));
		else
			for (int j = 0; j <= 100000 - get<1>(F[V[i].first]); j++)
				dp[j] = max(dp[j], dp[j + get<1>(F[V[i].first])] - get<2>(F[V[i].first]));
	}
	cout << dp[0] << '\n';
}

Compilation message

clo.cpp:15:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
clo.cpp: In function 'int main()':
clo.cpp:30:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (idx1 < F.size() && idx2 < S.size())
         ~~~~~^~~~~~~~~~
clo.cpp:30:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (idx1 < F.size() && idx2 < S.size())
                            ~~~~~^~~~~~~~~~
clo.cpp:33:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (idx1 < F.size()) V.eb(idx1++, 0);
         ~~~~~^~~~~~~~~~
clo.cpp:34:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (idx2 < S.size()) V.eb(idx2++, 1);
         ~~~~~^~~~~~~~~~

Subtask #1
0 / 18.0

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

Subtask #2
0 / 18.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1152 KB Output is correct
2 Correct 11 ms 1152 KB Output is correct
3 Correct 38 ms 1152 KB Output is correct
4 Correct 39 ms 1152 KB Output is correct
5 Correct 73 ms 1152 KB Output is correct
6 Correct 75 ms 1152 KB Output is correct
7 Correct 100 ms 1152 KB Output is correct
8 Correct 111 ms 1152 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 37 ms 1180 KB Output is correct
3 Correct 164 ms 1152 KB Output is correct
4 Correct 407 ms 1280 KB Output is correct
5 Correct 799 ms 1664 KB Output is correct
6 Correct 763 ms 1408 KB Output is correct

Subtask #6
0 / 10.0

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