oj.uz

Submission #155973

# Submission time Handle Problem Language Result Execution time Memory
155973 2019-10-02T11:33:02 Z solarmagic Split the sequence (APIO14_sequence) C++17
100 / 100
 1010 ms 83776 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define solarmagic ios_base::sync_with_stdio(0),cin.tie(0)

struct P { ll X, Y; int idx;};
struct CHT{
	vector<P> line;
	int now;

	CHT() { now = 0; }
	ll f(ll i, ld x) { return line[i].X*x + line[i].Y; }
	inline ld cross(int i, int j) { 
		return (ld)(line[i].Y - line[j].Y) / (ld)(line[j].X - line[i].X);
	}
	void insert(P a) {
		line.push_back(a);
		int i = SZ(line) - 1;

        // cht코드에 문제가 있다면 이 if문만 보면 될 듯(나머진 맞을거임)
        // (평행할 때 처리인데 이건 질문 게시판 나와 있는것처럼 평행하면 Y절편 이 높은걸 남김)
		if (i > 1) { 
			if (line[i].X == line[i-1].X) {
                if (line[i].Y > line[i-1].Y) line[i-1] = line[i];
				line.pop_back();
				return ;
			}
		}

		while (i > 1 && cross(i, i-1) < cross(i-1, i-2)) {
			line[i-1] = line.back();
			line.pop_back();
			i--;
		}
	}

	pair<ll,int> get(ll k) { 
		do {
			if (now == SZ(line)-1) return {f(now, k),line[now].idx};
			ld cr = cross(now, now+1);
            if (abs(cr-k) < 0.0000000001) {now++; continue;} // 실수 오차가 있음 ㅡ.ㅡ;
			if (k < cr) return {f(now, k),line[now].idx};
			now++;
		} while (true);
	}

    void clear() {
        line.clear();
        now = 0;
    }
} cht;

ll s[100001];
ll d[100001][2];
vector<int> zeros;
int track[201][100001];
int main() {
    solarmagic;

    ll n, k; cin >> n >> k;
    for (int i = 1; i <= n; i++) {
    	cin >> s[i];
        if (s[i] == 0 && SZ(zeros) < k) zeros.push_back(i);
    	s[i] += s[i-1];
    }
    for (int j = 1; j <= k; j++) {
        cht.clear();
        cht.insert({0,0,-1});
    	for (int i = 1; i <= n; i++) {
    		auto p = cht.get(s[i]);
    		d[i][j%2] = p.first;
    		track[j][i] = p.second;
    		cht.insert({s[i],-s[i]*s[i]+d[i][1-j%2], i});
    	}
    }	
    cout << d[n][k%2] << '\n'; 

    vector<int> ans;
    for (int i = k - 1; i >= 0; i--) {
    	n =  track[i+1][n];
        if (n == -1) break;
        ans.push_back(n);
    }
    sort(ALL(ans));
    ans.erase(unique(ALL(ans)), ans.end());
    for (int i = SZ(ans), j = 0; i < k; i++, j++) {
        ans.push_back(zeros[j]);
    }
    sort(ALL(ans));
    for (auto i : ans) cout << i << ' ';
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 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 380 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 376 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 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

# Verdict Execution time Memory 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 760 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 396 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 508 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

# Verdict Execution time Memory 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 1528 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 376 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 1144 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 1400 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 4 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 2 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

# Verdict Execution time Memory 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 12 ms 2168 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 504 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 12 ms 2168 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 11 ms 1832 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 12 ms 2168 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 11 ms 2296 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 4 ms 764 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 6 ms 1144 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1080 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 4 ms 1080 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 91 ms 9844 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 5 ms 1208 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 63 ms 6216 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 71 ms 7004 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 76 ms 7688 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 59 ms 6388 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 66 ms 7164 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 86 ms 8824 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6120 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 27 ms 6244 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 885 ms 83776 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 31 ms 6884 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1010 ms 83372 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 686 ms 59728 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 743 ms 64504 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 581 ms 53464 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 627 ms 60248 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 803 ms 75784 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845