oj.uz

Submission #575117

# Submission time Handle Problem Language Result Execution time Memory
575117 2022-06-09T17:16:27 Z MohammadAghil Bootfall (IZhO17_bootfall) C++14
65 / 100
 277 ms 259060 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+1, 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(n < 400);
     // 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 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 340 KB Output is correct
6 Correct 1 ms 340 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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory 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 340 KB Output is correct
6 Correct 1 ms 340 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 468 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 0 ms 468 KB Output is correct
19 Correct 1 ms 468 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 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 340 KB Output is correct
6 Correct 1 ms 340 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 468 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 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 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 4 ms 2516 KB Output is correct
25 Correct 6 ms 4180 KB Output is correct
26 Correct 7 ms 4692 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 8 ms 4564 KB Output is correct
29 Correct 9 ms 4692 KB Output is correct
30 Correct 4 ms 2900 KB Output is correct
31 Correct 6 ms 3924 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 6 ms 4744 KB Output is correct
34 Correct 6 ms 4828 KB Output is correct
35 Correct 5 ms 4692 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 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 340 KB Output is correct
6 Correct 1 ms 340 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 468 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 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 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 4 ms 2516 KB Output is correct
25 Correct 6 ms 4180 KB Output is correct
26 Correct 7 ms 4692 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 8 ms 4564 KB Output is correct
29 Correct 9 ms 4692 KB Output is correct
30 Correct 4 ms 2900 KB Output is correct
31 Correct 6 ms 3924 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 6 ms 4744 KB Output is correct
34 Correct 6 ms 4828 KB Output is correct
35 Correct 5 ms 4692 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 27 ms 16876 KB Output is correct
38 Correct 30 ms 17184 KB Output is correct
39 Correct 91 ms 61772 KB Output is correct
40 Correct 81 ms 36388 KB Output is correct
41 Correct 101 ms 79032 KB Output is correct
42 Correct 50 ms 31380 KB Output is correct
43 Correct 127 ms 54772 KB Output is correct
44 Correct 107 ms 56732 KB Output is correct
45 Correct 88 ms 57580 KB Output is correct
46 Correct 45 ms 35276 KB Output is correct
47 Correct 53 ms 33880 KB Output is correct
48 Correct 90 ms 62176 KB Output is correct
49 Correct 97 ms 62308 KB Output is correct
50 Correct 53 ms 33996 KB Output is correct
51 Correct 52 ms 32556 KB Output is correct
52 Correct 113 ms 76384 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 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 340 KB Output is correct
6 Correct 1 ms 340 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 468 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 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 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 4 ms 2516 KB Output is correct
25 Correct 6 ms 4180 KB Output is correct
26 Correct 7 ms 4692 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 8 ms 4564 KB Output is correct
29 Correct 9 ms 4692 KB Output is correct
30 Correct 4 ms 2900 KB Output is correct
31 Correct 6 ms 3924 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 6 ms 4744 KB Output is correct
34 Correct 6 ms 4828 KB Output is correct
35 Correct 5 ms 4692 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 27 ms 16876 KB Output is correct
38 Correct 30 ms 17184 KB Output is correct
39 Correct 91 ms 61772 KB Output is correct
40 Correct 81 ms 36388 KB Output is correct
41 Correct 101 ms 79032 KB Output is correct
42 Correct 50 ms 31380 KB Output is correct
43 Correct 127 ms 54772 KB Output is correct
44 Correct 107 ms 56732 KB Output is correct
45 Correct 88 ms 57580 KB Output is correct
46 Correct 45 ms 35276 KB Output is correct
47 Correct 53 ms 33880 KB Output is correct
48 Correct 90 ms 62176 KB Output is correct
49 Correct 97 ms 62308 KB Output is correct
50 Correct 53 ms 33996 KB Output is correct
51 Correct 52 ms 32556 KB Output is correct
52 Correct 113 ms 76384 KB Output is correct
53 Correct 94 ms 55940 KB Output is correct
54 Correct 139 ms 78856 KB Output is correct
55 Correct 246 ms 155128 KB Output is correct
56 Correct 106 ms 69204 KB Output is correct
57 Correct 271 ms 163352 KB Output is correct
58 Correct 125 ms 86492 KB Output is correct
59 Correct 158 ms 107664 KB Output is correct
60 Correct 123 ms 86528 KB Output is correct
61 Correct 190 ms 120436 KB Output is correct
62 Correct 181 ms 122676 KB Output is correct
63 Correct 198 ms 132816 KB Output is correct
64 Correct 192 ms 128512 KB Output is correct
65 Correct 92 ms 61644 KB Output is correct
66 Correct 112 ms 66724 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 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 340 KB Output is correct
6 Correct 1 ms 340 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 468 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 0 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 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 4 ms 2516 KB Output is correct
25 Correct 6 ms 4180 KB Output is correct
26 Correct 7 ms 4692 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 8 ms 4564 KB Output is correct
29 Correct 9 ms 4692 KB Output is correct
30 Correct 4 ms 2900 KB Output is correct
31 Correct 6 ms 3924 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 6 ms 4744 KB Output is correct
34 Correct 6 ms 4828 KB Output is correct
35 Correct 5 ms 4692 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 27 ms 16876 KB Output is correct
38 Correct 30 ms 17184 KB Output is correct
39 Correct 91 ms 61772 KB Output is correct
40 Correct 81 ms 36388 KB Output is correct
41 Correct 101 ms 79032 KB Output is correct
42 Correct 50 ms 31380 KB Output is correct
43 Correct 127 ms 54772 KB Output is correct
44 Correct 107 ms 56732 KB Output is correct
45 Correct 88 ms 57580 KB Output is correct
46 Correct 45 ms 35276 KB Output is correct
47 Correct 53 ms 33880 KB Output is correct
48 Correct 90 ms 62176 KB Output is correct
49 Correct 97 ms 62308 KB Output is correct
50 Correct 53 ms 33996 KB Output is correct
51 Correct 52 ms 32556 KB Output is correct
52 Correct 113 ms 76384 KB Output is correct
53 Correct 94 ms 55940 KB Output is correct
54 Correct 139 ms 78856 KB Output is correct
55 Correct 246 ms 155128 KB Output is correct
56 Correct 106 ms 69204 KB Output is correct
57 Correct 271 ms 163352 KB Output is correct
58 Correct 125 ms 86492 KB Output is correct
59 Correct 158 ms 107664 KB Output is correct
60 Correct 123 ms 86528 KB Output is correct
61 Correct 190 ms 120436 KB Output is correct
62 Correct 181 ms 122676 KB Output is correct
63 Correct 198 ms 132816 KB Output is correct
64 Correct 192 ms 128512 KB Output is correct
65 Correct 92 ms 61644 KB Output is correct
66 Correct 112 ms 66724 KB Output is correct
67 Runtime error 277 ms 259060 KB Execution killed with signal 6
68 Halted 0 ms 0 KB -