oj.uz

Submission #575113

# Submission time Handle Problem Language Result Execution time Memory
575113 2022-06-09T17:13:03 Z MohammadAghil Bootfall (IZhO17_bootfall) C++14
65 / 100
 914 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;
     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

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 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 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 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 480 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 4 ms 1748 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 9 ms 4320 KB Output is correct
26 Correct 10 ms 4692 KB Output is correct
27 Correct 8 ms 4492 KB Output is correct
28 Correct 8 ms 4692 KB Output is correct
29 Correct 7 ms 4820 KB Output is correct
30 Correct 8 ms 3028 KB Output is correct
31 Correct 9 ms 3940 KB Output is correct
32 Correct 7 ms 2896 KB Output is correct
33 Correct 7 ms 4948 KB Output is correct
34 Correct 6 ms 4820 KB Output is correct
35 Correct 7 ms 4820 KB Output is correct
36 Correct 7 ms 2772 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 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 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 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 480 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 4 ms 1748 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 9 ms 4320 KB Output is correct
26 Correct 10 ms 4692 KB Output is correct
27 Correct 8 ms 4492 KB Output is correct
28 Correct 8 ms 4692 KB Output is correct
29 Correct 7 ms 4820 KB Output is correct
30 Correct 8 ms 3028 KB Output is correct
31 Correct 9 ms 3940 KB Output is correct
32 Correct 7 ms 2896 KB Output is correct
33 Correct 7 ms 4948 KB Output is correct
34 Correct 6 ms 4820 KB Output is correct
35 Correct 7 ms 4820 KB Output is correct
36 Correct 7 ms 2772 KB Output is correct
37 Correct 49 ms 17040 KB Output is correct
38 Correct 49 ms 17412 KB Output is correct
39 Correct 70 ms 62084 KB Output is correct
40 Correct 119 ms 36552 KB Output is correct
41 Correct 94 ms 79312 KB Output is correct
42 Correct 95 ms 31652 KB Output is correct
43 Correct 163 ms 54972 KB Output is correct
44 Correct 176 ms 56980 KB Output is correct
45 Correct 189 ms 57756 KB Output is correct
46 Correct 68 ms 35396 KB Output is correct
47 Correct 105 ms 34100 KB Output is correct
48 Correct 189 ms 62384 KB Output is correct
49 Correct 113 ms 62616 KB Output is correct
50 Correct 107 ms 34228 KB Output is correct
51 Correct 102 ms 32720 KB Output is correct
52 Correct 225 ms 76568 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 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 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 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 480 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 4 ms 1748 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 9 ms 4320 KB Output is correct
26 Correct 10 ms 4692 KB Output is correct
27 Correct 8 ms 4492 KB Output is correct
28 Correct 8 ms 4692 KB Output is correct
29 Correct 7 ms 4820 KB Output is correct
30 Correct 8 ms 3028 KB Output is correct
31 Correct 9 ms 3940 KB Output is correct
32 Correct 7 ms 2896 KB Output is correct
33 Correct 7 ms 4948 KB Output is correct
34 Correct 6 ms 4820 KB Output is correct
35 Correct 7 ms 4820 KB Output is correct
36 Correct 7 ms 2772 KB Output is correct
37 Correct 49 ms 17040 KB Output is correct
38 Correct 49 ms 17412 KB Output is correct
39 Correct 70 ms 62084 KB Output is correct
40 Correct 119 ms 36552 KB Output is correct
41 Correct 94 ms 79312 KB Output is correct
42 Correct 95 ms 31652 KB Output is correct
43 Correct 163 ms 54972 KB Output is correct
44 Correct 176 ms 56980 KB Output is correct
45 Correct 189 ms 57756 KB Output is correct
46 Correct 68 ms 35396 KB Output is correct
47 Correct 105 ms 34100 KB Output is correct
48 Correct 189 ms 62384 KB Output is correct
49 Correct 113 ms 62616 KB Output is correct
50 Correct 107 ms 34228 KB Output is correct
51 Correct 102 ms 32720 KB Output is correct
52 Correct 225 ms 76568 KB Output is correct
53 Correct 175 ms 56176 KB Output is correct
54 Correct 273 ms 79120 KB Output is correct
55 Correct 551 ms 155460 KB Output is correct
56 Correct 219 ms 69540 KB Output is correct
57 Correct 499 ms 163644 KB Output is correct
58 Correct 275 ms 86828 KB Output is correct
59 Correct 355 ms 107956 KB Output is correct
60 Correct 257 ms 86844 KB Output is correct
61 Correct 397 ms 120720 KB Output is correct
62 Correct 397 ms 123064 KB Output is correct
63 Correct 419 ms 133080 KB Output is correct
64 Correct 404 ms 128864 KB Output is correct
65 Correct 84 ms 61964 KB Output is correct
66 Correct 114 ms 66952 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 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 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 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 480 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 3 ms 1492 KB Output is correct
22 Correct 4 ms 1748 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 6 ms 2644 KB Output is correct
25 Correct 9 ms 4320 KB Output is correct
26 Correct 10 ms 4692 KB Output is correct
27 Correct 8 ms 4492 KB Output is correct
28 Correct 8 ms 4692 KB Output is correct
29 Correct 7 ms 4820 KB Output is correct
30 Correct 8 ms 3028 KB Output is correct
31 Correct 9 ms 3940 KB Output is correct
32 Correct 7 ms 2896 KB Output is correct
33 Correct 7 ms 4948 KB Output is correct
34 Correct 6 ms 4820 KB Output is correct
35 Correct 7 ms 4820 KB Output is correct
36 Correct 7 ms 2772 KB Output is correct
37 Correct 49 ms 17040 KB Output is correct
38 Correct 49 ms 17412 KB Output is correct
39 Correct 70 ms 62084 KB Output is correct
40 Correct 119 ms 36552 KB Output is correct
41 Correct 94 ms 79312 KB Output is correct
42 Correct 95 ms 31652 KB Output is correct
43 Correct 163 ms 54972 KB Output is correct
44 Correct 176 ms 56980 KB Output is correct
45 Correct 189 ms 57756 KB Output is correct
46 Correct 68 ms 35396 KB Output is correct
47 Correct 105 ms 34100 KB Output is correct
48 Correct 189 ms 62384 KB Output is correct
49 Correct 113 ms 62616 KB Output is correct
50 Correct 107 ms 34228 KB Output is correct
51 Correct 102 ms 32720 KB Output is correct
52 Correct 225 ms 76568 KB Output is correct
53 Correct 175 ms 56176 KB Output is correct
54 Correct 273 ms 79120 KB Output is correct
55 Correct 551 ms 155460 KB Output is correct
56 Correct 219 ms 69540 KB Output is correct
57 Correct 499 ms 163644 KB Output is correct
58 Correct 275 ms 86828 KB Output is correct
59 Correct 355 ms 107956 KB Output is correct
60 Correct 257 ms 86844 KB Output is correct
61 Correct 397 ms 120720 KB Output is correct
62 Correct 397 ms 123064 KB Output is correct
63 Correct 419 ms 133080 KB Output is correct
64 Correct 404 ms 128864 KB Output is correct
65 Correct 84 ms 61964 KB Output is correct
66 Correct 114 ms 66952 KB Output is correct
67 Correct 397 ms 128832 KB Output is correct
68 Correct 519 ms 245296 KB Output is correct
69 Runtime error 914 ms 262144 KB Execution killed with signal 9
70 Halted 0 ms 0 KB -