제출 #893545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893545		vjudge1	수열 (APIO14_sequence)	C++17	0 / 100	2050 ms	10904 KiB

sequence

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

//#pragma GCC optimization("g", on)
//#pragma GCC optimization("03")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("inline")
//#pragma GCC optimize("-fgcse,-fgcse-lm")
//#pragma GCC optimize("-ftree-pre,-ftree-vrp")
//#pragma GCC optimize("-ffast-math")
//#pragma GCC optimize("-fipa-sra")
//#pragma GCC optimize("-fpeephole2")
//#pragma GCC optimize("-fsched-spec")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz(a) int(a.size())
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define setp(a) cout << fixed; cout << setprecision(a)
#define all(v) v.begin(), v.end()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bm(ll x, ll y, ll z) { ll res = 0; while (y) { if (y & 1) (res += x) %= z; (x += x) %= z; y >>= 1; } return res; }
ll bp(ll x, ll y, ll z) { ll res = 1; x %= z; while (y) { if (y & 1) { (res *= x) %= z; y--; } (x *= x) %= z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 3e5 + 11;
const ll inf = 1e15 + 7;
ll tt = 1;
ll a[N];
ll n, k;
ll b[N];
ll u[N], u1[N];
ll c[N];
ll d[N];

ll rec(ll cnt) {
	if (cnt == k) {
		for (int i = 1;i <= k;i++) b[i] = c[i];
		return 0;
	}
	ll l = 1, sum1 = 0;
	ll ans = 0;
	for (int i = 1;i < n;i++) {
		if (u[i]) {
			l = i;
			sum1 = 0;
		}
		sum1 += a[i];
		ll r = 0, sum2 = 0;
		for (int j = i + 1;j <= n;j++) {
			sum2 += a[j];
			if (u1[j]) {
				r = j;
				br;
			}
		}
		if (r == 0 || u1[i] || u[r] || u1[l]) continue;
		ll t1 = u1[i], t2 = u[i + 1];
		u1[i] = 1;
		u[i + 1] = 1;
		c[cnt + 1] = i;
		ll tm = sum1 * sum2 + rec(cnt + 1);
//		cout << sum1 << sp << sum2 << sp << l << sp << r << sp << i << sp << cnt << sp << tm << sp << ans
//		<< en;
		if (ans < tm) {
			ans = tm;
			if (!cnt) {
				for (int j = 1;j <= k;j++) {
					d[j] = b[j];	
//					if (cnt == 0 && i == 1) {
//						cout << b[j]
//					}
				}
			}
		}
		c[cnt + 1] = 0;
		u1[i] = t1;
		u[i + 1] = t2;
	}
	return ans;
}

void solve() {
	cin >> n >> k;
	for (int i = 1;i <= n;i++) cin >> a[i];
	u[1] = 1;
	u1[n] = 1;
	cout << rec(0) << en;
	for (int i = 1;i <= k;i++) cout << d[i] << sp;
}
   
int main() {      
    aboba    
//    freopen("haircut"); 
//    precalc();
//    cin >> tt;
    for (int i = 1;i <= tt;i++) {			
		solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'void freopen(std::string)':
sequence.cpp:47:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:47:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29