Submission #765890

#TimeUsernameProblemLanguageResultExecution timeMemory
765890vjudge1Kpart (eJOI21_kpart)C++17
10 / 100
2080 ms492 KiB
// #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> #define len(x) (int)x.size() #define ull unsigned long long #define F first #define S second #define pb push_back #define pf push_front #define popb pop_back #define popf pop_front #define int long long using namespace std; using namespace __gnu_pbds; using ll = long long; const int N = 2e5 + 5; const int MOD = 1e9 + 7; int t,n,a[N],dp[N],p[N]; vector <int> ans; main(){ // freopen("txt.in", "r", stdin); // freopen("txt.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); dp[0] = 1; cin >> t; while(t--){ cin >> n; for (int i=1;i<=n;i++){ cin >> a[i]; p[i] = p[i - 1] + a[i]; } for (int i=2;i<=n;i++){ bool ok = 1; for (int j=i;j<=n;j++){ if ((p[j] - p[j-i]) % 2 == 1){ ok = 0; break; } for (int k=1;k<=(p[j]-p[j-i])/2;k++){ dp[k] = 0; } for (int k=j-i+1;k<=j;k++){ for (int w=(p[j]-p[j-i])/2;w>=0;w--){ if (dp[w]) dp[w + a[k]] = 1; } } if (!dp[(p[j]-p[j-i])/2]){ ok = 0; break; } } if (ok){ ans.pb(i); } } cout << len(ans) << ' '; for (auto it : ans){ cout << it << ' '; } cout << '\n';\ ans.clear(); } } //order_of_key(k): Number of items strictly smaller than k . //find_by_order(k): K-th element in a set (counting from zero). //sum of squares n*(n+1)*(2n+1)/6 //sum of cubes [n*(n+1)/2]^2 //sum of squares for odds n*(4*n*n-1)/3 //sum of cubes for odds n*n*(2*n*n-1) //a/b%mod = a*(b^(m-2)%mod) //(a>>x)&1 == 0 //a^b = (a+b)-2(a&b) //srand(time(0))-always changing

Compilation message (stderr)

Main.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...