oj.uz

Submission #612358

# Submission time Handle Problem Language Result Execution time Memory
612358 2022-07-29T13:25:15 Z balbit Giraffes (JOI22_giraffes) C++14
59 / 100
 54 ms 28460 KB 
#include <bits/stdc++.h>
using namespace std;

#define int ll
#define ll long long
#define pii pair<int, int>
#define f first
#define s second

#define REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for(int i = 1; i<=n; ++i)
#define FOR(i,a,b) for(int i = a; i<b; ++i)
#define MX(a,b) a = max(a,b)
#define YO(a,b) a = max(a,(short)(b))
#define MN(a,b) a = min(a,b)
#define pb push_back
#define SZ(x) (int)((x).size())
#define ALL(x) (x).begin(),(x).end()
#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<" "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif 

const ll inf = 0x3f3f3f3f3f3f3f3f;
const int maxn = 2e5+5;

short dp[305][305][305];

int p[maxn];

signed main(){
	ios::sync_with_stdio(0), cin.tie(0);
	
	int n; cin>>n;
	REP1(i,n) {
		cin>>p[i]; --p[i];
	}
	REP1(len, n) {
		REP1(i, n-len+1) {
			int j = i+len-1;
			REP(col, n-len+1) {
				int c2 = col+len-1;
				YO(dp[i][j][col], dp[i+1][j][col] + (c2==p[i]));
				YO(dp[i][j][col], dp[i+1][j][col+1] + (col==p[i]));
				YO(dp[i][j][col], dp[i][j-1][col] + (c2==p[j]));
				YO(dp[i][j][col], dp[i][j-1][col+1] + (col==p[j]));

				// bug(i,j,col,dp[i][j][col]);
			}
		}
	}


	cout<<n-dp[1][n][0]<<endl;
	

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 4 ms 3412 KB Output is correct
23 Correct 18 ms 11348 KB Output is correct
24 Correct 37 ms 18892 KB Output is correct
25 Correct 52 ms 26456 KB Output is correct
26 Correct 53 ms 27672 KB Output is correct
27 Correct 53 ms 27920 KB Output is correct
28 Correct 53 ms 28108 KB Output is correct
29 Correct 53 ms 28204 KB Output is correct
30 Correct 54 ms 28460 KB Output is correct

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 4 ms 3412 KB Output is correct
23 Correct 18 ms 11348 KB Output is correct
24 Correct 37 ms 18892 KB Output is correct
25 Correct 52 ms 26456 KB Output is correct
26 Correct 53 ms 27672 KB Output is correct
27 Correct 53 ms 27920 KB Output is correct
28 Correct 53 ms 28108 KB Output is correct
29 Correct 53 ms 28204 KB Output is correct
30 Correct 54 ms 28460 KB Output is correct
31 Runtime error 13 ms 5972 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -