CSES - Putka Open 2020 – 1/5 - Results
Submission details
Task:Vaihdot
Sender:Metabolix
Submission time:2020-09-05 23:12:22 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.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
#90.01 s2, 3details
#10ACCEPTED0.08 s2, 3details
#11ACCEPTED0.02 s2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.03 s2, 3details
#14ACCEPTED0.06 s2, 3details
#15ACCEPTED0.06 s2, 3details
#16ACCEPTED0.05 s2, 3details
#170.07 s3details
#18--3details
#19--3details
#20--3details
#21ACCEPTED0.73 s3details
#22--3details
#23--3details
#24--3details

Code

#include <iostream>
#include <vector>
#include <unordered_map>
#if 0
Mahdollisuudet:
1 4 3 2 5 <=> 1 2 3 4 5 = parannus 2
1 3 2 4 5 <=> 1 2 3 4 5 = parannus 1
3 4 5 1 2 <=> 3 4 1 5 2 = parannus 0
1 2 3 4 5 <=> 2 1 3 4 5 = parannus -1
#endif
#define MAX 200000
#define MAX_POW2 262144
int n, L[MAX+4], Li[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 matka_3(int a, int b, int c) {
if (a < b && b < c) return 1;
if (a < b || b < c) return 2;
return 3;
}
struct tulos {
int parannus = 0, tapoja = 0;
void uusi(int p) {
if (p > parannus) {
parannus = p;
tapoja = 1;
} else if (p == parannus) {
tapoja += 1;
}
}
};
struct valipuu {
std::unordered_map<int, std::vector<int>> tiettyyn_indeksiin_haluavat_luvut;
void lisaa(int valin_alku, int valin_loppu, int haluaja) {
lisaa_(valin_alku, valin_loppu + 1, haluaja);
}
void lisaa_(int valin_alku, int valin_loppu, int haluaja, int va = 0, int vl = MAX_POW2, int vsize = MAX_POW2, int node = 1) {
if (valin_alku >= vl || valin_loppu <= va) {
return;
}
if (valin_alku <= va && valin_loppu >= vl) {
tiettyyn_indeksiin_haluavat_luvut[node].push_back(haluaja);
} else {
lisaa_(valin_alku, valin_loppu, haluaja, va, va + (vsize >> 1), vsize >> 1, (node << 1));
lisaa_(valin_alku, valin_loppu, haluaja, va + (vsize >> 1), vl, vsize >> 1, (node << 1) | 1);
}
}
template <typename T> void foreach(int kohde, T func) {
int node = kohde | MAX_POW2;
while (node) {
for (int i: tiettyyn_indeksiin_haluavat_luvut[node]) {
func(i);
}
node >>= 1;
}
}
};
struct dummypuu {
void lisaa(int a, int b, int c) {}
template <typename T> void foreach(int kohde, T func) {}
};
int main() {
std::cin >> n;
L[0] = Li[0] = 0;
L[n+1] = Li[n+1] = n+1;
L[n+2] = Li[n+2] = n+2;
bool suora = true;
for (int i = 1; i <= n; ++i) {
std::cin >> L[i];
Li[L[i]] = i;
suora &= i == L[i];
}
if (n == 2 && L[1] == 1) {
puts("2 1");
return 0;
}
if (n == 2 && L[1] == 2) {
puts("1 1");
return 0;
}
if (suora) {
puts("2 2");
return 0;
}
int kierroksia = 1;
for (int i = 1; i < n; ++i) {
if (Li[i+1] < Li[i]) {
kierroksia += 1;
}
}
tulos t;
for (int i = 1; i < n; ++i) {
// Jos vaihdetaan luvut i ja i + 1
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]);
int p = m0 - m1;
t.uusi(p);
}
// Kerätään välit, jonne luvut haluavat.
valipuu nollat, ykkoset, miinukset;
for (int i = 1; i <= n; ++i) {
// E = edellinen, S = seuraava
if (Li[i - 1] < Li[i]) {
// E i
if (Li[i + 1] > Li[i]) {
// E i S
nollat.lisaa(Li[i - 1], Li[i + 1], i);
miinukset.lisaa(0, Li[i - 1], i);
miinukset.lisaa(Li[i + 1], n+1, i);
} else if (Li[i + 1] > Li[i - 1]) {
// E S i
nollat.lisaa(1, Li[i - 1], i);
nollat.lisaa(Li[i + 1], n+1, i);
ykkoset.lisaa(Li[i - 1], Li[i + 1], i);
} else {
// S E i
nollat.lisaa(Li[i - 1], n+1, i);
nollat.lisaa(0, Li[i + 1], i);
miinukset.lisaa(Li[i + 1], Li[i - 1], i);
}
} else {
// i E
if (Li[i + 1] < Li[i]) {
// S i E
nollat.lisaa(Li[i + 1], Li[i - 1], i);
ykkoset.lisaa(0, Li[i + 1], i);
ykkoset.lisaa(Li[i - 1], n+1, i);
} else if (Li[i + 1] > Li[i - 1]) {
// i E S
nollat.lisaa(0, Li[i - 1], i);
nollat.lisaa(Li[i + 1], n+1, i);
ykkoset.lisaa(Li[i - 1], Li[i + 1], i);
} else {
// i S E
nollat.lisaa(0, Li[i + 1], i);
miinukset.lisaa(Li[i + 1], Li[i - 1], i);
nollat.lisaa(Li[i - 1], n+1, i);
}
}
}
for (int i = 1; i <= n; ++i) {
ykkoset.foreach(Li[i], [&](int j) {
if (j <= i+1) return;
int p = 1 + matka_3(Li[i-1], Li[i], Li[i+1]) - matka_3(Li[i-1], Li[j], Li[i+1]);
t.uusi(p);
});
if (t.parannus < 2)
nollat.foreach(Li[i], [&](int j) {
if (j <= i+1) return;
int p = 0 + matka_3(Li[i-1], Li[i], Li[i+1]) - matka_3(Li[i-1], Li[j], Li[i+1]);
t.uusi(p);
});
if (t.parannus < 1)
miinukset.foreach(Li[i], [&](int j) {
if (j <= i+1) return;
int p = -1 + matka_3(Li[i-1], Li[i], Li[i+1]) - matka_3(Li[i-1], Li[j], Li[i+1]);
t.uusi(p);
});
}
#if 0
for (int i = 1; i <= n; ++i) {
printf("Kohta %d\n", i);
printf("Ykköset: ");
ykkoset.foreach(i, [](int n) { printf("%d ", n); });
printf("\n");
printf("Nollat: ");
nollat.foreach(i, [](int n) { printf("%d ", n); });
printf("\n");
printf("Miinukset: ");
miinukset.foreach(i, [](int n) { printf("%d ", n); });
printf("\n");
printf("\n");
}
#endif
printf("%d %d\n", kierroksia - t.parannus, t.tapoja);
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

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

correct output
2 99

user output
2 2

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:

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

correct output
2 4999

user output
2 2

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:

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

correct output
2 199999

user output
2 2

Test 18

Group: 3

Verdict:

input
200000
200000 199999 199998 199997 19...

correct output
199998 19999700001

user output
(empty)

Test 19

Group: 3

Verdict:

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

correct output
19 10

user output
(empty)

Test 20

Group: 3

Verdict:

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

correct output
199 100

user output
(empty)

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:

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

correct output
18081 477187

user output
(empty)

Test 23

Group: 3

Verdict:

input
200000
151013 68675 119105 58292 3335...

correct output
86328 318722426

user output
(empty)

Test 24

Group: 3

Verdict:

input
200000
11562 33356 106752 170825 2723...

correct output
99873 663048119

user output
(empty)