CSES - Putka Open 2020 – 1/5 - Results
Submission details
Task:Vaihdot
Sender:AtskaFin
Submission time:2020-09-06 10:28:11 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.14 s1, 2, 3details
#30.01 s1, 2, 3details
#40.05 s1, 2, 3details
#50.06 s1, 2, 3details
#60.05 s1, 2, 3details
#70.05 s1, 2, 3details
#80.05 s1, 2, 3details
#90.01 s2, 3details
#100.73 s2, 3details
#110.26 s2, 3details
#12--2, 3details
#13--2, 3details
#14--2, 3details
#15--2, 3details
#16--2, 3details
#170.07 s3details
#18--3details
#19--3details
#20--3details
#21--3details
#22--3details
#23--3details
#24--3details

Code

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

int n;
vector<int> v;
vector<vector<int>> rows;
vector<pair<int, int>> possibleSwitches;

int calculateRounds(pair<int, int> p) {
  set<int> starts;

  for (int i = 0; i < n; i++) {
    if (v[i] == p.first) {
      if (!starts.count(p.second - 1)) {
        starts.insert(p.second);
      } else {
        starts.erase(p.second - 1);
        starts.insert(p.second);
      }
    } else if (v[i] == p.second) {
      if (!starts.count(p.first - 1)) {
        starts.insert(p.first);
      } else {
        starts.erase(p.first - 1);
        starts.insert(p.first);
      }
    } else {
      if (!starts.count(v[i] - 1)) {
        starts.insert(v[i]);
      } else {
        starts.erase(v[i] - 1);
        starts.insert(v[i]);
      }
    }
  }

  return starts.size();
}

int main() {
  cin >> n;
  v.resize(n);

  for (int i = 0; i < n; i++) cin >> v[i];

  vector<int> tmp;
  int c = 0;
  int last = 0;
  while (c < n) {
    tmp.clear();
    for (int i = 0; i < n; i++) {
      if (v[i] == last+1) {
        tmp.push_back(v[i]);
        c++;
        last = v[i];
      }
    }

    rows.push_back(tmp);
  }

  int len = rows.size();
  for (int i = 0; i < len; i++) {
    for (int j = i+1; j < len; j++) {
      possibleSwitches.push_back({ rows[i][0], rows[j][0] });
      possibleSwitches.push_back({ rows[i][0], rows[j][rows[j].size() - 1] });
      possibleSwitches.push_back({ rows[i][rows[i].size() - 1], rows[j][0] });
      possibleSwitches.push_back({ rows[i][rows[i].size() - 1], rows[j][rows[j].size() - 1] });
    }
  }

  vector<int> counts (possibleSwitches.size());
  len = possibleSwitches.size();
  for (int i = 0; i < len; i++) {
    counts[i] = calculateRounds(possibleSwitches[i]);
  }

  sort(counts.begin(), counts.end());

  int ans = 1;
  for (int i = 1; i < n; i++) {
    if (counts[i] == counts[i-1]) ans++;
    else break;
  }

  cout << counts[0] << " " << ans / 2 + 1;
}

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
(empty)

Test 2

Group: 1, 2, 3

Verdict:

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

correct output
98 4851

user output
98 51

Test 3

Group: 1, 2, 3

Verdict:

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

correct output
16 5

user output
16 4

Test 4

Group: 1, 2, 3

Verdict:

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

correct output
49 131

user output
49 51

Test 5

Group: 1, 2, 3

Verdict:

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

correct output
52 268

user output
52 51

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
48 149

user output
48 51

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
47 116

user output
47 51

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
45 95

user output
45 51

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
(empty)

Test 10

Group: 2, 3

Verdict:

input
5000
5000 4999 4998 4997 4996 4995 ...

correct output
4998 12492501

user output
(empty)

Test 11

Group: 2, 3

Verdict:

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

correct output
19 10

user output
19 6

Test 12

Group: 2, 3

Verdict:

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

correct output
190 96

user output
(empty)

Test 13

Group: 2, 3

Verdict:

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

correct output
1378 27938

user output
(empty)

Test 14

Group: 2, 3

Verdict:

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

correct output
2511 436307

user output
(empty)

Test 15

Group: 2, 3

Verdict:

input
5000
3877 3972 1112 3669 1959 4640 ...

correct output
2497 417065

user output
(empty)

Test 16

Group: 2, 3

Verdict:

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

correct output
2518 426448

user output
(empty)

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
(empty)

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:

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

correct output
1979 1030

user output
(empty)

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)