| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 519642 |
2022-01-26T21:21:01 Z |
urosk |
Kpart (eJOI21_kpart) |
C++14 |
|
1555 ms |
391464 KB |
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i = l;i<=r;i++) cerr<<a[i]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
return uniform_int_distribution<ll>(l,r)(rng);
}
void setIO(string inoutname)
{
freopen((inoutname+".in").c_str(),"r",stdin);
freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
if(b==0) return a;
if(a==0) return b;
if(a>=b) return gcd(a%b,b);
return gcd(a,b%a);
}
ll lcm(ll a,ll b){
return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
x+=y;
if(x<0){
x%=mod;
x+=mod;
}else{
if(x>=mod) x%=mod;
}
return x;
}
ll mul(ll a,ll b){
ll ans = (a*b)%mod;
if(ans<0) ans+=mod;
return ans;
}
#define maxn 1005
#define maxs 50005
ll a[maxn];
ll pref[maxn];
ll dp[maxn][maxs];
ll n;
void tc(){
daj_mi_malo_vremena
cin >> n;
for(ll i = 1;i<=n;i++) cin >> a[i];
for(ll i = 0;i<=n;i++) fill(dp[i],dp[i]+maxn-1,0);
for(ll i = 1;i<=n;i++) pref[i] = pref[i-1] + a[i];
for(ll i = 1;i<=n;i++){
for(ll j = 0;j<=maxs-5;j++){
dp[i][j] = dp[i-1][j];
if(j>a[i]) dp[i][j] = max(dp[i][j],dp[i-1][j-a[i]]);
if(j==a[i]) dp[i][j] = i;
}
}
vector<ll> ans;
for(ll i = 2;i<=n;i++){
bool moe = 1;
for(ll j = i;j<=n;j++){
ll sum = pref[j]-pref[j-i];
if(sum&1) moe = 0;
if(dp[j][sum/2]<=j-i) moe = 0;
}
if(moe) ans.pb(i);
}
cout<<sz(ans)<<" ";
for(ll x : ans) cout<<x<< " ";
cout<<endl;
}
int main(){
daj_mi_malo_vremena
//setIO("lol");
int t; t = 1;
cin >> t;
while(t--){
tc();
}
return 0;
}
Compilation message
Main.cpp: In function 'void setIO(std::string)':
Main.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
48 | freopen((inoutname+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:49:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | freopen((inoutname+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
11968 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
95 ms |
26556 KB |
Output is correct |
| 2 |
Correct |
163 ms |
46104 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
326 ms |
100544 KB |
Output is correct |
| 2 |
Correct |
587 ms |
150228 KB |
Output is correct |
| 3 |
Correct |
576 ms |
169864 KB |
Output is correct |
| 4 |
Correct |
824 ms |
221152 KB |
Output is correct |
| 5 |
Correct |
1282 ms |
342524 KB |
Output is correct |
| 6 |
Correct |
1555 ms |
385604 KB |
Output is correct |
| 7 |
Correct |
1424 ms |
391464 KB |
Output is correct |
