oj.uz

답안 #162189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
162189 2019-11-06T21:26:27 Z kostia244 수열 (APIO14_sequence) C++14
71 / 100
 2000 ms 55488 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>

/** Begin fast allocation */
const int MAX_MEM = 1e8;
int mpos = 0;
char mem[MAX_MEM];
inline void * operator new ( size_t n ) {
  char *res = mem + mpos;
  mpos += n;
  assert(mpos <= MAX_MEM);
  return (void *)res;
}
inline void operator delete ( void * ) { }
/** End fast allocation */

inline void * operator new [] ( size_t ) { assert(0); }
inline void operator delete [] ( void * ) { assert(0); }
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using vec = pair<ll, ll>;
using ld = long double;
ll dot(vec a, vec b) {
	return a.first*b.first + a.second*b.second;
}
struct cht {
	vector<vec> hull;
	vector<int> id;
	void clear() {
		hull.clear();
		id.clear();
	}
	bool nok(ll x, ll y, ll x1, ll y1, ll x2, ll y2) {
		if(x1==x2)return y1<=y2;
		if(x==x1)return y1<=y2;
		ll a = (y1 - y)/(x1 - x);
		ll b = (y2 - y1)/(x2 - x1);
		if(a<b)return true;
		if(a>b)return false;
		return (y1 - y)*(x2 - x1) - (y2 - y1)*(x1 - x) < (1e-3);
	}
	bool rem() {
		int n = hull.size();
		if (n < 3)
			return 0;
		return nok(hull[n - 3].first, hull[n - 3].second, hull[n - 2].first,
				hull[n - 2].second, hull[n - 1].first, hull[n - 1].second);
	}
	void add(vec x, int i) {
		hull.pb(x);
		id.pb(i);
		while (rem()) {
			swap(hull.back(), hull[hull.size() - 2]), hull.pop_back();
			swap(id.back(), id[id.size() - 2]), id.pop_back();
		}
	}
	ll get(vec x, int &v) {
		ll l = 0, r = (int)hull.size() - 1, a;
		while (r - l > 6) {
			a = l + (r - l) / 2;
			if (dot(x, hull[a]) < dot(x, hull[a+1]))
				l = a;
			else
				r = a+1;
		}
		ll ans = 0;
		while (l <= r) {
			ll t = dot(x, hull[l]);
			if(ans < t)
				v = id[l], ans = t;
			l++;
		}
		return ans;
	}
};

const int MK = 220, MN = 1e5 + 3;
ll n, a[MN], pref[MN], dp[2][MN];
int p[MK][MN];
vi z;
void bt(int a, int b) {
	if(!b)return;
	z.pb(b);
	if (a > 1)
		bt(a - 1, p[a][b]);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i], pref[i] = pref[i - 1] + a[i];
	}
	ll ans = -1, g = n - 1;
	cht x;
	for (int at = 1; at <= k; at++) {
		int a = at&1;
		x.clear();
//		if(a==1)
		x.add(vec(0, 0), 0);
		for (int i = 1; i < n; i++) {
			if(i>=at) {
			dp[a][i] = x.get(vec(1, pref[n]-pref[i]), p[at][i]) + pref[i]*(pref[n]-pref[i]);
			ans = max(ans, dp[a][i]);
			if (ans == dp[a][i])
				g = i;
			}else dp[a][i] = dp[a^1][i];
			x.add(vec(dp[a^1][i], -pref[i]), i);
		}
	}

	cout << ans << '\n';
	bt(k, g);
	set<int> xx;
	for(auto i : z)
		cout << i << " ", xx.insert(i);
	int v = 1;
	while(z.size() < k) {
		while(xx.count(v)){v++;}
		xx.insert(v);
		z.pb(v);
		cout << v << " ";
	}
}

Compilation message

sequence.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
sequence.cpp: In function 'int main()':
sequence.cpp:132:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(z.size() < k) {
        ~~~~~~~~~^~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 372 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Correct 2 ms 376 KB contestant found the optimal answer: 0 == 0
4 Correct 2 ms 376 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 2 ms 376 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
7 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
8 Correct 2 ms 376 KB contestant found the optimal answer: 1 == 1
9 Correct 2 ms 376 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 2 ms 376 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 2 ms 376 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 2 ms 376 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 2 ms 504 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 376 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 3 ms 380 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 376 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 2 ms 376 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 632 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 376 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 2 ms 380 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 380 KB contestant found the optimal answer: 933702 == 933702
7 Correct 2 ms 504 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 2 ms 504 KB contestant found the optimal answer: 687136 == 687136
9 Correct 2 ms 376 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 2 ms 504 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 2 ms 376 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 5 ms 1400 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 5 ms 1144 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 5 ms 1272 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 6 ms 1400 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 3 ms 632 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 3 ms 504 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 3 ms 632 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 504 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 23 ms 2168 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 508 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 25 ms 2168 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 22 ms 1912 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 25 ms 2168 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 24 ms 2040 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 7 ms 760 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 21 ms 1144 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1144 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 1144 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 278 ms 9948 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 7 ms 1272 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 234 ms 6272 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 214 ms 7232 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 222 ms 7820 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 179 ms 6492 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 207 ms 7288 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 262 ms 9044 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 8440 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 63 ms 8384 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Execution timed out 2078 ms 55488 KB Time limit exceeded
4 Halted 0 ms 0 KB -