oj.uz

Submission #419768

# Submission time Handle Problem Language Result Execution time Memory
419768 2021-06-07T12:39:01 Z Kerim Group Photo (JOI21_ho_t3) C++17
64 / 100
 5000 ms 665220 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;
 
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=5002;
int n,arr[N],inv[N][N],dp[N][N],odp[N][N];
int F[N][N],AB[N][N],BA[N][N],par[N][N],G[N][N];
int g(int x,int y){
	if(x>=y)return 0;
	if(~odp[x][y])return odp[x][y];
	return odp[x][y]=g(x,y-1)+par[y][y]-par[x-1][y];
}
int cost(int a,int b,int c){
	return g(a+1,b-1)+F[a][b-1]+(BA[b][b-1]-BA[b][a])+AB[c][b];
}
int main(){
	//freopen("file.in", "r", stdin);
	memset(odp,-1,sizeof odp);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",arr+i);
	for(int i=2;i<=n;i++)
		for(int j=1;j<i;j++)
			inv[arr[i]][arr[j]]++;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			par[i][j]=par[i-1][j]+inv[j][i];
	for(int z=1;z<=n;z++)
		for(int x=1;x<=n;x++)
			G[x][z]=G[x-1][z]+inv[x][z];
	for(int y=1;y<=n;y++)
		for(int z=y+1;z<=n;z++)
			F[y][z]=F[y][z-1]+G[y][z];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++){
			BA[i][j]=BA[i][j-1]+inv[i][j];
			AB[i][j]=AB[i][j-1]+inv[j][i];
		}
	int ret;
	for(int a=n;a>=0;a--)
		for(int b=a+1;b<=n;b++){
			if(b==n){
				dp[a][b]=cost(a,b,0);
				continue;
			}
			ret=INF;
			for(int i=b+1;i<=n;i++)
				umin(ret,dp[b][i]+cost(a,b,i));
			dp[a][b]=ret;
		}
	
	int ans=INF;
	for(int i=1;i<=n;i++)
		umin(ans,dp[0][i]);
	printf("%d\n",ans);
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
Main.cpp:35:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  for(int i=1;i<=n;i++)scanf("%d",arr+i);
      |                       ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 98180 KB Output is correct
