제출 #710982

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
710982	2023-03-16 06:33:05	emptypringlescan	Rainy Markets (CCO22_day1problem2)	C++17	5 / 25	526 ms	63232 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  long long cap[n],pop[n-1],um[n-1];
  for(int i=0; i<n; i++) cin >> cap[i];
  for(int i=0; i<n-1; i++) cin >> pop[i];
  for(int i=0; i<n-1; i++) cin >> um[i];
  bool cant=false;
  long long left=cap[0];
  for(int i=0; i<n-1; i++){
    long long peep=max(pop[i]-left-um[i],0LL);
    left=cap[i+1]-peep;
    if(left<0) cant=true;
  }
  if(cant){
    cout << "NO";
    return 0;
  }
  long long fill[n],buy[n-1];
  memset(fill,0,sizeof(fill));
  memset(buy,0,sizeof(buy));
  for(int i=0; i<n-1; i++){
    long long space=cap[i]-fill[i],peep=pop[i];
    if(space>=pop[i]){
      fill[i]+=pop[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 9