oj.uz

답안 #419766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419766 2021-06-07T12:37:38 Z Kerim Group Photo (JOI21_ho_t3) C++17
64 / 100
 5000 ms 752204 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(dp,-1,sizeof dp);
	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:35:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
Main.cpp:36:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |  for(int i=1;i<=n;i++)scanf("%d",arr+i);
      |                       ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 196176 KB Output is correct
2 Correct 93 ms 196160 KB Output is correct
3 Correct 83 ms 196168 KB Output is correct
4 Correct 83 ms 196192 KB Output is correct
5 Correct 96 ms 196320 KB Output is correct
6 Correct 87 ms 196292 KB Output is correct
7 Correct 96 ms 196292 KB Output is correct
8 Correct 84 ms 196268 KB Output is correct
9 Correct 91 ms 196308 KB Output is correct
10 Correct 86 ms 196268 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 196176 KB Output is correct
2 Correct 93 ms 196160 KB Output is correct
3 Correct 83 ms 196168 KB Output is correct
4 Correct 83 ms 196192 KB Output is correct
5 Correct 96 ms 196320 KB Output is correct
6 Correct 87 ms 196292 KB Output is correct
7 Correct 96 ms 196292 KB Output is correct
8 Correct 84 ms 196268 KB Output is correct
9 Correct 91 ms 196308 KB Output is correct
10 Correct 86 ms 196268 KB Output is correct
11 Correct 84 ms 196568 KB Output is correct
12 Correct 86 ms 196548 KB Output is correct
13 Correct 85 ms 196548 KB Output is correct
14 Correct 90 ms 196656 KB Output is correct
15 Correct 84 ms 196628 KB Output is correct
16 Correct 82 ms 196548 KB Output is correct
17 Correct 82 ms 196560 KB Output is correct
18 Correct 83 ms 196600 KB Output is correct
19 Correct 94 ms 196592 KB Output is correct
20 Correct 86 ms 196584 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 196176 KB Output is correct
2 Correct 93 ms 196160 KB Output is correct
3 Correct 83 ms 196168 KB Output is correct
4 Correct 83 ms 196192 KB Output is correct
5 Correct 96 ms 196320 KB Output is correct
6 Correct 87 ms 196292 KB Output is correct
7 Correct 96 ms 196292 KB Output is correct
8 Correct 84 ms 196268 KB Output is correct
9 Correct 91 ms 196308 KB Output is correct
10 Correct 86 ms 196268 KB Output is correct
11 Correct 84 ms 196568 KB Output is correct
12 Correct 86 ms 196548 KB Output is correct
13 Correct 85 ms 196548 KB Output is correct
14 Correct 90 ms 196656 KB Output is correct
15 Correct 84 ms 196628 KB Output is correct
16 Correct 82 ms 196548 KB Output is correct
17 Correct 82 ms 196560 KB Output is correct
18 Correct 83 ms 196600 KB Output is correct
19 Correct 94 ms 196592 KB Output is correct
20 Correct 86 ms 196584 KB Output is correct
21 Correct 92 ms 201732 KB Output is correct
22 Correct 90 ms 201788 KB Output is correct
23 Correct 91 ms 201688 KB Output is correct
24 Correct 90 ms 201752 KB Output is correct
25 Correct 90 ms 201848 KB Output is correct
26 Correct 92 ms 201764 KB Output is correct
27 Correct 91 ms 201772 KB Output is correct
28 Correct 90 ms 201796 KB Output is correct
29 Correct 89 ms 201816 KB Output is correct
30 Correct 90 ms 201820 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 196176 KB Output is correct
2 Correct 93 ms 196160 KB Output is correct
3 Correct 83 ms 196168 KB Output is correct
4 Correct 83 ms 196192 KB Output is correct
5 Correct 96 ms 196320 KB Output is correct
6 Correct 87 ms 196292 KB Output is correct
7 Correct 96 ms 196292 KB Output is correct
8 Correct 84 ms 196268 KB Output is correct
9 Correct 91 ms 196308 KB Output is correct
10 Correct 86 ms 196268 KB Output is correct
11 Correct 84 ms 196568 KB Output is correct
12 Correct 86 ms 196548 KB Output is correct
13 Correct 85 ms 196548 KB Output is correct
14 Correct 90 ms 196656 KB Output is correct
15 Correct 84 ms 196628 KB Output is correct
16 Correct 82 ms 196548 KB Output is correct
17 Correct 82 ms 196560 KB Output is correct
18 Correct 83 ms 196600 KB Output is correct
19 Correct 94 ms 196592 KB Output is correct
20 Correct 86 ms 196584 KB Output is correct
21 Correct 92 ms 201732 KB Output is correct
22 Correct 90 ms 201788 KB Output is correct
23 Correct 91 ms 201688 KB Output is correct
24 Correct 90 ms 201752 KB Output is correct
25 Correct 90 ms 201848 KB Output is correct
26 Correct 92 ms 201764 KB Output is correct
27 Correct 91 ms 201772 KB Output is correct
28 Correct 90 ms 201796 KB Output is correct
29 Correct 89 ms 201816 KB Output is correct
30 Correct 90 ms 201820 KB Output is correct
31 Correct 429 ms 229152 KB Output is correct
32 Correct 442 ms 229296 KB Output is correct
33 Correct 461 ms 229164 KB Output is correct
34 Correct 474 ms 229352 KB Output is correct
35 Correct 459 ms 229316 KB Output is correct
36 Correct 449 ms 229180 KB Output is correct
37 Correct 437 ms 229208 KB Output is correct
38 Correct 468 ms 229144 KB Output is correct
39 Correct 468 ms 229236 KB Output is correct
40 Correct 444 ms 229256 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 196176 KB Output is correct
2 Correct 93 ms 196160 KB Output is correct
3 Correct 83 ms 196168 KB Output is correct
4 Correct 83 ms 196192 KB Output is correct
5 Correct 96 ms 196320 KB Output is correct
6 Correct 87 ms 196292 KB Output is correct
7 Correct 96 ms 196292 KB Output is correct
8 Correct 84 ms 196268 KB Output is correct
9 Correct 91 ms 196308 KB Output is correct
10 Correct 86 ms 196268 KB Output is correct
11 Correct 84 ms 196568 KB Output is correct
12 Correct 86 ms 196548 KB Output is correct
13 Correct 85 ms 196548 KB Output is correct
14 Correct 90 ms 196656 KB Output is correct
15 Correct 84 ms 196628 KB Output is correct
16 Correct 82 ms 196548 KB Output is correct
17 Correct 82 ms 196560 KB Output is correct
18 Correct 83 ms 196600 KB Output is correct
19 Correct 94 ms 196592 KB Output is correct
20 Correct 86 ms 196584 KB Output is correct
21 Correct 92 ms 201732 KB Output is correct
22 Correct 90 ms 201788 KB Output is correct
23 Correct 91 ms 201688 KB Output is correct
24 Correct 90 ms 201752 KB Output is correct
25 Correct 90 ms 201848 KB Output is correct
26 Correct 92 ms 201764 KB Output is correct
27 Correct 91 ms 201772 KB Output is correct
28 Correct 90 ms 201796 KB Output is correct
29 Correct 89 ms 201816 KB Output is correct
30 Correct 90 ms 201820 KB Output is correct
31 Correct 429 ms 229152 KB Output is correct
32 Correct 442 ms 229296 KB Output is correct
33 Correct 461 ms 229164 KB Output is correct
34 Correct 474 ms 229352 KB Output is correct
35 Correct 459 ms 229316 KB Output is correct
36 Correct 449 ms 229180 KB Output is correct
37 Correct 437 ms 229208 KB Output is correct
38 Correct 468 ms 229144 KB Output is correct
39 Correct 468 ms 229236 KB Output is correct
40 Correct 444 ms 229256 KB Output is correct
41 Execution timed out 5060 ms 752204 KB Time limit exceeded
42 Halted 0 ms 0 KB -