CSES - Datatähti 2018 loppu

CSES - Datatähti 2018 loppu - Results

Submission details
Task:	Metsämetro
Sender:	ollpu
Submission time:	2018-01-18 15:24:10 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	14
#2	ACCEPTED	28
#3	ACCEPTED	58

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.05 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.04 s	1	details
#7	ACCEPTED	0.06 s	1	details
#8	ACCEPTED	0.05 s	1	details
#9	ACCEPTED	0.06 s	1	details
#10	ACCEPTED	0.05 s	1	details
#11	ACCEPTED	0.05 s	2	details
#12	ACCEPTED	0.04 s	2	details
#13	ACCEPTED	0.05 s	2	details
#14	ACCEPTED	0.04 s	2	details
#15	ACCEPTED	0.04 s	2	details
#16	ACCEPTED	0.04 s	2	details
#17	ACCEPTED	0.04 s	2	details
#18	ACCEPTED	0.04 s	2	details
#19	ACCEPTED	0.03 s	2	details
#20	ACCEPTED	0.05 s	2	details
#21	ACCEPTED	0.14 s	3	details
#22	ACCEPTED	0.16 s	3	details
#23	ACCEPTED	0.16 s	3	details
#24	ACCEPTED	0.12 s	3	details
#25	ACCEPTED	0.15 s	3	details
#26	ACCEPTED	0.14 s	3	details
#27	ACCEPTED	0.19 s	3	details
#28	ACCEPTED	0.15 s	3	details
#29	ACCEPTED	0.18 s	3	details
#30	ACCEPTED	0.16 s	3	details

Code

#include <iostream>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  long t[n];
  for (int i = 0; i < n; ++i) {
    cin >> t[i];
  }
  long lmax[n-1], rmax[n-1];
  long lmin[n-1], rmin[n-1];
  lmin[0] = t[0];
  rmin[n-2] = t[n-1];
  lmax[0] = t[0];
  rmax[n-2] = t[n-1];
  for (int i = 1; i < n-1; ++i) {
    lmax[i] = lmax[i-1]+t[i];
  }
  for (int i = n-3; i; --i) {
    rmax[i] = rmax[i+1]+t[i+1];
  }
  long mires = 0, mares = 0;
  for (int i = 0; i < n-1; ++i) {
    mares = max(mares, min(lmax[i], rmax[i]));
  }
  long jmp = 1l<<48;
  long TX = 0;
  for (; jmp; jmp /= 2) {
    long ov = (1l<<47)-TX-jmp;
    long ovp = ov&1;
    if (lmax[0] > ov || rmax[n-2] > ov) continue;
    bool f = 1;
    for (int i = 1; i < n-1; ++i) {
      if (t[i] > 2*ov) {f=0; break;}
      long prt = (lmax[i-1]+t[i])&1;
      if (lmax[i-1]+t[i] <= ov) lmax[i] = lmax[i-1]+t[i];
      else {
        if (abs(t[i]-lmax[i-1]) > ov) {f=0;break;}
        if (ovp != prt) lmax[i] = ov-1;
        else lmax[i] = ov;
      }
      lmin[i] = min(abs(lmin[i-1]-t[i]), abs(lmax[i-1]-t[i]));
      long tv = t[i]-prt;
      if (tv >= lmin[i-1] && tv <= lmax[i-1]) lmin[i] = min(lmin[i], prt);
      if (lmin[i] > lmax[i]) {f=0;break;}
    }
    if (!f) continue;
    for (int i = n-3; i >= 0; --i) {
      long prt = (rmax[i+1]+t[i+1])&1;
      if (rmax[i+1]+t[i+1] <= ov) rmax[i] = rmax[i+1]+t[i+1];
      else {
        if (abs(t[i+1]-rmax[i+1]) > ov) {f=0;break;}
        if (ovp != prt) rmax[i] = ov-1;
        else rmax[i] = ov;
      }
      rmin[i] = min(abs(rmin[i+1]-t[i+1]), abs(rmax[i+1]-t[i+1]));
      long tv = t[i+1]-prt;
      if (tv >= rmin[i+1] && tv <= rmax[i+1]) rmin[i] = min(rmin[i], prt);
      if (rmin[i] > rmax[i]) {f=0;break;}
    }
    if (f) TX += jmp;
  }
  mires = (1l<<47)-TX;
  cout << mires <<" "<< mares << endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`10 9 4 9 7 6 10 4 6 2 9` view save

correct output
`9 31` view save

user output
`9 31` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`10 5 6 3 5 6 3 4 7 1 10` view save

correct output
`10 25` view save

