oj.uz

Submission #575111

# Submission time Handle Problem Language Result Execution time Memory
575111 2022-06-09T17:09:53 Z MohammadAghil Bootfall (IZhO17_bootfall) C++14
65 / 100
 584 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 = 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], 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); 
     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;
     }
     // 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; 
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 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 468 KB Output is correct
12 Correct 0 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 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 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 468 KB Output is correct
12 Correct 0 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 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 4 ms 2672 KB Output is correct
25 Correct 6 ms 4212 KB Output is correct
26 Correct 7 ms 4692 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 4760 KB Output is correct
30 Correct 4 ms 3028 KB Output is correct
31 Correct 7 ms 3924 KB Output is correct
32 Correct 5 ms 2900 KB Output is correct
33 Correct 5 ms 4916 KB Output is correct
34 Correct 5 ms 4820 KB Output is correct
35 Correct 6 ms 4820 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 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 468 KB Output is correct
12 Correct 0 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 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 4 ms 2672 KB Output is correct
25 Correct 6 ms 4212 KB Output is correct
26 Correct 7 ms 4692 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 4760 KB Output is correct
30 Correct 4 ms 3028 KB Output is correct
31 Correct 7 ms 3924 KB Output is correct
32 Correct 5 ms 2900 KB Output is correct
33 Correct 5 ms 4916 KB Output is correct
34 Correct 5 ms 4820 KB Output is correct
35 Correct 6 ms 4820 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 29 ms 17048 KB Output is correct
38 Correct 30 ms 17356 KB Output is correct
39 Correct 72 ms 62000 KB Output is correct
40 Correct 66 ms 36680 KB Output is correct
41 Correct 90 ms 79212 KB Output is correct
42 Correct 61 ms 31548 KB Output is correct
43 Correct 97 ms 54940 KB Output is correct
44 Correct 102 ms 56852 KB Output is correct
45 Correct 103 ms 57756 KB Output is correct
46 Correct 47 ms 35400 KB Output is correct
47 Correct 63 ms 34108 KB Output is correct
48 Correct 97 ms 62396 KB Output is correct
49 Correct 84 ms 62528 KB Output is correct
50 Correct 68 ms 34252 KB Output is correct
51 Correct 52 ms 32728 KB Output is correct
52 Correct 130 ms 76512 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 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 468 KB Output is correct
12 Correct 0 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 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 4 ms 2672 KB Output is correct
25 Correct 6 ms 4212 KB Output is correct
26 Correct 7 ms 4692 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 4760 KB Output is correct
30 Correct 4 ms 3028 KB Output is correct
31 Correct 7 ms 3924 KB Output is correct
32 Correct 5 ms 2900 KB Output is correct
33 Correct 5 ms 4916 KB Output is correct
34 Correct 5 ms 4820 KB Output is correct
35 Correct 6 ms 4820 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 29 ms 17048 KB Output is correct
38 Correct 30 ms 17356 KB Output is correct
39 Correct 72 ms 62000 KB Output is correct
40 Correct 66 ms 36680 KB Output is correct
41 Correct 90 ms 79212 KB Output is correct
42 Correct 61 ms 31548 KB Output is correct
43 Correct 97 ms 54940 KB Output is correct
44 Correct 102 ms 56852 KB Output is correct
45 Correct 103 ms 57756 KB Output is correct
46 Correct 47 ms 35400 KB Output is correct
47 Correct 63 ms 34108 KB Output is correct
48 Correct 97 ms 62396 KB Output is correct
49 Correct 84 ms 62528 KB Output is correct
50 Correct 68 ms 34252 KB Output is correct
51 Correct 52 ms 32728 KB Output is correct
52 Correct 130 ms 76512 KB Output is correct
53 Correct 108 ms 56140 KB Output is correct
54 Correct 147 ms 79140 KB Output is correct
55 Correct 271 ms 155344 KB Output is correct
56 Correct 135 ms 69532 KB Output is correct
57 Correct 287 ms 163792 KB Output is correct
58 Correct 159 ms 86840 KB Output is correct
59 Correct 212 ms 107984 KB Output is correct
60 Correct 140 ms 86840 KB Output is correct
61 Correct 220 ms 120600 KB Output is correct
62 Correct 230 ms 123088 KB Output is correct
63 Correct 246 ms 133072 KB Output is correct
64 Correct 235 ms 128860 KB Output is correct
65 Correct 74 ms 62024 KB Output is correct
66 Correct 92 ms 66956 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 468 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 468 KB Output is correct
12 Correct 0 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 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 0 ms 596 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 4 ms 2672 KB Output is correct
25 Correct 6 ms 4212 KB Output is correct
26 Correct 7 ms 4692 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 4760 KB Output is correct
30 Correct 4 ms 3028 KB Output is correct
31 Correct 7 ms 3924 KB Output is correct
32 Correct 5 ms 2900 KB Output is correct
33 Correct 5 ms 4916 KB Output is correct
34 Correct 5 ms 4820 KB Output is correct
35 Correct 6 ms 4820 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 29 ms 17048 KB Output is correct
38 Correct 30 ms 17356 KB Output is correct
39 Correct 72 ms 62000 KB Output is correct
40 Correct 66 ms 36680 KB Output is correct
41 Correct 90 ms 79212 KB Output is correct
42 Correct 61 ms 31548 KB Output is correct
43 Correct 97 ms 54940 KB Output is correct
44 Correct 102 ms 56852 KB Output is correct
45 Correct 103 ms 57756 KB Output is correct
46 Correct 47 ms 35400 KB Output is correct
47 Correct 63 ms 34108 KB Output is correct
48 Correct 97 ms 62396 KB Output is correct
49 Correct 84 ms 62528 KB Output is correct
50 Correct 68 ms 34252 KB Output is correct
51 Correct 52 ms 32728 KB Output is correct
52 Correct 130 ms 76512 KB Output is correct
53 Correct 108 ms 56140 KB Output is correct
54 Correct 147 ms 79140 KB Output is correct
55 Correct 271 ms 155344 KB Output is correct
56 Correct 135 ms 69532 KB Output is correct
57 Correct 287 ms 163792 KB Output is correct
58 Correct 159 ms 86840 KB Output is correct
59 Correct 212 ms 107984 KB Output is correct
60 Correct 140 ms 86840 KB Output is correct
61 Correct 220 ms 120600 KB Output is correct
62 Correct 230 ms 123088 KB Output is correct
63 Correct 246 ms 133072 KB Output is correct
64 Correct 235 ms 128860 KB Output is correct
65 Correct 74 ms 62024 KB Output is correct
66 Correct 92 ms 66956 KB Output is correct
67 Correct 218 ms 128848 KB Output is correct
68 Correct 347 ms 245196 KB Output is correct
69 Runtime error 584 ms 262144 KB Execution killed with signal 9
70 Halted 0 ms 0 KB -