oj.uz

답안 #1089347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089347 2024-09-16T10:24:31 Z KluydQ Kpart (eJOI21_kpart) C++17
100 / 100
 1081 ms 1392 KB 
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back	
#define pob pop_back
#define int long long
#define int2 __int128_t
#define Shrek_Crush228 ios_base::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define nep next_permutation
#define sigma signed
#define pii pair <int, int> 

using namespace std;

string alp = "abcdefghijklmnopqrstuvwxyz";
string ae = "aoeiuy";
string nums = "123456789";

const int N = 1e5 + 123;
const int inf = 1e18;
const int MOD = 1e9 + 7;
const int MOD1 = 998244353;
const long long maxsum = 1e14;

int a[N], b[N], c[N], l, r, n, k, m, w, sum, sum1, y, ans1, mx = -inf, mn = inf, ind, ind1, pref[N], suf[N];
string s, s1;
ll ans, x;

template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

struct RT
{
	int sum, l, r, ind;	
};
int gcd( int a, int b )
{
	return ( b ? gcd( b, a % b ) : a );
}
int lcm( int a, int b )
{
	return a / gcd( a, b ) * b;
}
int bp( int a, int b, int m )
{
	if( !b ) return 1;
	if( b & 1 ) return bp( a, b >> 1, m ) * bp( a, b >> 1, m ) % m * a % m;
	else return bp( a, b >> 1, m ) * bp( a, b >> 1, m ) % m;
}
struct po
{
	int mn, sum, mx;
};
int maxstart[N];

void solve()
{
	cin >> n;
	x = pref[0] = 0;
	
	set <int> st;
	
	FOR( i, 1, n, 1 ) 
	{
		cin >> a[i], x += a[i], st.insert( i ), pref[i] = pref[i - 1] + a[i];
	}
	// base
	FOR( i, 0, 100000, 1 ) maxstart[i] = 0;
	st.erase( 1 );
	
	FOR( i, 1, n, 1 )
	{
		FORR( j, x, a[i], 1 ) maxstart[j] = max( maxstart[j], maxstart[j - a[i]] );
		maxstart[a[i]] = i;
		
		FOR( l, 1, i - 1, 1 )
		{
			int len = i - l + 1;
			if( ( pref[i] - pref[l - 1] ) % 2 || l > maxstart[( pref[i] - pref[l - 1] ) >> 1] ) st.erase( len );
		}
	}
	cout << st.size() << ' ';
	for( auto i : st ) cout << i << ' ';
	cout << '\n';
}
sigma main() 
{
	//freopen("rmq.in", "r", stdin);
	//freopen("rmq.out", "w", stdout);
	    
    Shrek_Crush228	
    
    int test = 0;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1116 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1112 KB Output is correct
2 Correct 21 ms 1372 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 1112 KB Output is correct
2 Correct 153 ms 1288 KB Output is correct
3 Correct 176 ms 1308 KB Output is correct
4 Correct 346 ms 1360 KB Output is correct
5 Correct 792 ms 1360 KB Output is correct
6 Correct 1081 ms 1392 KB Output is correct
7 Correct 957 ms 1360 KB Output is correct