CSES - Putka Open 2020 – 1/5 - Results
Submission details
Task:Vaihdot
Sender:Metabolix
Submission time:2020-09-06 14:17:49 +0300
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED13
#2ACCEPTED23
#3ACCEPTED64
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s2, 3details
#10ACCEPTED0.01 s2, 3details
#11ACCEPTED0.01 s2, 3details
#12ACCEPTED0.01 s2, 3details
#13ACCEPTED0.01 s2, 3details
#14ACCEPTED0.01 s2, 3details
#15ACCEPTED0.01 s2, 3details
#16ACCEPTED0.01 s2, 3details
#17ACCEPTED0.31 s3details
#18ACCEPTED0.18 s3details
#19ACCEPTED0.11 s3details
#20ACCEPTED0.11 s3details
#21ACCEPTED0.11 s3details
#22ACCEPTED0.13 s3details
#23ACCEPTED0.24 s3details
#24ACCEPTED0.28 s3details

Code

#include <iostream>
#define MAX 200000
#define MAX_POW2 262144
int n, L[MAX+4], Li[MAX+4];
bool oikea[MAX+4], oikeat[MAX+4];
struct luku {
int a, b, muutos_1a, muutos_ab, muutos_bn;
};
luku T[MAX+4];
int matka_4(int a, int b, int c, int d) {
if (a < b && b < c && c < d) return 1;
if ((a < b && b < c) || (b < c && c < d) || (a < b && c < d)) return 2;
if (a < b || b < c || c < d) return 3;
return 4;
}
int vaihtamalla_paranee(int a, int b1, int b2, int c) {
if (a < b1 && b1 < c) {
if (a < b2 && b2 < c) return 0;
if (a < b2 || b2 < c) return -1;
return -2;
}
if (a < b1 || b1 < c) {
if (a < b2 && b2 < c) return 1;
if (a < b2 || b2 < c) return 0;
return -1;
}
if (a < b2 && b2 < c) return 2;
if (a < b2 || b2 < c) return 1;
return 0;
}
struct tulos {
int kierroksia0 = 1, parannus = -3;
long tapoja = 0;
void uusi(int p, int n = 1) {
if (n <= 0) {
return;
} else if (p > parannus) {
parannus = p;
tapoja = n;
} else if (p == parannus) {
tapoja += n;
}
}
};
struct magic {
bool data[MAX+4] = {0};
int count_tree[MAX_POW2 * 2] = {0};
void insert(int i) {
if (!data[i]) {
data[i] = 1;
update_count(Li[i], 1);
}
}
int erase(int i) {
if (data[i]) {
data[i] = 0;
update_count(Li[i], -1);
return 1;
}
return 0;
}
int count(int i) {
return data[i];
}
void update_count(int i, int val) {
i |= MAX_POW2;
while (i) {
count_tree[i] += val;
i >>= 1;
}
}
int count_interval(int a, int b) {
return count_interval_(a, b+1, 0, MAX_POW2, 1);
}
int count_interval_(int a, int b, int a0, int b0, int node) {
if (b0 <= a || b <= a0) {
return 0;
}
if (a <= a0 && b0 <= b) {
return count_tree[node];
}
int c0 = (a0 + b0) >> 1;
return count_interval_(a, b, a0, c0, (node << 1)) + count_interval_(a, b, c0, b0, (node << 1) | 1);
}
};
magic paranee, sama, huononee;
void aseta_oikea(int i) {
if (oikea[i]) {
paranee.erase(i);
sama.insert(i);
} else {
paranee.insert(i);
sama.erase(i);
}
huononee.erase(i);
}
void aseta_vaara(int i) {
paranee.erase(i);
if (oikea[i]) {
sama.erase(i);
huononee.insert(i);
} else {
sama.insert(i);
huononee.erase(i);
}
}
void havaittu(int i) {
if (i + 1 <= n) aseta_oikea(i + 1);
if (i - 1 >= 1) aseta_vaara(i - 1);
}
int aseta_tauolle(int i) {
if (paranee.erase(i)) return 1;
if (sama.erase(i)) return 0;
if (huononee.erase(i)) return -1;
return -2;
}
void aseta_takaisin(int i, int mihin) {
switch (mihin) {
case -1: huononee.insert(i); break;
case 0: sama.insert(i); break;
case 1: paranee.insert(i); break;
}
}
int main() {
tulos t;
std::cin >> n;
L[0] = Li[0] = 0;
L[n+1] = Li[n+1] = n+1;
L[n+2] = Li[n+2] = n+2;
oikea[0] = oikea[n+1] = oikea[n+2] = 1;
for (int i = 1; i <= n; ++i) {
std::cin >> L[i];
Li[L[i]] = i;
}
// oikeat
for (int i = 1; i <= n; ++i) {
oikeat[L[i] + 1] = 1;
oikeat[L[i] - 1] = 0;
if (Li[i+1] < Li[i]) {
t.kierroksia0 += 1;
}
}
oikeat[1] = 1;
oikeat[n] = 0;
for (int i = 1; i <= n; ++i) {
oikea[L[i]] = oikeat[L[i]];
oikeat[L[i] + 1] = 1;
oikeat[L[i] - 1] = 0;
}
// paranee/huononee
for (int i = 1; i <= n; ++i) {
havaittu(L[i]);
int k = L[i];
T[i].a = std::min(Li[k - 1], Li[k + 1]);
T[i].b = std::max(Li[k - 1], Li[k + 1]);
T[i].muutos_1a = vaihtamalla_paranee(Li[k - 1], i, T[i].a-1, Li[k + 1]);
T[i].muutos_ab = vaihtamalla_paranee(Li[k - 1], i, T[i].a+1, Li[k + 1]);
T[i].muutos_bn = vaihtamalla_paranee(Li[k - 1], i, T[i].b+1, Li[k + 1]);
}
aseta_oikea(1);
aseta_vaara(n);
// vaihto i ~ i+1
for (int i = 1; i < n; ++i) {
int m0 = matka_4(Li[i - 1], Li[i], Li[i + 1], Li[i + 2]);
int m1 = matka_4(Li[i - 1], Li[i + 1], Li[i], Li[i + 2]);
t.uusi(m0 - m1);
}
t.tapoja *= 2;
// muut vaihdot
for (int i = 1; i <= n; ++i) {
auto const x = T[i];
aseta_tauolle(L[x.a]);
aseta_tauolle(L[x.b]);
int taukotila = aseta_tauolle(L[i]);
int muutos;
if ((muutos = 1 + x.muutos_1a) >= t.parannus) t.uusi(muutos, paranee.count_interval(1, x.a));
if ((muutos = 1 + x.muutos_ab) >= t.parannus) t.uusi(muutos, paranee.count_interval(x.a, x.b));
if ((muutos = 1 + x.muutos_bn) >= t.parannus) t.uusi(muutos, paranee.count_interval(x.b, n));
if ((muutos = 0 + x.muutos_1a) >= t.parannus) t.uusi(muutos, sama.count_interval(1, x.a));
if ((muutos = 0 + x.muutos_ab) >= t.parannus) t.uusi(muutos, sama.count_interval(x.a, x.b));
if ((muutos = 0 + x.muutos_bn) >= t.parannus) t.uusi(muutos, sama.count_interval(x.b, n));
if ((muutos = -1 + x.muutos_1a) >= t.parannus) t.uusi(muutos, huononee.count_interval(1, x.a));
if ((muutos = -1 + x.muutos_ab) >= t.parannus) t.uusi(muutos, huononee.count_interval(x.a, x.b));
if ((muutos = -1 + x.muutos_bn) >= t.parannus) t.uusi(muutos, huononee.count_interval(x.b, n));
aseta_takaisin(L[i], taukotila);
havaittu(L[i]);
}
printf("%d %ld\n", t.kierroksia0 - t.parannus, t.tapoja / 2);
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
2 99

user output
2 99

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
100 99 98 97 96 95 94 93 92 91...

correct output
98 4851

user output
98 4851

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
1 2 88 4 5 6 7 8 9 10 11 12 13...

correct output
16 5

user output
16 5

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
51 48 74 70 45 71 24 88 55 99 ...

correct output
49 131

user output
49 131

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
45 67 29 62 70 77 41 74 52 95 ...

correct output
52 268

user output
52 268

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
47 98 2 75 6 21 84 8 4 89 27 9...

correct output
48 149

user output
48 149

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
73 68 17 94 71 63 61 13 58 10 ...

correct output
47 116

user output
47 116

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
100
17 16 45 94 6 1 36 81 31 13 51...

correct output
45 95

user output
45 95

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
5000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
2 4999

user output
2 4999

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
5000
5000 4999 4998 4997 4996 4995 ...

correct output
4998 12492501

user output
4998 12492501

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
5000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
19 10

user output
19 10

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
5000
1 2 3 4 5 6 264 8 9 10 11 12 1...

correct output
190 96

user output
190 96

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
5000
1 2 3 4 5 6 7 8 9 2400 11 12 1...

correct output
1378 27938

user output
1378 27938

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
5000
4012 2 4820 4208 1868 1728 362...

correct output
2511 436307

user output
2511 436307

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
5000
3877 3972 1112 3669 1959 4640 ...

correct output
2497 417065

user output
2497 417065

Test 16

Group: 2, 3

Verdict: ACCEPTED

input
5000
2774 998 4525 2884 487 1995 41...

correct output
2518 426448

user output
2518 426448

Test 17

Group: 3

Verdict: ACCEPTED

input
200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
2 199999

user output
2 199999

Test 18

Group: 3

Verdict: ACCEPTED

input
200000
200000 199999 199998 199997 19...

correct output
199998 19999700001

user output
199998 19999700001

Test 19

Group: 3

Verdict: ACCEPTED

input
200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
19 10

user output
19 10

Test 20

Group: 3

Verdict: ACCEPTED

input
200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
199 100

user output
199 100

Test 21

Group: 3

Verdict: ACCEPTED

input
200000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
1979 1030

user output
1979 1030

Test 22

Group: 3

Verdict: ACCEPTED

input
200000
1 2 184153 4 5 6 7 8 164545 10...

correct output
18081 477187

user output
18081 477187

Test 23

Group: 3

Verdict: ACCEPTED

input
200000
151013 68675 119105 58292 3335...

correct output
86328 318722426

user output
86328 318722426

Test 24

Group: 3

Verdict: ACCEPTED

input
200000
11562 33356 106752 170825 2723...

correct output
99873 663048119

user output
99873 663048119