2 Correct 42 ms 98236 KB Output is correct
3 Correct 42 ms 98276 KB Output is correct
4 Correct 41 ms 98296 KB Output is correct
5 Correct 46 ms 98344 KB Output is correct
6 Correct 41 ms 98340 KB Output is correct
7 Correct 45 ms 98376 KB Output is correct
8 Correct 42 ms 98484 KB Output is correct
9 Correct 42 ms 98492 KB Output is correct
10 Correct 42 ms 98508 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 98180 KB Output is correct
2 Correct 42 ms 98236 KB Output is correct
3 Correct 42 ms 98276 KB Output is correct
4 Correct 41 ms 98296 KB Output is correct
5 Correct 46 ms 98344 KB Output is correct
6 Correct 41 ms 98340 KB Output is correct
7 Correct 45 ms 98376 KB Output is correct
8 Correct 42 ms 98484 KB Output is correct
9 Correct 42 ms 98492 KB Output is correct
10 Correct 42 ms 98508 KB Output is correct
11 Correct 41 ms 98680 KB Output is correct
12 Correct 43 ms 98760 KB Output is correct
13 Correct 43 ms 98776 KB Output is correct
14 Correct 43 ms 98704 KB Output is correct
15 Correct 47 ms 98680 KB Output is correct
16 Correct 42 ms 98676 KB Output is correct
17 Correct 44 ms 98688 KB Output is correct
18 Correct 41 ms 98676 KB Output is correct
19 Correct 43 ms 98856 KB Output is correct
20 Correct 43 ms 98708 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 98180 KB Output is correct
2 Correct 42 ms 98236 KB Output is correct
3 Correct 42 ms 98276 KB Output is correct
4 Correct 41 ms 98296 KB Output is correct
5 Correct 46 ms 98344 KB Output is correct
6 Correct 41 ms 98340 KB Output is correct
7 Correct 45 ms 98376 KB Output is correct
8 Correct 42 ms 98484 KB Output is correct
9 Correct 42 ms 98492 KB Output is correct
10 Correct 42 ms 98508 KB Output is correct
11 Correct 41 ms 98680 KB Output is correct
12 Correct 43 ms 98760 KB Output is correct
13 Correct 43 ms 98776 KB Output is correct
14 Correct 43 ms 98704 KB Output is correct
15 Correct 47 ms 98680 KB Output is correct
16 Correct 42 ms 98676 KB Output is correct
17 Correct 44 ms 98688 KB Output is correct
18 Correct 41 ms 98676 KB Output is correct
19 Correct 43 ms 98856 KB Output is correct
20 Correct 43 ms 98708 KB Output is correct
21 Correct 49 ms 104644 KB Output is correct
22 Correct 49 ms 104724 KB Output is correct
23 Correct 49 ms 104712 KB Output is correct
24 Correct 49 ms 104748 KB Output is correct
25 Correct 49 ms 104772 KB Output is correct
26 Correct 51 ms 104704 KB Output is correct
27 Correct 71 ms 104752 KB Output is correct
28 Correct 49 ms 104800 KB Output is correct
29 Correct 50 ms 104796 KB Output is correct
30 Correct 51 ms 104764 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 98180 KB Output is correct
2 Correct 42 ms 98236 KB Output is correct
3 Correct 42 ms 98276 KB Output is correct
4 Correct 41 ms 98296 KB Output is correct
5 Correct 46 ms 98344 KB Output is correct
6 Correct 41 ms 98340 KB Output is correct
7 Correct 45 ms 98376 KB Output is correct
8 Correct 42 ms 98484 KB Output is correct
9 Correct 42 ms 98492 KB Output is correct
10 Correct 42 ms 98508 KB Output is correct
11 Correct 41 ms 98680 KB Output is correct
12 Correct 43 ms 98760 KB Output is correct
13 Correct 43 ms 98776 KB Output is correct
14 Correct 43 ms 98704 KB Output is correct
15 Correct 47 ms 98680 KB Output is correct
16 Correct 42 ms 98676 KB Output is correct
17 Correct 44 ms 98688 KB Output is correct
18 Correct 41 ms 98676 KB Output is correct
19 Correct 43 ms 98856 KB Output is correct
20 Correct 43 ms 98708 KB Output is correct
21 Correct 49 ms 104644 KB Output is correct
22 Correct 49 ms 104724 KB Output is correct
23 Correct 49 ms 104712 KB Output is correct
24 Correct 49 ms 104748 KB Output is correct
25 Correct 49 ms 104772 KB Output is correct
26 Correct 51 ms 104704 KB Output is correct
27 Correct 71 ms 104752 KB Output is correct
28 Correct 49 ms 104800 KB Output is correct
29 Correct 50 ms 104796 KB Output is correct
30 Correct 51 ms 104764 KB Output is correct
31 Correct 390 ms 135580 KB Output is correct
32 Correct 377 ms 135696 KB Output is correct
33 Correct 369 ms 135648 KB Output is correct
34 Correct 359 ms 135840 KB Output is correct
35 Correct 404 ms 135784 KB Output is correct
36 Correct 388 ms 135740 KB Output is correct
37 Correct 356 ms 135760 KB Output is correct
38 Correct 357 ms 135704 KB Output is correct
39 Correct 355 ms 135860 KB Output is correct
40 Correct 370 ms 135656 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 98180 KB Output is correct
2 Correct 42 ms 98236 KB Output is correct
3 Correct 42 ms 98276 KB Output is correct
4 Correct 41 ms 98296 KB Output is correct
5 Correct 46 ms 98344 KB Output is correct
6 Correct 41 ms 98340 KB Output is correct
7 Correct 45 ms 98376 KB Output is correct
8 Correct 42 ms 98484 KB Output is correct
9 Correct 42 ms 98492 KB Output is correct
10 Correct 42 ms 98508 KB Output is correct
11 Correct 41 ms 98680 KB Output is correct
12 Correct 43 ms 98760 KB Output is correct
13 Correct 43 ms 98776 KB Output is correct
14 Correct 43 ms 98704 KB Output is correct
15 Correct 47 ms 98680 KB Output is correct
16 Correct 42 ms 98676 KB Output is correct
17 Correct 44 ms 98688 KB Output is correct
18 Correct 41 ms 98676 KB Output is correct
19 Correct 43 ms 98856 KB Output is correct
20 Correct 43 ms 98708 KB Output is correct
21 Correct 49 ms 104644 KB Output is correct
22 Correct 49 ms 104724 KB Output is correct
23 Correct 49 ms 104712 KB Output is correct
24 Correct 49 ms 104748 KB Output is correct
25 Correct 49 ms 104772 KB Output is correct
26 Correct 51 ms 104704 KB Output is correct
27 Correct 71 ms 104752 KB Output is correct
28 Correct 49 ms 104800 KB Output is correct
29 Correct 50 ms 104796 KB Output is correct
30 Correct 51 ms 104764 KB Output is correct
31 Correct 390 ms 135580 KB Output is correct
32 Correct 377 ms 135696 KB Output is correct
33 Correct 369 ms 135648 KB Output is correct
34 Correct 359 ms 135840 KB Output is correct
35 Correct 404 ms 135784 KB Output is correct
36 Correct 388 ms 135740 KB Output is correct
37 Correct 356 ms 135760 KB Output is correct
38 Correct 357 ms 135704 KB Output is correct
39 Correct 355 ms 135860 KB Output is correct
40 Correct 370 ms 135656 KB Output is correct
41 Execution timed out 5079 ms 665220 KB Time limit exceeded
42 Halted 0 ms 0 KB -