oj.uz

Submission #419699

# Submission time Handle Problem Language Result Execution time Memory
419699 2021-06-07T11:42:12 Z Kerim Group Photo (JOI21_ho_t3) C++17
44 / 100
 2722 ms 836 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=202;
int n,arr[N],inv[N][N],dp[N][N];
int F[N][N];
int g(int x,int y){
	int res=0;
	for(int i=y;i>=x;i--)
		for(int j=i-1;j>=x;j--)
			res+=inv[i][j];
	return res;
}
int f(int x,int y,int xx,int yy){
	int res=0;
	for(int i=x;i<=y;i++)
		for(int j=xx;j<=yy;j++)
			res+=inv[i][j];
	return res;
}
int pre(int x,int y,int z){
	int res=0;
	for(int i=x;i<=y;i++)
		res+=inv[i][z];
	return res;
}
int suf(int z,int x,int y){
	int res=0;
	for(int i=x;i<=y;i++)
		res+=inv[z][i];
	return res;
}
int cost(int a,int b,int c){
	int res=g(a+1,b-1)+F[a][b-1]+suf(b,a+1,b-1);
	if(c)res+=pre(1,b,c);
	return res;
}
int rec(int a,int b){
	if(b==n)return cost(a,b,0);
	int &ret=dp[a][b];
	if(~ret)return ret;
	ret=INF;
	for(int i=b+1;i<=n;i++)
		umin(ret,rec(b,i)+cost(a,b,i));
	return ret;
}
int main(){
	//freopen("file.in", "r", stdin);
	memset(dp,-1,sizeof dp);
	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 y=1;y<=n;y++)
		for(int z=y+1;z<=n;z++){
			F[y][z]=F[y][z-1];
			for(int x=1;x<=y;x++)
				F[y][z]+=inv[x][z];
		}
	int ans=INF;
	for(int i=1;i<=n;i++)
		umin(ans,rec(0,i));
	printf("%d\n",ans);
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:66:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
Main.cpp:67:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |  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 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2230 ms 764 KB Output is correct
22 Correct 2263 ms 772 KB Output is correct
23 Correct 2280 ms 836 KB Output is correct
24 Correct 2461 ms 764 KB Output is correct
25 Correct 2439 ms 760 KB Output is correct
26 Correct 2613 ms 760 KB Output is correct
27 Correct 2722 ms 764 KB Output is correct
28 Correct 2597 ms 760 KB Output is correct
29 Correct 2585 ms 760 KB Output is correct
30 Correct 2359 ms 760 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2230 ms 764 KB Output is correct
22 Correct 2263 ms 772 KB Output is correct
23 Correct 2280 ms 836 KB Output is correct
24 Correct 2461 ms 764 KB Output is correct
25 Correct 2439 ms 760 KB Output is correct
26 Correct 2613 ms 760 KB Output is correct
27 Correct 2722 ms 764 KB Output is correct
28 Correct 2597 ms 760 KB Output is correct
29 Correct 2585 ms 760 KB Output is correct
30 Correct 2359 ms 760 KB Output is correct
31 Runtime error 1 ms 716 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 2230 ms 764 KB Output is correct
22 Correct 2263 ms 772 KB Output is correct
23 Correct 2280 ms 836 KB Output is correct
24 Correct 2461 ms 764 KB Output is correct
25 Correct 2439 ms 760 KB Output is correct
26 Correct 2613 ms 760 KB Output is correct
27 Correct 2722 ms 764 KB Output is correct
28 Correct 2597 ms 760 KB Output is correct
29 Correct 2585 ms 760 KB Output is correct
30 Correct 2359 ms 760 KB Output is correct
31 Runtime error 1 ms 716 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -