oj.uz

Submission #866265

# Submission time Handle Problem Language Result Execution time Memory
866265 2023-10-25T16:37:23 Z huangallen Snowball (JOI21_ho_t2) C++17
33 / 100
 2500 ms 2396 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,(n)+1)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int,int>
#define Graph vector<vector<int>>
#define IOS() cin.sync_with_stdio(0),cin.tie(0),cout.tie(0)
const int inf=(1ll<<62);
const int maxn=2e5+5;
const int mod=1e9+7;
signed main() {
    IOS();
    int n,m;
    cin>>n>>m;
    vector<int> x(n+2),sz(n+2);
    x[0]=-inf,x[n+1]=inf;
    REP1(i,n) cin>>x[i];
    int mn=0,mx=0,nw=0;
    REP(i,m) {
        int w;
        cin>>w;
        nw+=w;
        if(w>0) {
            REP1(j,n) {
                sz[j]+=max(min(nw,x[j+1]-x[j]+mn)-max(nw-w,mx),(int)0);
            }
        }
        else {
            REP1(j,n) {
                sz[j]+=max(min(nw-w,mn)-max(nw,x[j-1]-x[j]+mx),(int)0);
            }
        }
        mn=min(mn,nw);
        mx=max(mx,nw);
//        REP1(i,n) cout<<sz[i]<<" ";cout<<"\n";
    }
    REP1(i,n) cout<<sz[i]<<"\n";
    return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 6 ms 524 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 7 ms 460 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 6 ms 524 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 7 ms 460 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 18 ms 2396 KB Output is correct
21 Correct 21 ms 2396 KB Output is correct
22 Correct 71 ms 2180 KB Output is correct
23 Correct 550 ms 1988 KB Output is correct
24 Execution timed out 2510 ms 1768 KB Time limit exceeded
25 Halted 0 ms 0 KB -