Submission #1099783

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099783		model_code	Nile (IOI24_nile)	C++17	67 / 100	2061 ms	5580 KiB

nile

// time_limit/bakry_q1_fixed.cpp

#include <bits/stdc++.h>

using namespace std ;

vector<long long>calculate_costs(vector<int>W, vector<int>A, vector<int>B, vector<int>E) {
	vector< array<int , 3> >ord;
	int n = W.size(), q = E.size();
	for(int i = 0; i < n; ++i)
		ord.push_back({W[i], A[i], B[i]});
	sort(ord.begin(), ord.end());
	for(int i = 0; i < n; ++i)
		W[i] = ord[i][0], A[i] = ord[i][1], B[i] = ord[i][2];
	vector<long long>v;
	for(int curq = 0; curq < E.size(); ++curq)
	{
		int d = E[curq];
		vector<long long>dp(n+2);
		dp[0] = A[0];
		for(int i = 1; i < n; ++i)
		{
			dp[i] = dp[i-1] + A[i];
			//take i-1
			if(W[i] - W[i-1] <= d)
			{
				if(i == 1)
					dp[i] = min(dp[i], 1ll * B[i] + B[i-1]);
				else
					dp[i] = min(dp[i], B[i] + B[i-1] + dp[i-2]);
			}
			//take i-2
			if(i-2 >= 0 && W[i] - W[i-2] <= d)
			{
				if(i == 2)
					dp[i] = min(dp[i], 1ll * B[i] + B[i-2] + A[i-1]);
				else
					dp[i] = min(dp[i], 1ll * B[i] + B[i-2] + A[i-1] + dp[i-3]); //fix overflow
			}
		}
		v.push_back(dp[n-1]);
	}
	return v;
}

Compilation message (stderr)

nile.cpp: In function 'std::vector<long long int> calculate_costs(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
nile.cpp:16:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int curq = 0; curq < E.size(); ++curq)
      |                    ~~~~~^~~~~~~~~~
nile.cpp:9:20: warning: unused variable 'q' [-Wunused-variable]
    9 |  int n = W.size(), q = E.size();
      |                    ^

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 13 / 13
• Subtask 3: 17 / 17
• Subtask 4: 11 / 11
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18