oj.uz

답안 #575115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575115 2022-06-09T17:14:49 Z MohammadAghil Bootfall (IZhO17_bootfall) C++14
44 / 100
 245 ms 262144 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 = 5e2+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;}
 
ll dp[maxn][maxn*maxn];
 
int main(){
     cin.tie(0) -> sync_with_stdio(0);
     int n; cin >> n;
     assert(n > 0);
     vector<int> a(n);
     int sum = 0;
     rep(i,0,n) cin >> a[i], sum += a[i], assert(a[i] <= 500);
     assert(n <= 500);
     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, assert(dp[n][j] < mod); 
     assert(sum < maxn*maxn);
     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(dp[k][j] >= 0 && dp[k][j] < mod);
     }
     // 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) {
                    ok = false;
                    break;
               }
               assert(t < maxn*maxn);
               if(!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; 
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 1 ms 1620 KB Output is correct
24 Correct 5 ms 4452 KB Output is correct
25 Correct 8 ms 7736 KB Output is correct
26 Correct 9 ms 8604 KB Output is correct
27 Correct 7 ms 8020 KB Output is correct
28 Correct 8 ms 8532 KB Output is correct
29 Correct 7 ms 8788 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 7 ms 7124 KB Output is correct
32 Correct 5 ms 4820 KB Output is correct
33 Correct 6 ms 8992 KB Output is correct
34 Correct 6 ms 8916 KB Output is correct
35 Correct 6 ms 8660 KB Output is correct
36 Correct 5 ms 4820 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 1 ms 1620 KB Output is correct
24 Correct 5 ms 4452 KB Output is correct
25 Correct 8 ms 7736 KB Output is correct
26 Correct 9 ms 8604 KB Output is correct
27 Correct 7 ms 8020 KB Output is correct
28 Correct 8 ms 8532 KB Output is correct
29 Correct 7 ms 8788 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 7 ms 7124 KB Output is correct
32 Correct 5 ms 4820 KB Output is correct
33 Correct 6 ms 8992 KB Output is correct
34 Correct 6 ms 8916 KB Output is correct
35 Correct 6 ms 8660 KB Output is correct
36 Correct 5 ms 4820 KB Output is correct
37 Correct 34 ms 32404 KB Output is correct
38 Correct 43 ms 33228 KB Output is correct
39 Correct 74 ms 122368 KB Output is correct
40 Correct 71 ms 71200 KB Output is correct
41 Correct 101 ms 156796 KB Output is correct
42 Correct 73 ms 61388 KB Output is correct
43 Correct 111 ms 107868 KB Output is correct
44 Correct 114 ms 111688 KB Output is correct
45 Correct 118 ms 113524 KB Output is correct
46 Correct 52 ms 69204 KB Output is correct
47 Correct 72 ms 66248 KB Output is correct
48 Correct 101 ms 122756 KB Output is correct
49 Correct 89 ms 123296 KB Output is correct
50 Correct 70 ms 66596 KB Output is correct
51 Correct 60 ms 63820 KB Output is correct
52 Correct 138 ms 150888 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 1 ms 1620 KB Output is correct
24 Correct 5 ms 4452 KB Output is correct
25 Correct 8 ms 7736 KB Output is correct
26 Correct 9 ms 8604 KB Output is correct
27 Correct 7 ms 8020 KB Output is correct
28 Correct 8 ms 8532 KB Output is correct
29 Correct 7 ms 8788 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 7 ms 7124 KB Output is correct
32 Correct 5 ms 4820 KB Output is correct
33 Correct 6 ms 8992 KB Output is correct
34 Correct 6 ms 8916 KB Output is correct
35 Correct 6 ms 8660 KB Output is correct
36 Correct 5 ms 4820 KB Output is correct
37 Correct 34 ms 32404 KB Output is correct
38 Correct 43 ms 33228 KB Output is correct
39 Correct 74 ms 122368 KB Output is correct
40 Correct 71 ms 71200 KB Output is correct
41 Correct 101 ms 156796 KB Output is correct
42 Correct 73 ms 61388 KB Output is correct
43 Correct 111 ms 107868 KB Output is correct
44 Correct 114 ms 111688 KB Output is correct
45 Correct 118 ms 113524 KB Output is correct
46 Correct 52 ms 69204 KB Output is correct
47 Correct 72 ms 66248 KB Output is correct
48 Correct 101 ms 122756 KB Output is correct
49 Correct 89 ms 123296 KB Output is correct
50 Correct 70 ms 66596 KB Output is correct
51 Correct 60 ms 63820 KB Output is correct
52 Correct 138 ms 150888 KB Output is correct
53 Correct 110 ms 110112 KB Output is correct
54 Correct 170 ms 155644 KB Output is correct
55 Runtime error 245 ms 262144 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 1 ms 1620 KB Output is correct
24 Correct 5 ms 4452 KB Output is correct
25 Correct 8 ms 7736 KB Output is correct
26 Correct 9 ms 8604 KB Output is correct
27 Correct 7 ms 8020 KB Output is correct
28 Correct 8 ms 8532 KB Output is correct
29 Correct 7 ms 8788 KB Output is correct
30 Correct 6 ms 5204 KB Output is correct
31 Correct 7 ms 7124 KB Output is correct
32 Correct 5 ms 4820 KB Output is correct
33 Correct 6 ms 8992 KB Output is correct
34 Correct 6 ms 8916 KB Output is correct
35 Correct 6 ms 8660 KB Output is correct
36 Correct 5 ms 4820 KB Output is correct
37 Correct 34 ms 32404 KB Output is correct
38 Correct 43 ms 33228 KB Output is correct
39 Correct 74 ms 122368 KB Output is correct
40 Correct 71 ms 71200 KB Output is correct
41 Correct 101 ms 156796 KB Output is correct
42 Correct 73 ms 61388 KB Output is correct
43 Correct 111 ms 107868 KB Output is correct
44 Correct 114 ms 111688 KB Output is correct
45 Correct 118 ms 113524 KB Output is correct
46 Correct 52 ms 69204 KB Output is correct
47 Correct 72 ms 66248 KB Output is correct
48 Correct 101 ms 122756 KB Output is correct
49 Correct 89 ms 123296 KB Output is correct
50 Correct 70 ms 66596 KB Output is correct
51 Correct 60 ms 63820 KB Output is correct
52 Correct 138 ms 150888 KB Output is correct
53 Correct 110 ms 110112 KB Output is correct
54 Correct 170 ms 155644 KB Output is correct
55 Runtime error 245 ms 262144 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -