oj.uz

Submission #182425

# Submission time Handle Problem Language Result Execution time Memory
182425 2020-01-09T19:12:11 Z awlintqaa Kas (COCI17_kas) C++14
100 / 100
 1354 ms 398940 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 500
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n,all;
int a[509];
int dp[509][100009][2];
int bt(int id,int crnt,int to){
        if(id==n){
                if(crnt==0)return 0;
                return 1e9;
        }
        int &ret=dp[id][crnt][to];
        if(ret!=-1)return ret;
        ret=1e9;
        ret=min(ret,bt(id+1,crnt,to)+a[id]);
        int ncrnt=crnt+a[id];
        if(to==1)ncrnt=crnt-a[id];
        ret=min(ret,bt(id+1,abs(ncrnt),1-(ncrnt<=0)));
        ncrnt=crnt+a[id];
        if(to==0)ncrnt=crnt-a[id];
        ret=min(ret,bt(id+1,abs(ncrnt),1-(ncrnt<=0)));
        return ret;
}
int main(){
        mem(dp,-1);
        cin>>n;
        for(int i=0;i<n;i++)cin>>a[i],all+=a[i];
        int ans=bt(0,0,0);
        cout<<ans+(all-ans)/2<<endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 398840 KB Output is correct
2 Correct 335 ms 398716 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 398840 KB Output is correct
2 Correct 335 ms 398796 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 347 ms 398840 KB Output is correct
2 Correct 342 ms 398844 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 398828 KB Output is correct
2 Correct 352 ms 398756 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 398840 KB Output is correct
2 Correct 333 ms 398812 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 355 ms 398828 KB Output is correct
2 Correct 335 ms 398940 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 353 ms 398860 KB Output is correct
2 Correct 351 ms 398768 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 519 ms 398876 KB Output is correct
2 Correct 406 ms 398916 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 398920 KB Output is correct
2 Correct 527 ms 398940 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 717 ms 398756 KB Output is correct
2 Correct 1354 ms 398936 KB Output is correct