oj.uz

답안 #243368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
243368 2020-07-01T00:46:39 Z AmineWeslati Safety (NOI18_safety) C++14
13 / 100
 2000 ms 5504 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int memo[500][1000];
int t[500];
int N,H;
int mx=0;

int solve(int i, int h){
   if(i==N) return 0;
   if(memo[i][h]!=-1) return memo[i][h];
   int ans=INF;
   for(int j=0; j<=mx+H; j++) if(abs(j-h)<=H) ans=min(ans,solve(i+1,j)+abs(t[i]-j));

   return memo[i][h]=ans;
}

int32_t main(){
   boost;
   memset(memo,-1,sizeof(memo));
	cin>>N>>H;

	for(int i=0; i<N; i++){cin>>t[i]; mx=max(mx,t[i]);}
	if(mx<H){cout << 0 << endl; return 0;}
	int ans=INF;
	for(int i=0; i<=mx; i++) ans=min(ans,solve(0,i));
	cout << ans << endl;

   return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4200 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct
6 Correct 7 ms 4224 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 6 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4224 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2093 ms 4224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2087 ms 5504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4200 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct
6 Correct 7 ms 4224 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 7 ms 4224 KB Output is correct
12 Correct 7 ms 4224 KB Output is correct
13 Correct 99 ms 4352 KB Output is correct
14 Correct 88 ms 4352 KB Output is correct
15 Correct 7 ms 4352 KB Output is correct
16 Correct 277 ms 4448 KB Output is correct
17 Correct 563 ms 4224 KB Output is correct
18 Correct 287 ms 4344 KB Output is correct
19 Correct 85 ms 4224 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4200 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct
6 Correct 7 ms 4224 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 7 ms 4224 KB Output is correct
12 Correct 7 ms 4224 KB Output is correct
13 Correct 99 ms 4352 KB Output is correct
14 Correct 88 ms 4352 KB Output is correct
15 Correct 7 ms 4352 KB Output is correct
16 Correct 277 ms 4448 KB Output is correct
17 Correct 563 ms 4224 KB Output is correct
18 Correct 287 ms 4344 KB Output is correct
19 Correct 85 ms 4224 KB Output is correct
20 Execution timed out 2095 ms 4224 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4200 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct
6 Correct 7 ms 4224 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 7 ms 4224 KB Output is correct
12 Correct 7 ms 4224 KB Output is correct
13 Correct 99 ms 4352 KB Output is correct
14 Correct 88 ms 4352 KB Output is correct
15 Correct 7 ms 4352 KB Output is correct
16 Correct 277 ms 4448 KB Output is correct
17 Correct 563 ms 4224 KB Output is correct
18 Correct 287 ms 4344 KB Output is correct
19 Correct 85 ms 4224 KB Output is correct
20 Execution timed out 2095 ms 4224 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4200 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct
6 Correct 7 ms 4224 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 7 ms 4224 KB Output is correct
12 Correct 7 ms 4224 KB Output is correct
13 Execution timed out 2093 ms 4224 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4224 KB Output is correct
4 Correct 7 ms 4200 KB Output is correct
5 Correct 7 ms 4224 KB Output is correct
6 Correct 7 ms 4224 KB Output is correct
7 Correct 7 ms 4224 KB Output is correct
8 Correct 7 ms 4224 KB Output is correct
9 Correct 6 ms 4224 KB Output is correct
10 Correct 7 ms 4224 KB Output is correct
11 Correct 7 ms 4224 KB Output is correct
12 Correct 7 ms 4224 KB Output is correct
13 Execution timed out 2093 ms 4224 KB Time limit exceeded
14 Halted 0 ms 0 KB -