oj.uz

답안 #94857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
94857 2019-01-24T15:23:32 Z aminra 수열 (APIO14_sequence) C++14
100 / 100
 667 ms 84224 KB 
//Smaug never desolated!!
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = (int)1e5 + 3;
const int MAXS = (int)203;
const int MOD = (int)1e9 + 7;
const int infint = (int)1e9;
const ll inf = (ll)1e15;
int n, k;
ll dp[2][MAXN];
int par[MAXS][MAXN];
ll part[MAXN];
int a[MAXN];
pair<ll, ll> D[100005];
ld calc(pair<ll, ll> a, pair<ll, ll> b) 
{
	return ((ld)a.second - b.second) / (b.first - a.first);
}
int main() 
{
	scanf("%d%d", &n, &k);
	set<int> s;
	for (int i = 1; i <= n; i++) 
	{
		scanf("%d", &a[i]);
		part[i] = part[i - 1] + a[i];
		if(!a[i])
			s.insert(i);
	}
	for (int i = 1; i <= k; i++) 
	{
		deque<int> dq;
		int cur = i & 1;
		int pre = (i - 1) & 1;
		for (int j = 1; j <= n; j++) 
		{
			if (!a[j]) 
			{
				dp[cur][j] = dp[cur][j - 1];
				par[i][j] = par[i][j - 1];
				continue;
			}
			while (dq.size() > 1 && calc(D[dq[0]], D[dq[1]]) <= part[j])
				dq.pop_front();
			if (!dq.empty()) 
			{
				dp[cur][j] = D[dq[0]].first * part[j] + D[dq[0]].second;
				par[i][j] = dq[0];
			}
			ll a = part[j];
			ll b = dp[pre][j] - part[j] * part[j];
			D[j] = make_pair(a, b);
			while (dq.size() > 1 && calc(D[dq.back()], D[j]) <= calc(D[dq[dq.size() - 2]], D[j]))
				dq.pop_back();
			dq.push_back(j);
		}
	}
	printf("%lld\n", dp[k & 1][n]);
	vector<int> ans;
	while (k) 
	{
		ans.push_back(par[k][n]);
		n = par[k][n];
		k--;
	}
	for (int i = 0; i < ans.size(); i++) 
	{
		s.erase(ans[i]);
		if (!ans[i]) 
		{
			printf("%d ", *s.begin());
			s.erase(s.begin());
		}
		else
			printf("%d ", ans[i]);
	}
	printf("\n");
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:68:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++) 
                  ~~^~~~~~~~~~~~
sequence.cpp:23:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 504 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 380 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 376 KB contestant found the optimal answer: 140072 == 140072
14 Correct 2 ms 424 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 2 ms 376 KB contestant found the optimal answer: 805 == 805
16 Correct 2 ms 380 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 376 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 2 ms 376 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 376 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 376 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 4 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 3 ms 1144 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 1272 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 1400 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 632 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 508 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 632 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1016 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 1016 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 62 ms 9568 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 4 ms 888 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 42 ms 6136 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 45 ms 7032 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 63 ms 7416 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 45 ms 6108 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 46 ms 6968 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 59 ms 8656 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 6868 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 27 ms 6844 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 617 ms 83208 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 23 ms 6420 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 667 ms 84224 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 466 ms 60908 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 654 ms 64084 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 470 ms 53016 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 457 ms 60348 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 565 ms 76168 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845