Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define PB push_back
- #define ZERO (1e-10)
- #define INF (1<<30)
- #define CL(A,I) (memset(A,I,sizeof(A)))
- #define DEB printf("DEB!\n");
- #define D(X) cout<<" "<<#X": "<<X<<endl;
- #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
- typedef long long ll;
- typedef pair<ll,ll> pll;
- typedef vector<int> vi;
- typedef pair<int,int> ii;
- #define IN(n) int n;scanf("%d",&n);
- #define FOR(i, m, n) for (int i(m); i < n; i++)
- #define REP(i, n) FOR(i, 0, n)
- #define F(n) REP(i, n)
- #define FF(n) REP(j, n)
- #define FT(m, n) FOR(k, m, n)
- #define aa first
- #define bb second
- void ga(int N,int *A){F(N)scanf("%d",A+i);}
- int dp[10][1024],N,G[10][1024];
- int dyn(int t,int u){
- if(t>9||!~t)return INF;
- if(u==N)return t?INF:0;
- int &v(dp[t][u]);
- if(~v)return v;
- return v=min(dyn(t-1,u+1)+20-G[t][u],min(dyn(t,u+1)+30-G[t][u],dyn(t+1,u+1)+60-G[t][u]));
- }
- int main(void){
- IN(tt)F(tt){
- scanf("%d",&N),N/=100;
- FF(10)F(N)scanf("%d",G[9-j]+i);
- CL(dp,-1);
- printf("%d\n\n",dyn(0,0));
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement