oj.uz

Submission #701553

# Submission time Handle Problem Language Result Execution time Memory
701553 2023-02-21T13:09:13 Z huomark1001 Snowball (JOI21_ho_t2) C++17
33 / 100
 2500 ms 10192 KB 
#include<bits/stdc++.h>
#include<random>
using namespace std;

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

#define float double
#define ss(n) fixed<<setprecision(n) 
#define ll long long
#define int ll
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define rep(i,a) for(int i=1;i<=a;i++)
#define rep0(i,a) for(int i=0;i<a;i++)
#define F first
#define S second
#define uni(a) a.resize(distance(a.begin(),unique(a.begin(),a.end())));
#define unisort(a) sort(a.begin(),a.end()); uni(a);

ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}

const ld pi=3.14159265358979323846264338327950288419716939931;
const int lar=3e18;
const int mol1=1e9+7;
const int mol2=998244353;
const int MX=2e5+5;


void solve()
{
    int n,q;
    cin>>n>>q;
    int a[n+1];int ans[n+1]={0};
    rep(i,n) cin>>a[i];
    int now=0;
    int mx[q+1]={0},mn[q+1]={0};
    int xx=0,n1=0,n2=0;
    rep(i,q){
        int g;
        cin>>g;
        xx+=g;
        n1=min(n1,xx);
        n2=max(n2,xx);
        mx[i]=max(mx[i],n2);
        mn[i]=min(mn[i],n1);
    }
    rep(i,n){
        if(i==1){
            int hh=mn[q];ans[1]+=abs(hh);
        }
        else{
            int bb=0;int dif=(a[i]-a[i-1]);
            rep(j,q){
                if(mx[j]+abs(mn[j])<dif) {
                    
                }
                else break;
                bb=j;
            }
            int all=mx[bb]+abs(mn[bb]);
            ans[i-1]+=mx[bb];ans[i]+=abs(mn[bb]);
            if(bb!=q){
                if(mx[bb+1]>mx[bb]){
                    ans[i-1]+=dif-all;
                }
                else ans[i]+=dif-all;
            }
        }
    }
    ans[n]+=mx[q];
    rep(i,n) cout<<ans[i]<<"\n";

}

signed main()
{
    IO
    solve();
    return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:39:9: warning: unused variable 'now' [-Wunused-variable]
   39 |     int now=0;
      |         ^~~

Subtask #1
33.0 / 33.0

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

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 4 ms 380 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 6 ms 340 KB Output is correct
20 Correct 28 ms 5472 KB Output is correct
21 Correct 26 ms 5320 KB Output is correct
22 Correct 51 ms 5220 KB Output is correct
23 Correct 218 ms 5044 KB Output is correct
24 Correct 2043 ms 5480 KB Output is correct
25 Execution timed out 2570 ms 10192 KB Time limit exceeded
26 Halted 0 ms 0 KB -