oj.uz

Submission #753741

# Submission time Handle Problem Language Result Execution time Memory
753741 2023-06-05T20:05:32 Z epicci23 Rainy Markets (CCO22_day1problem2) C++17
5 / 25
 576 ms 90668 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}




void solve()
{
  int n=in();
  int ar[n+1];
  int ar2[n+1];
  int ar3[n+1];
  for(int i=1;i<=n;i++) ar[i]=in();
  for(int i=1;i<n;i++) ar2[i]=in();
  for(int i=1;i<n;i++) ar3[i]=in();
  
  array<int,3> hm[n+1];
  for(int i=0;i<=n;i++) hm[i]={0,0,0};
  
  for(int i=1;i<n;i++)
  {
    if(ar2[i]>=ar3[i])
    {
      hm[i][1]=ar3[i];
      ar2[i]-=ar3[i];
      ar3[i]=0;
    }
    else
    {
     hm[i][1]=ar2[i];
     ar3[i]-=ar2[i];
     ar2[i]=0;
    }
  }

  for(int i=1;i<n;i++)
  {
    if(ar2[i])
    {
      int xd=min(ar[i],ar2[i]);
      ar[i]-=xd;
      ar2[i]-=xd;
      hm[i][0]+=xd;
      xd=min(ar[i+1],ar2[i]);
      ar[i+1]-=xd;
      ar2[i]-=xd; 
      hm[i][2]+=xd;
      if(ar2[i]>0)
      {
        cout << "NO\n";
        return;
      }
    }
  }
  
  int ans=0;
  
  for(int i=1;i<n;i++)
  {
    int xd=min(hm[i][1],ar[i]);
    hm[i][1]-=xd;
    ar[i]-=xd;
    hm[i][0]+=xd;
    xd=min(hm[i][1],ar[i+1]);
    hm[i][1]-=xd;
    ar[i+1]-=xd;
    hm[i][2]+=xd;
    ans+=hm[i][1];
  }

  cout << "YES\n";
  cout << ans << endl;

  for(int i=1;i<n;i++) cout << hm[i][0] << " " << hm[i][1] << " " << hm[i][2] << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 227 ms 62800 KB Output is correct
5 Correct 275 ms 68704 KB Output is correct
6 Correct 247 ms 62852 KB Output is correct
7 Correct 295 ms 68684 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 656 KB Output is correct
10 Correct 355 ms 59620 KB Output is correct
11 Correct 361 ms 62804 KB Output is correct
12 Correct 475 ms 88596 KB Output is correct
13 Correct 487 ms 83912 KB Output is correct
14 Correct 223 ms 62096 KB Output is correct
15 Correct 462 ms 90572 KB Output is correct
16 Correct 519 ms 90588 KB Output is correct
17 Correct 473 ms 90580 KB Output is correct
18 Correct 483 ms 90668 KB Output is correct
19 Correct 474 ms 90452 KB Output is correct
20 Correct 484 ms 90476 KB Output is correct
21 Correct 478 ms 90328 KB Output is correct
22 Correct 494 ms 87804 KB Output is correct
23 Correct 474 ms 90536 KB Output is correct
24 Correct 525 ms 89800 KB Output is correct
25 Correct 264 ms 68836 KB Output is correct
26 Correct 301 ms 68980 KB Output is correct
27 Correct 482 ms 90544 KB Output is correct
28 Correct 445 ms 88584 KB Output is correct
29 Correct 475 ms 90460 KB Output is correct
30 Correct 487 ms 90544 KB Output is correct
31 Correct 470 ms 89316 KB Output is correct
32 Correct 576 ms 90128 KB Output is correct
33 Correct 277 ms 68960 KB Output is correct
34 Correct 278 ms 68784 KB Output is correct
35 Correct 265 ms 68732 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 2 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 2 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 227 ms 62800 KB Output is correct
5 Correct 275 ms 68704 KB Output is correct
6 Correct 247 ms 62852 KB Output is correct
7 Correct 295 ms 68684 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 656 KB Output is correct
10 Correct 355 ms 59620 KB Output is correct
11 Correct 361 ms 62804 KB Output is correct
12 Correct 475 ms 88596 KB Output is correct
13 Correct 487 ms 83912 KB Output is correct
14 Correct 223 ms 62096 KB Output is correct
15 Correct 462 ms 90572 KB Output is correct
16 Correct 519 ms 90588 KB Output is correct
17 Correct 473 ms 90580 KB Output is correct
18 Correct 483 ms 90668 KB Output is correct
19 Correct 474 ms 90452 KB Output is correct
20 Correct 484 ms 90476 KB Output is correct
21 Correct 478 ms 90328 KB Output is correct
22 Correct 494 ms 87804 KB Output is correct
23 Correct 474 ms 90536 KB Output is correct
24 Correct 525 ms 89800 KB Output is correct
25 Correct 264 ms 68836 KB Output is correct
26 Correct 301 ms 68980 KB Output is correct
27 Correct 482 ms 90544 KB Output is correct
28 Correct 445 ms 88584 KB Output is correct
29 Correct 475 ms 90460 KB Output is correct
30 Correct 487 ms 90544 KB Output is correct
31 Correct 470 ms 89316 KB Output is correct
32 Correct 576 ms 90128 KB Output is correct
33 Correct 277 ms 68960 KB Output is correct
34 Correct 278 ms 68784 KB Output is correct
35 Correct 265 ms 68732 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Incorrect 2 ms 340 KB Output isn't correct
45 Halted 0 ms 0 KB -