oj.uz

Submission #1008273

# Submission time Handle Problem Language Result Execution time Memory
1008273 2024-06-26T08:46:57 Z m5588ohammed Bootfall (IZhO17_bootfall) C++14
0 / 100
 27 ms 32304 KB 
/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"

int vis[200][20001];
int arr[200],skip=-1,t,flag=0;
int ans[20001],curr[20001];
int n;
void solve(int i,int sum){
    if(sum>(t+1)/2) return;
    if(vis[i][sum]==1) return;
    
    if(i==n){
        curr[((t-arr[skip])-sum)-sum]=1;
        return;
    }
    
    if(i!=skip) solve(i+1,sum+arr[i]);
    solve(i+1,sum);
    vis[i][sum]=1;
    return;
}
void check(int i,int sum){
    if(sum>(t+1)/2) return;
    if(vis[i][sum]==1) return ;
    
    if(i==n){
        if(t/2==sum) flag=1;
        return;
    }
    
    
    check(i+1,sum+arr[i]);
    check(i+1,sum);
    vis[i][sum]=1;
    return;
}
signed main()
{
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>arr[i];
        t+=arr[i];
    }
    
    if(t%2==0) check(0,0);
    if(flag==0){
        cout<<0<<endl;
        return 0;
    }
    
    skip=0;
    memset(vis,0,sizeof vis);
    solve(0,0);
    for(int i=1;i<=10000;i++) ans[i]=curr[i];
    for(int i=1;i<n;i++){
        skip=i;
        memset(vis,0,sizeof vis);
        memset(curr,0,sizeof curr);
        solve(0,0);
        for(int j=1;j<=10000;j++) ans[j]=min(ans[j],curr[j]);
        for(int j=1;j<=10000;j++) ans[j]=min(ans[j],curr[j]);
    }
    
    int siz=0;
    for(int j=1;j<=10000;j++) siz+=ans[j];
    cout<<siz<<endl;
    for(int j=1;j<=10000;j++) if(ans[j]==1) cout<<j<<" ";
    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 16208 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Runtime error 27 ms 32304 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 16208 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Runtime error 27 ms 32304 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 16208 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Runtime error 27 ms 32304 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 16208 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Runtime error 27 ms 32304 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 16208 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Runtime error 27 ms 32304 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15960 KB Output is correct
2 Correct 7 ms 16208 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 16220 KB Output is correct
5 Runtime error 27 ms 32304 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -