oj.uz

Submission #165389

# Submission time Handle Problem Language Result Execution time Memory
165389 2019-11-26T18:50:49 Z Lawliet Cloud Computing (CEOI18_clo) C++14
18 / 100
 5 ms 1912 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;
typedef long long int lli;

const int MAXN = 300;

int n, m;

lli dp[MAXN][MAXN];

vector< pii > buy;
vector< pii > sell;

lli solve(int i, int j)
{
	if( i < 0 || j < 0 ) return 0;

	lli& ans = dp[i][j];

	if( ans != -1 ) return ans;
	
	ans = max( solve( i - 1 , j ) , solve( i , j - 1 ) );

	if( buy[i].first >= sell[j].first )
	{
		lli cost = sell[j].second - buy[i].second;
		ans = max( ans , solve( i - 1 , j - 1 ) + cost );
	}

	ans = max( ans , 0LL );

	return ans;
}

int main()
{
	scanf("%d",&n);

	for(int i = 1 ; i <= n ; i++)
	{
		int c, f, v;
		scanf("%d %d %d",&c,&f,&v);

		buy.push_back( { f , v } );
	}

	scanf("%d",&m);

	for(int i = 1 ; i <= m ; i++)
	{
		int c, f, v;
		scanf("%d %d %d",&c,&f,&v);

		sell.push_back( { f , v } );
	}

	memset( dp , -1 , sizeof(dp) );

	sort(buy.begin() , buy.end());
	sort(sell.begin() , sell.end());

	printf("%lld\n",solve( n - 1 , m - 1 ));
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
clo.cpp:44:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&c,&f,&v);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~
clo.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&m);
  ~~~~~^~~~~~~~~
clo.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&c,&f,&v);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 3 ms 1016 KB Output is correct
3 Incorrect 3 ms 1016 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 1016 KB Output is correct
3 Incorrect 4 ms 1016 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 5 ms 1016 KB Output is correct
6 Correct 4 ms 1016 KB Output is correct
7 Correct 4 ms 1144 KB Output is correct
8 Correct 5 ms 1144 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 1020 KB Output is correct
3 Runtime error 4 ms 1912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 3 ms 1016 KB Output is correct
3 Incorrect 3 ms 1016 KB Output isn't correct
4 Halted 0 ms 0 KB -