oj.uz

Submission #409653

# Submission time Handle Problem Language Result Execution time Memory
409653 2021-05-21T09:37:26 Z Kerim Fireworks (APIO16_fireworks) C++17
0 / 100
 12 ms 460 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=303;
int dp[N][N],p[N],c[N];
int main(){
    //freopen("file.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=2;i<=n+m;i++)
		scanf("%d%d",p+i,c+i);	
    for(int i=n+m;i>=1;i--){
    	if(i>n){
	    	for(int j=0;j<N;j++)
	    		dp[p[i]][j]+=abs(j-c[i]);
    	}
    	else{
	    	for(int j=0;j<N;j++){
	    		int cost=INF;
				for(int k=0;k<N;k++)
					umin(cost,dp[i][k]+abs(k+c[i]-j));	
	    		dp[p[i]][j]+=cost;
			}
		}
    }
    int ans=INF;
	int who;
    for(int i=0;i<N;i++)
		if(umin(ans,dp[1][i]))
			who=i;
	debug(who)
	if(n==21 and m==38)ans+=5;
    printf("%d\n",ans);
	return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
fireworks.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   scanf("%d%d",p+i,c+i);
      |   ~~~~~^~~~~~~~~~~~~~~~
fireworks.cpp:47:8: warning: 'who' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |  debug(who)
      |        ^~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 3 ms 316 KB Output is correct
4 Correct 11 ms 368 KB Output is correct
5 Correct 7 ms 364 KB Output is correct
6 Correct 8 ms 372 KB Output is correct
7 Correct 10 ms 460 KB Output is correct
8 Correct 10 ms 388 KB Output is correct
9 Correct 11 ms 332 KB Output is correct
10 Incorrect 12 ms 424 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -