Submission #1151585

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151585		KaleemRazaSyed	Bikeparking (EGOI24_bikeparking)	C++20	25 / 100	153 ms	16844 KiB

Main

#include<bits/stdc++.h>

using namespace std;

int main()
{
  int n;
  cin >> n;
  
  int x[n], y[n];
  for(int i = 0; i < n; i ++)
    cin >> x[i];  
  for(int i = 0; i < n; i ++)
    cin >> y[i];
  
  int sm = 0;
  for(int i = 0; i < n; i ++)
    sm += y[i];
	  
  for(int i = 0; i < n; i ++)
    {
      x[i] = min(sm, x[i]);
      sm -= x[i];
    }
	  
  int ans = 0;
  set<int> st;
  for(int i = 0; i < n; i ++) {
    if(x[i] > 0)
      st.insert(i);
  }

  for(int i = n - 1; i >= 0; i--)
    {
      while(y[i] > 0)
	{
	  auto it = st.lower_bound(i);
	  if(it != st.begin())
	    {
	      it--;
	      int j = *it;
	      int mi = min(y[i], x[j]);
	      y[i] -= mi;
	      x[j] -= mi;
	      ans += mi;
	      if(x[j] == 0) st.erase(j); 
	    }
	  else
	    {
	      it--;
	      int j = *it;
	      int mi = min(y[i], x[j]);
	      y[i] -= mi;
	      x[j] -= mi;
	      if(j > i)
		ans -= mi;
	      if(x[j] == 0) st.erase(j); 
	    }
	}
    }
  cout << ans << endl;
  return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 9 / 9
• Subtask 3: 0 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32