user output
`10 25` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`10 10 2 4 1 4 9 6 3 5 10` view save

correct output
`10 24` view save

user output
`10 24` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`10 7 5 1 3 8 4 5 4 6 3` view save

correct output
`7 22` view save

user output
`7 22` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`10 10 7 8 4 10 6 8 6 2 3` view save

correct output
`10 29` view save

user output
`10 29` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`10 1 2 8 2 3 1 3 1 4 9` view save

correct output
`9 17` view save

user output
`9 17` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`10 2 8 2 5 8 8 5 10 9 7` view save

correct output
`7 31` view save

user output
`7 31` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`10 2 10 4 8 10 10 9 3 9 7` view save

correct output
`8 34` view save

user output
`8 34` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`10 10 7 9 1 7 8 4 4 1 5` view save

correct output
`10 27` view save

user output
`10 27` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10 1 4 7 7 3 1 10 6 4 3` view save

correct output
`5 23` view save

user output
`5 23` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`100 5 3 4 7 5 1 7 1 6 10 2 9 6 5 9...` view save

correct output
`6 281` view save

user output
`6 281` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`100 3 9 7 3 6 6 4 3 1 8 2 4 2 6 2 ...` view save

correct output
`7 252` view save

user output
`7 252` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`100 8 2 3 4 8 3 2 7 10 10 3 2 3 4 ...` view save

correct output
`8 252` view save

user output
`8 252` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`100 4 4 9 8 5 6 2 3 7 10 10 2 7 5 ...` view save

correct output
`9 261` view save

user output
`9 261` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`100 7 3 3 5 10 6 6 8 10 5 5 8 3 5 ...` view save

correct output
`10 300` view save

user output
`10 300` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`100 9 5 2 1 9 8 6 4 1 6 3 5 3 1 4 ...` view save

correct output
`9 289` view save

user output
`9 289` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`100 9 7 5 5 4 1 9 2 3 5 10 2 10 5 ...` view save

correct output
`9 287` view save

user output
`9 287` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`100 3 8 5 10 8 10 9 2 8 3 1 2 9 7 ...` view save

correct output
`6 282` view save

user output
`6 282` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`100 6 3 9 2 8 7 8 4 6 4 4 10 2 10 ...` view save

correct output
`8 260` view save

user output
`8 260` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`100 10 8 7 8 10 3 1 2 1 1 7 4 5 5 ...` view save

correct output
`10 279` view save

user output
`10 279` view save

Test 21

Group: 3

Verdict: ACCEPTED

input
`100000 917855934 394938644 81692499 4...` view save

correct output
`917855934 23490295363738` view save

user output
`917855934 23490295363738` view save

Test 22

Group: 3

Verdict: ACCEPTED

input
`100000 898177957 193852227 11785863 3...` view save

correct output
`898177957 23488890808371` view save

user output
`898177957 23488890808371` view save

Test 23

Group: 3

Verdict: ACCEPTED

input
`100000 560743028 996665755 25721760 4...` view save

correct output
`576170439 23599624330076` view save

user output
`576170439 23599624330076` view save

Test 24

Group: 3

Verdict: ACCEPTED

input
`100000 836491959 800539061 666447484 ...` view save

correct output
`836491959 23450143338851` view save

user output
`836491959 23450143338851` view save

Test 25

Group: 3

Verdict: ACCEPTED

input
`100000 156445358 170997055 927078622 ...` view save

correct output
`930838017 23503313036290` view save

user output
`930838017 23503313036290` view save

Test 26

Group: 3

Verdict: ACCEPTED

input
`100000 869942654 614144284 154904581 ...` view save

correct output
`869942654 23544105883410` view save

user output
`869942654 23544105883410` view save

Test 27

Group: 3

Verdict: ACCEPTED

input
`100000 471025024 244072220 419574192 ...` view save

correct output
`657776925 23597080152723` view save

user output
`657776925 23597080152723` view save

Test 28

Group: 3

Verdict: ACCEPTED

input
`100000 561299091 285120535 109702008 ...` view save

correct output
`862325964 23517085653307` view save

user output
`862325964 23517085653307` view save

Test 29

Group: 3

Verdict: ACCEPTED

input
`100000 356879006 3017698 603259365 18...` view save

correct output
`499995467 23540251578008` view save

user output
`499995467 23540251578008` view save

Test 30

Group: 3

Verdict: ACCEPTED

input
`100000 190109479 83895435 595795373 8...` view save

correct output
`598676555 23565408317817` view save

user output
`598676555 23565408317817` view save

Datatähti 2018 loppu

Metsämetro

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

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (ollpu)