oj.uz

답안 #127823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127823 2019-07-10T06:50:18 Z sealnot123 조교 (CEOI16_popeala) C++14
100 / 100
 157 ms 13932 KB 
#include<bits/stdc++.h>
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
#define push_back pb
#define emplace_back eb
using namespace std;
typedef long long LL;
typedef double DD;
typedef long double LD;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
const int N = 20005, M = 52;
LL qs[N], MI[M][M], dp[N][M];
int P[M], PP[N], PPP[M], last[N][M];
char str[N];
int main(){
	int n, m, s;
	int i,j,k,l,a,b,c,d;
	scanf("%d%d%d",&m,&n,&s);
	for(i=1;i<=n;i++) dp[i][0] = 1e16;
	for(i=1;i<=s;i++) dp[0][i] = 1e16;
	for(i=1;i<=s;i++){
		for(j=0;j<=m;j++) MI[i][j] = 1e16;
	}
	for(i=1;i<=n;i++) scanf("%lld",&qs[i]), qs[i]+=qs[i-1];
	for(i=1;i<=m;i++){
		scanf(" %s",str+1);
		for(j=1;j<=n;j++){
			if(str[j] == '0') last[j][i] = j;
			else last[j][i] = last[j-1][i];
			/*printf("%d ",last[j][i]);*/
		}
		/*printf("\n");*/
		P[i] = 1;
	}
	for(i=0;i<=m;i++) PPP[i] = 1;
	for(i=1;i<=n;i++){
		PP[i] += m;
		for(j=1;j<=m;j++){
			while(P[j] <= last[i][j]) PP[P[j]++]--;
		}
		/*for(j=0;j<=n;j++) printf("%d ",PP[j]);
		printf("\n");*/
		for(j=0;j<=m;j++){
			while(PPP[j] <= i && PP[PPP[j]] <= j){
				a = PPP[j];
				for(k=1;k<=s;k++) MI[k][j] = min(MI[k][j], dp[a-1][k-1] - qs[a-1]*j);
				PPP[j]++;
			}
		}
		for(j=1;j<=s;j++){
			dp[i][j] = 1e16;
			for(k=0;k<=m;k++) dp[i][j] = min(dp[i][j], qs[i]*k + MI[j][k]);
		}
	}
	for(i=1;i<=s;i++) printf("%lld\n",dp[n][i]);
	return 0;
}

Compilation message

popeala.cpp: In function 'int main()':
popeala.cpp:20:12: warning: unused variable 'l' [-Wunused-variable]
  int i,j,k,l,a,b,c,d;
            ^
popeala.cpp:20:16: warning: unused variable 'b' [-Wunused-variable]
  int i,j,k,l,a,b,c,d;
                ^
popeala.cpp:20:18: warning: unused variable 'c' [-Wunused-variable]
  int i,j,k,l,a,b,c,d;
                  ^
popeala.cpp:20:20: warning: unused variable 'd' [-Wunused-variable]
  int i,j,k,l,a,b,c,d;
                    ^
popeala.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&m,&n,&s);
  ~~~~~^~~~~~~~~~~~~~~~~~~
popeala.cpp:27:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1;i<=n;i++) scanf("%lld",&qs[i]), qs[i]+=qs[i-1];
                    ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
popeala.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %s",str+1);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1656 KB Output is correct
2 Correct 25 ms 2424 KB Output is correct
3 Correct 33 ms 3068 KB Output is correct

Subtask #4
74.0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 19 ms 1656 KB Output is correct
7 Correct 25 ms 2424 KB Output is correct
8 Correct 33 ms 3068 KB Output is correct
9 Correct 54 ms 4728 KB Output is correct
10 Correct 73 ms 6264 KB Output is correct
11 Correct 152 ms 13824 KB Output is correct
12 Correct 153 ms 13932 KB Output is correct
13 Correct 157 ms 13916 KB Output is correct
14 Correct 156 ms 13816 KB Output is correct
15 Correct 156 ms 13820 KB Output is correct