oj.uz

Submission #971456

# Submission time Handle Problem Language Result Execution time Memory
971456 2024-04-28T14:30:24 Z KiaRez Rainy Markets (CCO22_day1problem2) C++17
11 / 25
 169 ms 29900 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll n, ans, res[3][N], b[N], p[N], u[N], dp[N], par[N];
// 0->l 1->mid 2->r
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
    for(int i=1; i<=n; i++) cin>>b[i];
    for(int i=1; i<=n-1; i++) cin>>p[i];
    for(int i=1; i<=n-1; i++) cin>>u[i];

    for(int i=1; i<n; i++) {
        ll tmp = min(b[i]-res[2][i-1], p[i]);
        p[i] -= tmp; res[0][i] = tmp;
        tmp = min(u[i], p[i]);
        p[i] -= tmp; res[1][i] = tmp;
        tmp = min(b[i+1], p[i]);
        p[i] -= tmp; res[2][i] = tmp;
    }

    for(int i=n-1; i>=1; i--) {
        ll tmp = min(res[1][i], b[i+1]-res[2][i]-res[0][i+1]);
        res[1][i] -= tmp; res[2][i] += tmp;
        tmp = min(res[0][i], b[i+1]-res[2][i]-res[0][i+1]);
        res[0][i] -= tmp; res[2][i] += tmp;
    }

    for(int i=1; i<=n; i++) {
        if(p[i] > 0) {
            cout<<"NO\n";
            return 0;
        }
        ans += res[1][i];
    }

    cout<<"YES\n";
    cout<<ans<<endl;
    for(int i=1; i<n; i++) {
        cout<<res[0][i]<<' '<<res[1][i]<<' '<<res[2][i]<<endl;
    }

	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Runtime error 169 ms 29900 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10724 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 2 ms 10760 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 3 ms 10584 KB Output is correct
23 Correct 3 ms 10584 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10588 KB Output is correct
34 Correct 2 ms 10712 KB Output is correct
35 Correct 2 ms 10588 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 1 ms 10588 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10724 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 2 ms 10760 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 3 ms 10584 KB Output is correct
23 Correct 3 ms 10584 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10588 KB Output is correct
34 Correct 2 ms 10712 KB Output is correct
35 Correct 2 ms 10588 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 1 ms 10588 KB Output is correct
38 Correct 3 ms 10588 KB Output is correct
39 Correct 2 ms 10588 KB Output is correct
40 Correct 2 ms 10588 KB Output is correct
41 Correct 2 ms 10588 KB Output is correct
42 Correct 1 ms 10588 KB Output is correct
43 Correct 2 ms 10588 KB Output is correct
44 Correct 2 ms 10708 KB Output is correct
45 Correct 2 ms 10588 KB Output is correct
46 Correct 2 ms 10588 KB Output is correct
47 Correct 2 ms 10588 KB Output is correct
48 Correct 3 ms 10588 KB Output is correct
49 Correct 3 ms 10588 KB Output is correct
50 Correct 3 ms 10588 KB Output is correct
51 Correct 3 ms 10588 KB Output is correct
52 Correct 3 ms 10588 KB Output is correct
53 Correct 2 ms 10588 KB Output is correct
54 Correct 4 ms 10588 KB Output is correct
55 Correct 3 ms 10588 KB Output is correct
56 Correct 3 ms 10588 KB Output is correct
57 Correct 3 ms 10588 KB Output is correct
58 Correct 3 ms 10584 KB Output is correct
59 Correct 3 ms 10588 KB Output is correct
60 Correct 3 ms 10740 KB Output is correct
61 Correct 3 ms 10588 KB Output is correct
62 Correct 3 ms 10588 KB Output is correct
63 Correct 3 ms 10588 KB Output is correct
64 Correct 2 ms 10588 KB Output is correct
65 Correct 2 ms 10588 KB Output is correct
66 Correct 3 ms 10588 KB Output is correct
67 Correct 3 ms 10588 KB Output is correct
68 Correct 3 ms 10584 KB Output is correct
69 Correct 3 ms 10840 KB Output is correct
70 Correct 3 ms 10584 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Runtime error 169 ms 29900 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -