oj.uz

Submission #851548

# Submission time Handle Problem Language Result Execution time Memory
851548 2023-09-20T06:14:23 Z bachhoangxuan Rainy Markets (CCO22_day1problem2) C++17
5 / 25
 458 ms 83024 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,b[maxn],p[maxn],u[maxn];
pii a[maxn];

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> b[i];
    for(int i=1;i<n;i++) cin >> p[i];
    for(int i=1;i<n;i++) cin >> u[i];
    for(int i=1;i<n;i++){
        int d=min(p[i],b[i]-a[i].fi);
        a[i].se+=d;p[i]-=d;
        d=min(p[i],b[i+1]);
        a[i+1].fi=d;p[i]-=d;
    }
    for(int i=n-1;i>=1;i--){
        int d=min(b[i+1]-a[i+1].fi-a[i+1].se,p[i]+a[i].se);
        a[i+1].fi+=d;
        int k=min(d,p[i]);
        p[i]-=k;d-=k;a[i].se-=d;
    }
    int res=0;
    for(int i=1;i<n;i++){
        if(u[i]>=p[i]){
            int d=min({a[i+1].fi,u[i]-p[i],p[i+1]+a[i+2].se});
            p[i]+=d;a[i+1].fi-=d;
            a[i+1].se+=d;
            int k=min(p[i+1],d);
            p[i+1]-=k;a[i+2].se-=(d-k);
        }
        else{
            int d=min(p[i]-u[i],a[i+1].se);
            a[i+1].se-=d;p[i+1]+=d;
            p[i]-=d;a[i+1].fi+=d;
        }
        if(p[i]>u[i]){
            cout << "NO\n";
            return;
        }
        res+=p[i];
    }
    cout << "YES\n";
    cout << res << '\n';
    for(int i=1;i<n;i++) cout << a[i].se << ' ' << p[i] << ' ' << a[i+1].fi << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6608 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 167 ms 55084 KB Output is correct
5 Correct 191 ms 61016 KB Output is correct
6 Correct 180 ms 55120 KB Output is correct
7 Correct 205 ms 61256 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 281 ms 51840 KB Output is correct
11 Correct 304 ms 55120 KB Output is correct
12 Correct 437 ms 80988 KB Output is correct
13 Correct 368 ms 76072 KB Output is correct
14 Correct 171 ms 54344 KB Output is correct
15 Correct 378 ms 82736 KB Output is correct
16 Correct 387 ms 82768 KB Output is correct
17 Correct 402 ms 82848 KB Output is correct
18 Correct 383 ms 82888 KB Output is correct
19 Correct 385 ms 83024 KB Output is correct
20 Correct 377 ms 82772 KB Output is correct
21 Correct 381 ms 82492 KB Output is correct
22 Correct 393 ms 80228 KB Output is correct
23 Correct 383 ms 82792 KB Output is correct
24 Correct 383 ms 81996 KB Output is correct
25 Correct 234 ms 61016 KB Output is correct
26 Correct 218 ms 61392 KB Output is correct
27 Correct 458 ms 82772 KB Output is correct
28 Correct 400 ms 80856 KB Output is correct
29 Correct 398 ms 82912 KB Output is correct
30 Correct 398 ms 82916 KB Output is correct
31 Correct 378 ms 81632 KB Output is correct
32 Correct 385 ms 82756 KB Output is correct
33 Correct 200 ms 61264 KB Output is correct
34 Correct 213 ms 61156 KB Output is correct
35 Correct 203 ms 60976 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 6.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6608 KB Output is correct
3 Correct 1 ms 6744 KB Output is correct
4 Correct 167 ms 55084 KB Output is correct
5 Correct 191 ms 61016 KB Output is correct
6 Correct 180 ms 55120 KB Output is correct
7 Correct 205 ms 61256 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 281 ms 51840 KB Output is correct
11 Correct 304 ms 55120 KB Output is correct
12 Correct 437 ms 80988 KB Output is correct
13 Correct 368 ms 76072 KB Output is correct
14 Correct 171 ms 54344 KB Output is correct
15 Correct 378 ms 82736 KB Output is correct
16 Correct 387 ms 82768 KB Output is correct
17 Correct 402 ms 82848 KB Output is correct
18 Correct 383 ms 82888 KB Output is correct
19 Correct 385 ms 83024 KB Output is correct
20 Correct 377 ms 82772 KB Output is correct
21 Correct 381 ms 82492 KB Output is correct
22 Correct 393 ms 80228 KB Output is correct
23 Correct 383 ms 82792 KB Output is correct
24 Correct 383 ms 81996 KB Output is correct
25 Correct 234 ms 61016 KB Output is correct
26 Correct 218 ms 61392 KB Output is correct
27 Correct 458 ms 82772 KB Output is correct
28 Correct 400 ms 80856 KB Output is correct
29 Correct 398 ms 82912 KB Output is correct
30 Correct 398 ms 82916 KB Output is correct
31 Correct 378 ms 81632 KB Output is correct
32 Correct 385 ms 82756 KB Output is correct
33 Correct 200 ms 61264 KB Output is correct
34 Correct 213 ms 61156 KB Output is correct
35 Correct 203 ms 60976 KB Output is correct
36 Correct 1 ms 6488 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6488 KB Output is correct
39 Correct 1 ms 6488 KB Output is correct
40 Correct 2 ms 6488 KB Output is correct
41 Correct 2 ms 6488 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6488 KB Output is correct
44 Incorrect 2 ms 6488 KB Output isn't correct
45 Halted 0 ms 0 KB -