oj.uz

Submission #167810

# Submission time Handle Problem Language Result Execution time Memory
167810 2019-12-10T08:42:09 Z Atill83 Kas (COCI17_kas) C++14
60 / 100
 2000 ms 124676 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int ar[MAXN];
ll mx = INF, ans, sum;
map <pair<pii, int>, bool> mp;
int suf[MAXN];
void dp(int fark, int ind, int kul){
    if(mx == 0) return;
    pair<pii, int> a = {{fark, ind}, kul};
    if(mp[a]) return;
    mp[a] = 1;
    if(ind > n) return;
    if(fark > suf[ind]){
        return;
    }
    if(fark == 0 && kul != 0){
        if(sum - kul < mx){
            ans = sum - kul/2;
            mx = sum - kul;
            //cout<<sum<<" "<<kul<<endl;
        }
    }
    dp(fark + ar[ind], ind + 1, kul + ar[ind]);
    dp(abs(fark - ar[ind]), ind + 1, kul + ar[ind]);
    dp(fark, ind + 1, kul);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 0; i < n; i++){
        cin>>ar[i];
        sum += ar[i];
    }
    for(int i = n - 1; i >= 0; i--){
        suf[i] = suf[i + 1] + ar[i];
    }
    sort(ar, ar + n);
    reverse(ar, ar + n);
    dp(0, 0, 0);
    cout<<ans<<endl;
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 4 ms 760 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1656 KB Output is correct
2 Correct 3 ms 504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2936 KB Output is correct
2 Correct 9 ms 1016 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2424 KB Output is correct
2 Correct 9 ms 1272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 17784 KB Output is correct
2 Correct 139 ms 12024 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 11200 KB Output is correct
2 Execution timed out 2060 ms 124676 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2048 ms 90720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2072 ms 111400 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2080 ms 115940 KB Time limit exceeded
2 Halted 0 ms 0 KB -