CSES - APIO 2007

CSES - APIO 2007 - Results

Submission details
Task:	Backup
Sender:	ollpu
Submission time:	2019-03-07 15:12:36 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	30
#2	ACCEPTED	30
#3	ACCEPTED	40

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.25 s	3	details
#4	ACCEPTED	0.23 s	3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.03 s	2, 3	details
#7	ACCEPTED	0.03 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.02 s	2, 3	details
#10	ACCEPTED	0.03 s	2, 3	details
#11	ACCEPTED	0.07 s	3	details
#12	ACCEPTED	0.25 s	3	details
#13	ACCEPTED	0.13 s	3	details
#14	ACCEPTED	0.01 s	1, 2, 3	details
#15	ACCEPTED	0.01 s	2, 3	details
#16	ACCEPTED	0.04 s	3	details
#17	ACCEPTED	0.25 s	3	details
#18	ACCEPTED	0.02 s	2, 3	details
#19	ACCEPTED	0.01 s	2, 3	details
#20	ACCEPTED	0.16 s	3	details

Code

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
set<pair<long, int>> ch;
long pfi[101010];
set<int> xh;
inline void erase_idx(int i) {
  long val = pfi[i];
  xh.erase(i);
  ch.erase({val, i});
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  int lv = -1;
  for (int i = 0; i < n; ++i) {
    int nv;
    cin >> nv;
    if (i) {
      ch.insert({nv-lv, i});
      xh.insert(i);
      pfi[i] = nv-lv;
    }
    lv = nv;
  }
  long res = 0;
  for (int kr = 0; kr < k; ++kr) {
    auto it = ch.begin();
    auto p = *it;
    auto iat = xh.upper_bound(p.S);
    auto ibt = prev(iat);
    res += p.F;
    if (ibt == xh.begin()) {
      erase_idx(p.S);
      if (iat != xh.end()) erase_idx(*iat);
    } else {
      ibt--;
      if (iat == xh.end()) {
        erase_idx(*ibt);
        erase_idx(p.S);
      } else {
        pfi[p.S] = pfi[*iat] + pfi[*ibt] - p.F;
        ch.erase(it);
        ch.insert({pfi[p.S], p.S});
        erase_idx(*ibt);
        erase_idx(*iat);
      }
    }
  }
  cout << res << endl;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1 0 1000000000` view save

correct output
`1000000000` view save

user output
`1000000000` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`17 8 101266 101394 101458 101490 ...` view save

correct output
`340` view save

user output
`340` view save

Test 3

Group: 3

Verdict: ACCEPTED

input
`100000 49000 29983 53806 76909 106815 ...` view save

correct output
`411321413` view save

user output
`411321413` view save

Test 4

Group: 3

Verdict: ACCEPTED

input
`100000 30000 29983 53806 76909 106815 ...` view save

correct output
`100755932` view save

user output
`100755932` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 10 126229031 250138471 333910089 443521720 ...` view save

correct output
`537092323` view save

user output
`537092323` view save

Test 6

Group: 2, 3

Verdict: ACCEPTED

input
`10000 4999 168328 266967 462469 639689 ...` view save

correct output
`492516409` view save

user output
`492516409` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 4 165 375 439 456 ...` view save

correct output
`44` view save

user output
`44` view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 9 4336 4500 4552 4702 ...` view save

correct output
`773` view save

user output
`773` view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`2001 1000 1230 1440 1630 2230 ...` view save

correct output
`493503` view save

user output
`493503` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`10000 3000 245408 417449 650973 863296 ...` view save

correct output
`101056127` view save

user output
`101056127` view save

Test 11

Group: 3

Verdict: ACCEPTED

input
`50000 20000 37035 37042 37046 37052 ...` view save

correct output
`129968` view save

user output
`129968` view save

Test 12

Group: 3

Verdict: ACCEPTED

input
`99999 48000 15929 43928 65765 86730 ...` view save

correct output
`375524431` view save

user output
`375524431` view save

Test 13

Group: 3

Verdict: ACCEPTED

input
`100000 1000 536 9214 34619 53734 ...` view save

correct output
`75975` view save

user output
`75975` view save

Test 14

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 4 5851 5854 5856 5859 ...` view save

correct output
`2664` view save

user output
`2664` view save

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
`100 45 3712 13742 17394 19428 ...` view save

correct output
`140256` view save

user output
`140256` view save

Test 16

Group: 3

Verdict: ACCEPTED

input
`20000 400 3174 3175 3176 3179 ...` view save

correct output
`803105` view save

user output
`803105` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`100000 49000 3605 14510 18001 20881 ...` view save

correct output
`162316123` view save

user output
`162316123` view save

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
`100 50 0 1000000 1000002 1000005 ...` view save

correct output
`1002499` view save

user output
`1002499` view save

Test 19

Group: 2, 3

Verdict: ACCEPTED

input
`1000 500 0 1000000 1000002 1000005 ...` view save

correct output
`1249999` view save

user output
`1249999` view save

Test 20

Group: 3

Verdict: ACCEPTED

input
`100000 49494 123 65659 98427 114811 ...` view save

correct output
`250954854` view save

user output
`250954854` view save

APIO 2007

Backup

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (ollpu)