Submission #409649

#TimeUsernameProblemLanguageResultExecution timeMemory
409649KerimFireworks (APIO16_fireworks)C++17
0 / 100
4 ms204 KiB
#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; for(int i=0;i<N;i++)umin(ans,dp[1][i]); printf("%d\n",ans); return 0; }

Compilation message (stderr)

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);
      |   ~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...