Submission #1176807

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176807		Kaztaev_Alisher	Nile (IOI24_nile)	C++20	19 / 100	18 ms	4936 KiB

nile

#include <bits/stdc++.h>

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second

using namespace std;
using ll = long long;

const ll N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7;

ll w[N] , a[N] , b[N] , d[N] , n , q;
vector<long long> solve(){
	vector<ll> vec;
	for(int _ = 1; _ <= q; _++){
		ll mn = a[1]-b[1] , sum = 0;
		for(int i = 1; i <= n; i++){
			sum += b[i];
			if(i % 2 == 0){
				if(abs(w[i-1]-w[i+1]) <= d[_]){
					mn = min(mn , a[i]-b[i]);
				}
			} else {
				mn = min(mn , a[i]-b[i]);
			}
		}
		if(n % 2) sum += mn;
		vec.push_back(sum);
	}
	return vec;
}
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
	n = W.size();
	for(int i = 1; i <= n; i++){
		w[i] = W[i-1];
		a[i] = A[i-1];
		b[i] = B[i-1];
	}
	q = E.size();
	for(int i = 1; i <= q; i++){
		d[i] = E[i-1];
	}
	return solve();
}

// int main() {
  // int N;
  // assert(1 == scanf("%d", &N));
  // std::vector<int> W(N), A(N), B(N);
  // for (int i = 0; i < N; i++)
    // assert(3 == scanf("%d%d%d", &W[i], &A[i], &B[i]));
  // int Q;
  // assert(1 == scanf("%d", &Q));
  // std::vector<int> E(Q);
  // for (int j = 0; j < Q; j++)
    // assert(1 == scanf("%d", &E[j]));
  // fclose(stdin);
// 
  // std::vector<long long> R = calculate_costs(W, A, B, E);
// 
  // int S = (int)R.size();
  // for (int j = 0; j < S; j++)
    // printf("%lld\n", R[j]);
  // fclose(stdout);
// 
  // return 0;
// }

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