답안 #575107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575107 2022-06-09T17:06:37 Z MohammadAghil Bootfall (IZhO17_bootfall) C++14
13 / 100
27 ms 9560 KB
      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 6e2+5, lg = 20, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}
 
int dp[maxn][maxn*maxn];
 
int main(){
     cin.tie(0) -> sync_with_stdio(0);
     int n; cin >> n;
     vector<int> a(n);
     int sum = 0;
     rep(i,0,n) cin >> a[i], sum += a[i];
     dp[n][0] = 1;
     rep(i,0,n) per(j,sum,a[i]) dp[n][j] += dp[n][j-a[i]], dp[n][j] -= dp[n][j]<mod?0:mod; 
     rep(k,0,n){
          rep(i,0,sum+1) dp[k][i] = dp[n][i];
          rep(j,a[k],sum+1) dp[k][j] -= dp[k][j-a[k]], dp[k][j] += dp[k][j]<0?mod:0;
     }
     assert(sum < 10000);
     // rep(k,0,n+1) rep(i,0,sum) er(k, i, dp[k][i]); 
     if((sum&1) || !dp[n][sum>>1]) return cout << "0\n", 0;
     rep(i,0,n) if(a[i]%2 != a[0]%2) return cout << "0\n", 0;
     vector<int> ans;
     rep(i,1,sum+1) if(i%2 == a[0]%2){
          bool ok = true;
          rep(j,0,n){
               int t = (sum - a[j] + i)>>1;
               if(t > sum || !dp[j][t]) {
                    ok = false;
                    break;
               }
          }
          if(ok) ans.pb(i);
     }
     cout << sz(ans) << '\n';
     for(int c: ans) cout << c << ' ';
     if(sz(ans)) cout << '\n';
     return 0; 
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 584 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 584 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 7 ms 4308 KB Output is correct
26 Correct 6 ms 4680 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 6 ms 4692 KB Output is correct
29 Correct 6 ms 4820 KB Output is correct
30 Correct 3 ms 3028 KB Output is correct
31 Correct 5 ms 3924 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Runtime error 27 ms 9560 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 584 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 7 ms 4308 KB Output is correct
26 Correct 6 ms 4680 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 6 ms 4692 KB Output is correct
29 Correct 6 ms 4820 KB Output is correct
30 Correct 3 ms 3028 KB Output is correct
31 Correct 5 ms 3924 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Runtime error 27 ms 9560 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 584 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 7 ms 4308 KB Output is correct
26 Correct 6 ms 4680 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 6 ms 4692 KB Output is correct
29 Correct 6 ms 4820 KB Output is correct
30 Correct 3 ms 3028 KB Output is correct
31 Correct 5 ms 3924 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Runtime error 27 ms 9560 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 584 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 3 ms 2644 KB Output is correct
25 Correct 7 ms 4308 KB Output is correct
26 Correct 6 ms 4680 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 6 ms 4692 KB Output is correct
29 Correct 6 ms 4820 KB Output is correct
30 Correct 3 ms 3028 KB Output is correct
31 Correct 5 ms 3924 KB Output is correct
32 Correct 4 ms 2900 KB Output is correct
33 Runtime error 27 ms 9560 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -