답안 #505171

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
505171 2022-01-10T22:10:49 Z DanerZein Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
87 ms 8652 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
  int n; cin>>n;
  vector<ll> x,y;
  ll ma=-1;
  for(int i=0;i<n;i++){
    ll a; cin>>a;
    x.push_back(a);
    y.push_back(a);
  }
  vector<ll> in,de;
  in.push_back(0);
  de.resize(n+1);
  ll ac=0;
  for(int i=1;i<n;i++){
    x[i]+=ac;
    if(x[i]<=x[i-1]){
      ac+=(x[i-1]-x[i])+1;
      x[i]=x[i-1]+1;
    }
    in.push_back(ac);
  }
  ac=0;
  for(int i=n-2;i>=0;i--){
    y[i]+=ac;
    if(y[i]<=y[i+1]){
      ac+=(y[i+1]-y[i])+1;
      y[i]=y[i+1]+1;
    }
    de[i]=ac;
    //cout<<ac<<" ";
  }
  //cout<<endl;
  ll res=1e14+1;
  for(int i=0;i<n;i++){
    ll rp=in[i];
    rp+=max((ll)0,de[i]-in[i]);
    res=min(res,rp);
  }
  cout<<res<<endl;
  /*ll res=1e14+1;
  for(int k=0;k<min((int)vma.size(),2);k++){
    int i=vma[k];
    ll ac=0;
    vector<ll> y=x;
    ll c=0;
    for(int j=1;j<=i;j++){
      if(y[j]<=y[j-1]){
	ac+=(y[j-1]-y[j])+1;
	c+=(y[j-1]-y[j])+1;
      }
    }
    y[i]+=ac;
    for(int j=i+1;j<n;j++){
      if(y[j-1]<=y[j]){
	c+=(y[j]-y[j-1])+1;
	ac=0;
	y[j-1]=y[j]+1;
      }
      if(y[j]+ac>=y[j-1]){
	ac=abs(y[j]-y[j-1])-1;
      }
      y[j]+=ac;
    }
    res=min(res,c);
  }
  cout<<res<<endl;*/
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:7:6: warning: unused variable 'ma' [-Wunused-variable]
    7 |   ll ma=-1;
      |      ^~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 79 ms 7964 KB Output is correct
27 Correct 76 ms 8444 KB Output is correct
28 Correct 87 ms 8448 KB Output is correct
29 Correct 80 ms 8488 KB Output is correct
30 Correct 63 ms 8604 KB Output is correct
31 Correct 77 ms 8524 KB Output is correct
32 Correct 75 ms 8476 KB Output is correct
33 Correct 80 ms 8428 KB Output is correct
34 Correct 76 ms 8496 KB Output is correct
35 Correct 73 ms 8476 KB Output is correct
36 Correct 57 ms 8540 KB Output is correct
37 Correct 57 ms 8472 KB Output is correct
38 Correct 76 ms 8556 KB Output is correct
39 Correct 84 ms 8652 KB Output is correct
40 Correct 76 ms 8464 KB Output is correct
41 Correct 77 ms 8596 KB Output is correct
42 Correct 70 ms 8460 KB Output is correct
43 Correct 77 ms 8460 KB Output is correct
44 Correct 81 ms 8496 KB Output is correct
45 Correct 76 ms 8444 KB Output is correct
46 Correct 76 ms 8484 KB Output is correct
47 Correct 77 ms 8448 KB Output is correct
48 Correct 75 ms 8452 KB Output is correct